If there is any feedback, please provide it anonymously in this Google form.
Date |
References | Problems | |
|---|---|---|---|
| Lecture 0 | Prerequisite | ||
| (1.1 to 1.9 in [3]) | |||
| Lecture 1 | 2nd January 2024 | Introduction (Ch 1 in [1]) | START01 |
| Lecture 2 | 4th January 2024 | Simple Algorithms | WATERFILLING, PAINTCHRIS |
| Lecture 3 | 5th January 2024 | CodeChef (AIRM, Code) | PRB01, DPOLY |
| Lecture 4 | 9th January 2024 | Big-O Notation (Ch 3.1 in [2]) | Make N Zero, SOCKS1 |
| Lecture 5 | 11th January 2024 | Other Notations (Ch 3.1 in [2]) | NUM239 |
| Lecture 6 | 12th January 2024 | Arrays as ADT (Ch 4.1-4.4 in [1]) | CHESS_PAIR, SUMTRIAN |
| Lecture 7 | 16th January 2024 | Bubble Sort & Polynomials | INSTDUM |
| (Ch 4.7 and 4.11 in [1]) | |||
| Lecture 8 | 18th January 2024 | Pointers, Struct, malloc ( Code) | ZOOZ, EZSPEAK |
| (Ch 1.11.1, 1.11.2, 1.11.3 and 5.1 in [3]) | |||
Quiz-0 |
19th January 2024 | In Computer Center (during Lecture time) | Quiz-0 |
| Lecture 9 | 23th January 2024 | Functions and Linked List ( Code) | BREAKSTICK |
| (Ch 1.10 and 6.1 [3]) | |||
| Lecture 10 | 25th January 2024 | Linked List ( Code) | PATHPAR, EQUALIZEAB |
| (Ch 6.2 in [3]) | |||
| Lecture 11 | 30th January 2024 | Stacks ( Code, Code-2) | WORDLE |
| (Ch 7.5 and 7.7.2 in [3]) | |||
| Lecture 12 | 1st February 2024 | Polish Notation | ONP, REMOVEBAD, |
| (Ch 7.7.3 in [3]) | |||
| Lecture 13 | 2nd February 2024 | Queues | PERFCONT, DAILY, |
| (Ch 8 in [3]) | |||
| Lecture 14 | 6th February 2024 | Binary Trees | HOWMANYMAX |
| (Ch 9.1.1., 9.4.1 to 9.4.3 in [3]) | |||
| Lecture 15 | 8th February 2024 | Binary Search Trees | HILLS, TWODIFFPALIN |
| (Ch 10.1, 10.2 in [3]) | |||
| Lecture 16 | 9th February 2024 | Binary Search Trees ( Code) | DOUBLEDDIST, MD_RIEV |
| (Ch 10.1, 10.2 in [3]) | |||
| Lecture 17 | 9th February 2024 | Binary Search Trees ( Code) | |
| (Ch 10.1, 10.2 in [3]) | |||
| Lecture 18 | 16th February 2024 | AVL Trees | |
| (Ch 10.4 in [3]) | |||
| Lecture 19 | 16th February 2024 | AVL Trees | |
| (Ch 10.4 in [3]) | |||
| Lecture 20 | 20th February 2024 | Red-Black Trees | |
| Lecture Notes Long, Short | |||
| Lecture 22 | 22nd February 2024 | Red-Black Trees | |
| Lecture Notes Long, Short | |||
| Tutorial | 23nd February 2024 | ||
Midterm |
26th Feb 2024 | ||
| Lecture 23 | 5th March 2024 | Binary Max Heap ( Code) | REPEAT, COVID19 |
| (Ch 12.1 in [3]) | |||
| Lecture 24 | 19th March 2024 | Graphs | STRAME, DISTDILEM |
| (Ch 13.1, 13.2, 13.5.1, 13.5.2 in [3]) | |||
| Lecture 25 | 21th March 2024 | BFS, DFS | PREFONES, MINRPC |
| (Ch 13.6 in [3]) | |||
| Lecture 26 | 22nd March 2024 | Minimum Spanning Tree | MONTRANS, MGCSET |
| (Ch 13.8.1, 13.8.2, 13.8.3 in [3]) | |||
| Lecture 27 | 2nd April 2024 | Dijkstra's Algorithm | CHCOINSG, ROTATION |
| (Ch 13.8.4 in [3]) | |||
| Lecture 28 | 4th April 2024 | Sorting: Bubble Sort, Insertion Sort | LUCKY5, SDICE |
| (Ch 14.6, 14.7, 14.8 in [3]) | |||
| Lecture 29 | 5th April 2024 | Merge Sort, Quick Sort | TRAVELER, XOR_ORDER |
| (Ch 14.10, 14.11 in [3]) | |||
| Lecture 30 | 9th April 2024 | Radix Sort, Shell Sort | SUMNEQ7, MINRPC |
| (Ch 14.12, 14.14 in [3]) | |||
| Lecture 31 | 12th April 2024 | Hashing | DISTCON, SDICE |
| (Ch 15.1 to 15.5 in [3]) | |||
| Lecture 32 | 14th April 2024 | Greedy Algorithms | PINBS, XORRY1 |
| (Ch 4.2 in [4]) | |||
| Lecture 33 | 14th April 2024 | Dynamic Programming | IRSTXOR, ANTIPALINDR |
| (Ch 6.1.1, 6.1.2 in [4]) | |||
| Lecture 34 | 16th April 2024 | Divide and Conquer | |
| (Ch 4.1 in [2]) | |||
| Tutorial | 18th April 2024 | ||
***** |
***** | ***** | |
Problem Set |
-- | Problem Set (Final Update) | |
***** |
***** | ***** |
| Nr. | Book | Authors |
|---|---|---|
| [1] | Data Structures with C | Seymour Lipschutz |
| [2] | Introduction to Algorithms | Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein |
| [3] | Data Structures Using C | Reema Thareja |
| [4] | Guide to Competitive Programming Data | Antti Laaksonen |