#1 Best Selling IGNOU Assignments in All Available in Market
Bought By: 1005 Students
Rating:
Get IGNOU BCSL-45 Assignments Soft Copy ready for Download in PDF for (July 2023 - January 2024) in English Language.
Are you looking to download a PDF soft copy of the Solved Assignment BCSL-45 - Algorithm Design Lab? Then GullyBaba is the right place for you. We have the Assignment available in English language.
This particular Assignment references the syllabus chosen for the subject of Computer Application, for the July 2023 - January 2024 session. The code for the assignment is BCSL-45 and it is often used by students who are enrolled in the BCA Degree.
Once students have paid for the Assignment, they can Instantly Download to their PC, Laptop or Mobile Devices in soft copy as a PDF format. After studying the contents of this Assignment, students will have a better grasp of the subject and will be able to prepare for their upcoming tests.
Q1. Implement the Bubble Sort algorithm for sorting the following list of numbers, showing the list obtained at each step:
17, 25, 32, 4 ,7, 19 , 81, 45, 1, 33
Also calculate the total number of exchange operations and how many times the loop will execute in this algorithm
Q2. Implement Quick Sort algorithm to sort the following array:
Q3. Write a program to implement to reverse the following string :
“ ABCDEFGHIJ”
and calculate (i) Total number of exchange operations
(ii) Total number of comparison operations
(iii) Total number of times the loop will execute
Q4. Implement the Binary Search Algorithm to search for a number 29 in the following array
and calculate how many comparison and division operations will be required for searching the number.
Q5. Apply Kruskal’s algorithm to find a minimum cost spanning tree for the following graph:
Q1. Write a program to implement Binary Search algorithm for an array consisting of at least 15 elements in the range 2 to 85.
Q2. Write and test a program to sort the following array of integer numbers using Insertion Sort. 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 DFS. Apply this algorithm to the following graph and write the sequence of vertices to be travelled. Also calculate the number of times the loop(s) will execute.
Q4. Implement Horner’ rule for evaluating the following polynomial expression at x =5. Calculate the total number of times additions and multiplication operations will occur in this example
p(x) = 3𝑥 5 - 4𝑥 4 + 5𝑥 3 - 6x + 9
Q5. Implement and apply Kruskal’s algorithm to find a minimum cost spanning tree and test the result for the following graph:
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.
5 3 2 6 8 0 * 4 3 2 8 6
The IGNOU open learning format requires students to submit study Assignments. Here is the final end date of the submission of this particular assignment according to the university calendar.
Here are the PDF files that you can Download for this Assignment. You can pick the language of your choice and see other relevant information such as the Session, File Size and Format.
In this section you can find other relevant information related to the Assignment you are looking at. It will give you an idea of what to expect when downloading a PDF soft copy from GullyBaba.
In addition to this Assignment, there are also other Assignments related to the BCA Computer Application you are preparing for. Here we have listed other Assignments that were bought along with this one.