IGNOU BCA(4) BCSL-045 Introduction to Algorithm Design Lab Solved Assignment 2019-20

Course Code: BCSL-045
Course Title: Introduction to Algorithm Design Lab
Assignment Number: BCA(4)/L-045/Assignment/2019-20
Maximum Marks: 50
Weightage: 25%
Last date of Submission: 15th October 2019 (For July 2019 Session)
15th April 2020 (For January 2020 Session)
Note: Answer all the questions in the assignment having 40 marks in total. 10 marks are for viva voce. You are required to write programs in C-language for all the problems, execute and show the results. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of the presentation. Make a suitable assumption if necessary.
To get the full solved assignment of BCSL-045 (2019-20), Click Here

IGNOU BCA Solved Assignment 2019-20

IGNOU BCA 1st Semester Solved Assignment 2019-20

IGNOU BCA 2nd Semester Solved Assignment 2019-20

IGNOU BCA 3rd Semester Solved Assignment 2019-20

IGNOU BCA 4th Semester Solved Assignment 2019-20

IGNOU MCA Solved Assignment 2019-20

Q1. Write a program to compute $X^{n}$ , where both 𝑋 and 𝑛 an integer numbers using left to right binary exponentiation algorithm.

Q2. Write a program to find the largest number in the five arrays using linear search algorithm. Calculate the total no of comparison operations and the number of times the loop will execute.

Q3. Write a program to traverse a graph using BFS. Apply this algorithm to the following graph and write the sequence of vertices to be traveled. Also, calculate the number of times the loop(s) will execute.

BCSL 045

Q4. Implement GCD (Greatest common divisor) problem using Euclid’s algorithm. Apply this algorithm to find the output of GCD of 225 and 15. Also, calculate how many times the mod and equal operations will execute.

Q5. Implement and apply Kruskal’s algorithm to find a minimum cost spanning tree and test the result for the following graph:

BCSL 045

Q6. Implement Karatsuba’s method using Divide & Conquer method to multiply two integer numbers. Test the result in multiplication of the following numbers and count the number of multiplication operations.

$532680 \times 43286$