FREE
AKTU Design and Analysis of Algorithm Lab (BCS553) Syllabus PDF – B.Tech 3rd Year
Design and Analysis of Algorithm Lab BCS553
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 5
- 0 downloads
- 0 views
Official AKTU syllabus of Design and Analysis of Algorithm Lab (BCS553) for B.Tech 3rd Year – 1 credits, L-T-P 0-0-2. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
- Computer Science and Engineering › 3rd Year
- Computer Science › 3rd Year
- Computer Engineering › 3rd Year
- Information Technology › 3rd Year
- Computer Science and Information Technology › 3rd Year
- Computer Science & Technology › 3rd Year
- Computer Science and Design › 3rd Year
- Computer Science and Engineering (Artificial Intelligence) › 3rd Year
- Computer Science and Engineering (Artificial Intelligence & Machine Learning) › 3rd Year
- Artificial Intelligence and Machine Learning › 3rd Year
- Artificial Intelligence (AI) and Data Science › 3rd Year
- Computer Science and Engineering (Data Science) › 3rd Year
- Computer Science & Engineering (Cyber Security) › 3rd Year
- Computer Science and Engineering (Internet of Things) › 3rd Year
Syllabus — Design and Analysis of Algorithm Lab
Download PDFBCS553 · 1 credits · L-T-P 0-0-2
Course Outcomes
At the end of course, the student will be able to:
| CO 1 | Implement algorithm to solve problems by iterative approach. | K , K 2 4 |
| CO 2 | Implement algorithm to solve problems by divide and conquer approach | K , K 3 5 |
| CO 3 | Implement algorithm to solve problems by Greedy algorithm approach. | K , K 4 5 |
| CO 4 | Implement algorithm to solve problems by Dynamic programming, backtracking, branch and bound approach. | K , K 4 5 |
| CO 5 | Implement algorithm to solve problems by branch and bound approach. | K , K 3 4 |
Course Content
- Program for Recursive Binary & Linear Search.
- Program for Heap Sort.
- Program for Merge Sort.
- Program for Selection Sort.
- Program for Insertion Sort.
- Program for Quick Sort.
- Knapsack Problem using Greedy Solution
- Perform Travelling Salesman Problem
- Find Minimum Spanning Tree using Kruskal’s Algorithm
- Implement N Queen Problem using Backtracking
- Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus non graph sheet. The elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how the divide and- conquer method works along with its time complexity analysis: worst case, average case and best case.
- Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for varied values of n> 5000, and record the time taken to sort. Plot a graph of the time taken versus non graph sheet. The elements can be read from a file or can be generated using the random number generator. Demonstrate how the divide and- conquer method works along with its time complexity analysis: worst case, average case and best case. 13.6. Implement, the 0/1 Knapsack problem using
- Dynamic Programming method
- Greedy method.
- From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.
- Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's algorithm. Use Union-Find algorithms in your program.
- Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
- Write programs to (a) Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
- Implement Travelling Sales Person problem using Dynamic programming.
- Design and implement to find a subset of a given set S = {Sl, S2, .... ,Sn} of n positive integers whose SUM is equal to a given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and {1,8}. Display a suitable message, if the given problem instance doesn't have a solution.
- Design and implement to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices using backtracking principle. Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner It is also suggested that open source tools should be preferred to conduct the lab ( C, C++ etc)
Ratings & Reviews
No reviews yet — share your experience with this item.