Page 114 - Microsoft Word - B.Tech. Course Structure (R20) WITH 163 CREDITS

JNTUA College of Engineering (Autonomous),Ananthapuramu
Department of Computer Science & Engineering
Design and Analysis Of Algorithms Lab
Course Code: Semester V(R20) L T P C : 0 0 3 1.5
Course Objectives:
● Implement the various algorithms that are being studied in Design and Analysis
of Algorithms subject in C++/Java.
● Analyze the asymptotic performance of algorithms.
● Write rigorous correctness proofs for algorithms.
● Demonstrate a familiarity with major algorithms and data structures.
● Apply important algorithmic design paradigms and methods of analysis.
● Synthesize efficient algorithms in common engineering design situations

Course Outcomes:
After completion of the course, students will be able to

● Argue the correctness of algorithms using inductive proofs and invariants.
● Analyze worst-case running times of algorithms using asymptotic analysis
● Explain what competitive analysis is and to which situations it applies. Perform competitive
analysis

List of Experiments:
1. Write a program that implements Prim’s algorithm to generate minimum
cost spanning tree.
2. Write a program that implements Kruskal’s algorithm to generate minimum
cost spanning tree.
3. Write a program to implement Huffman’s algorithm for text compression.
4. Write a program to implement Dijkstra’s algorithm for Single source shortest
path problem.
5. Write a program to implement Floyd’s algorithm for the All pairs shortest
path problem.
6. Write a program to implement Floyd’s algorithm for the All pairs shortest
path problem.
7. Write a program to implement greedy algorithm for job sequencing with deadlines.
8. Write programs for the implementation of bfs and dfs for a given graph.
9. Write a program to find Minimum Cost Binary Search Tree.
10. Write a program to implement Dynamic Programming algorithm for 0/1
Knapsack problem.
11. Write a program to implement the Backtracking algorithm for the sum of
subsets problem.
12. Write programs to implement backtracking algorithms for
a) N-queens problem
b) The Hamiltaonian cycles problem
c) The m-colourings graph problem

Mdv
Mdv