Advanced Data Structures and Algorithms (ADSA

)

SCS 2009
3 credits

m Group 1 ± W108 Group 3 ± W110 .5.00 p.m ± 3.m ± 12.m Group 2 ± W108 Group 4 ± W110 Thursday 1.00 p.Time Table ‡ Lecture Tuesday 10.00 p.00 p.00 a.00 noon ‡ Practicals Wednesday 3.m .

Bellman Ford ‡ Minimum Spanning Trees .Prim's Algorithms .Syllabus ‡ Hashing Graphs ‡ Breadth First Search (BFS) ‡ Depth First Search (DFS) ‡ Shortest Path Algorithms .Kruskal's Algorithms ‡ Minimum Spanning Trees .Dijkstra ‡ Shortest Path Algorithms .

Syllabus ‡ Solving Recurrences ‡ Dynamic Programming ‡ Greedy Algorithm ‡ String Matching Algorithms ‡ Binomial & Fibbonacci Heaps *** .

Cormen. Charles E. Ronald L. Leiserson.References ‡ Introduction to Algorithms Thomas H. Rivest. Clifford Stein .

Shortest Path Algorithms 4.Minimum Spanning Trees 5.Breadth First Search (BFS) .String Matching (Group) with a presentation . 11th Week . 2nd Week . 3rd Week . 7th Week . 12th Week .Hashing 2.Solving Recurrences (In-class) 6.Dynamic & Greedy Algorithms 7. 9th Week . 5th Week .Depth First Search (DFS) 3.Assignment Schedule 1.

Evaluation ‡ Present 70% (Exam) 30% (Assignments) 60% (Exam) 40% (Assignments) ‡ Proposed .

LMS ‡ to get the latest information about the course updates. ‡ Enrolment Key ADSA .

Sign up to vote on this title
UsefulNot useful