| | The course instructor is available for discussions and clarification of doubts in Room No. 4102 on:
Mon 5-5:45 pm
Tue 9:30-10 am
Wed 5-5:45 pm
Thu 10:30-11 am
You can also seek to meet the course instructor at other times by prior appointment (chintan_shah[AT]daiict[DOT]ac[DOT]in).
| |
| | 14 September - 20 September Mon : Big-Oh notation
Tue : Big-Oh notation (contd.)
Thu : Sorting - brute force approach
| 
|
| | 21 September - 27 September Mon : Holiday
Tue : Selection Sort
|
|
| | 28 September - 4 OctoberMon : Holiday
Tue : Lecture Cancelled
|
|
| | 5 October - 11 October Mon : Insertion Sort
Tue : Bubble Sort
Thu : Merge Sort
|
|
| | 12 October - 18 October Mon : Quicksort
Second in-sem examination
|
|
| | 19 October - 25 OctoberDiwali Break |
|
| | 26 October - 1 NovemberMon : Data Structures - Arrays, Linked Lists, Queues, Stacks
Tue : Data Structures - Generalized Queue, Priority Queues,
Graphs and their representations - adjacency matrix, adjacency list
|
|
| | 2 November - 8 NovemberTue : Heaps |
|
| | 9 November - 15 NovemberTue : BFS
Thu : DFS
|
|
| | 16 November - 22 NovemberMon : MST - Kruskal's Algorithm
Tue : MST - Prim's Algorithm, Greedy v/s. Dynamic Programming
Thu : Matrix Chain Multiplication
|
|
| | 23 November - 29 November Wed : 2:00 pm - 5:00 pm Final Examination
(25th November, 2009 : 14:00-17:00)
|
|
