Advanced Data Structures and Algorithms

(ADSA)
SCS 2009
3 credits
 Time Table
• Lecture
Tuesday 10.00 a.m – 12.00 noon

• Practicals
Wednesday 3.00 p.m - 5.00 p.m
Group 2 – W108
Group 4 – W110

Thursday 1.00 p.m – 3.00 p.m

Group 1 – W108
Group 3 – W110
 Syllabus

• Hashing

Graphs

• Breadth First Search (BFS)

• Depth First Search (DFS)

• Shortest Path Algorithms - Dijkstra

• Shortest Path Algorithms - Bellman Ford

• Minimum Spanning Trees - Kruskal's Algorithms

• Minimum Spanning Trees - Prim's Algorithms
 Syllabus

• Solving Recurrences

• Dynamic Programming
• Greedy Algorithm

• String Matching Algorithms

• Binomial & Fibbonacci Heaps ***

 References
• Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson,
Ronald L. Rivest, Clifford Stein
 Assignment Schedule
1. 2nd Week - Hashing
2. 3rd Week - Breadth First Search (BFS)
- Depth First Search (DFS)
3. 5th Week - Shortest Path Algorithms
4. 7th Week - Minimum Spanning Trees
5. 9th Week - Solving Recurrences (In-class)
6. 11th Week - Dynamic & Greedy Algorithms
7. 12th Week - String Matching (Group) with a
presentation
 Evaluation
• Present 70% (Exam)
30% (Assignments)

• Proposed 60% (Exam)

40% (Assignments)
 LMS
• to get the latest information about the
course updates.

• Enrolment Key
ADSA