Data Structures

Course code	COL106
Instructors	Naveen Garg and Ashish Chiplunkar
Teaching Assistants	TBD
Classes	~~LH121~~ LH325 (Lecture Hall Complex); Tuesday, Thursday, Friday 11:00 - 12:00 (Slot F)
Office hour	TBD

Eligibility and Prerequisites

This offering of COL106 is only for CS, EE, and MT undergraduates; all others interested in taking COL106 will have to do so in an even semester. COL100 is a hard pre-requisite, so students who haven't passed in COL100 are not eligible. No exceptions!

Content

COL100 recap: Python progamming, arrays, recursion, recurrence relations and time complexity analysis, sorting algorithms
Linked lists, Stacks, Queues
Binary Trees and their properties
Priority Queues, Heapsort
Ordered Dictionaries: Binary Search Trees, AVL Trees, 2-4 Trees, B-trees
Unordered Dictionaries and Hashing
String Processing: Knuth-Morris-Pratt Algorithm, Tries, Suffix Trees
Graphs: Adjacency Matrix and List Representation, Breadth-First and Depth-First Traversals
Advanced topics: Randomized Algorithms, Randomized Quicksort

Textbook

"Data Structures and Algorithms in Python" by Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Useful Platforms

Microsoft Teams for announcements, discussion forum, lecture material
Gradescope for assignment submission and exam feedback

Evaluation Policy

Programming Assignments	30%	Late submission not permitted.
Minor exam	25%
Pre-major Quiz	5%
Major exam	35%
Attendance and class participation	5%

Passing criteria: At least 30% marks total, at least 30% marks in exams.

Cheating policy: 0 in the entire programming assignment component if found copying code (also applies to students who let others copy their code). F grade + disciplinary action if found cheating in exams.