Syllabus

MA29005
Course name	Design & Analysis of Algorithms Lab.
Offered by	Mathematics
Credits	2
L-T-P	0-0-3
Previous Year Grade Distribution
	17
	34
	17
	12
Semester	{{{semester}}}

Syllabus mentioned in ERP

Prerequisite: Design & Analysis of Algorithms Binary Search Tree, Tree traversals. Sorting Algorithms : Selection sort, Insertion sort, Heap sort, Merge sort, Quick sort; Shortest path algorithms : Kruskal, Prim’s, Dijkstra, Floyd –Warshall, Bellman-Ford; Graph Traversal: DFS, BFS; Back Tracking, Dynamic Programming. Height Balanced Tree.

Concepts taught in class

Data Structures - Trees, Graphs, Heaps, Hash Tables; Sorting Algorithms; Graph Algorithms - Minimum Spanning Tree, Dijkstra, Depth-First Search, Breadth-First Search.; Greedy Algorithms; Dynamic programming;

Student Opinion


Very basic course on Algorithms, with no real challenges. Excellent as a kick-start to DSA, but very mundane and basic for someone wanting to get well acquainted to the same. TAs are a little less proficient though when it comes to C programming, but are helpful in clearing your fundamentals about a particular problem, as is Prof. Sourav Mukhopadhyay.

How to Crack the Paper


Submit the lab assignments on time and you'll be fine. The lab exams are pretty basic, however one needs to be wary of cases where there is a good chance of the program faltering.

Classroom resources

Have a look at the basic questions on every data structure and algorithm on Geeks for Geeks, and practice it before hand.

Additional Resources

Time Table

Day	2:00-2:55 pm	3:00-3:55 pm	4:00-4:55 pm
Monday	PC_lab-II	PC_lab-II	PC_lab-II
Tuesday
Wednesday
Thursday
Friday