 |
Data Structures and Algorithms 1 (2021 Aug-Dec) |
Assessment
5%: :Student Participation
30% :Lab Assignments
30% : Programming Evaluation
35% : Mid/End Sem Viva
Syllabus
The tentative list of topics covered are as follows:
Sorting
Stacks, Queues, Lists
Trees, Tree Traversals, Heaps
Binary Search, Binary Search Trees
Graphs, BFS, DFS
Notes
| Tentative Schedule | Topic | Lecture | Slides | Video |
| Week 1 | Big-O | big-O | 1 | 1,2 |
| Week 2 | Sorting | Insertion-Sort | 2 | 3 |
| Week 3 | Heap Sort | heapsort,heap,heap(array) | 3 | 4,5,6 |
| Week 4 | MergeSort | mergesort | 4 | 7 |
| QuickSort | quicksort | 5 | 8,9,10 | |
| Week 5 | Masters Theorem | 6 | 11 | |
| Week 6 | Radix Sort | radixsort | 7 | 12,13 |
| Week 7 | MidTerm Solutions | midsem | 14 | |
| Week 7 | Pointers | pointers | 15 | |
| Arrays and Lists | list.pdf | 8 | 16 | |
| Week 5 | Stacks, Queues | stackqueues | 9 | 17,18,19 |
| Week 5 | BST | 10 | 20,21 | |
| Week 6 | Graphs and BFS | graph-youtube,BFS-youtube | 11,12 | 22,24 |
| Week 7 | DFS | DFS-youtube | 13 | 23 |
Labs
| Lab | Questions | Video/Solutions | |
| Lab1 | 1 | 1 | |
| Lab2 | 2 | 2 | |
| Lab3 | 3 | lab3solutions | |
| Lab4 | 4 | lab4solutions | |
| Lab5 | 5 | lab5solutions | |
| Lab Exam 1 | labexam1 | Solution | |
| Mid Sem Exam | midsem | ||
| Lab6 | 6 | Solution | |
| Lab7 | 7 | Solution | |
| Lab8 | 8 | Solution | |
| Lab Exam 2 | labexam2 | Solution | |
| End Sem Exam | endsem | ||
Honor Code
Please read the IIT Gandhinagar Honor Code.
References
Data Structures and Algorithms. Goodrich, Michael T., Tamassia, Robert, Algorithm Design: Foundations, Analysis and Internet Examples.
Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms (3E), PHI, 2010.
Aho, Alfred V., Hopcroft, John E.Ullman, Jeffrey D., Data Structures and Algorithms.
Langsam and Tannenbaum, Data Structures using C and C++, PHI, 1998.