# Data Structures

This is the course page for Data Structures (CS130N), for Semester II, 2000-2001, being taught by Subhashis Banerjee (suban@cse.iitd.ac.in ) at the Department of Computer Science and Engineering, IIT, New Delhi.

#### General Information

 Teaching assistants: Class timings (Room III LT 1): Tuesday, 08:00-09:00 Thursday, 09:00-10:00 Friday, 08:00-09:00 Tutorials (Room MS 542): Monday, 14:00-15:00 Tuesday, 14:00-15:00 Thursday, 14:00-15:00 Friday, 14:00-15:00 Books: Algorithms by Cormen, Leiserson and Rivest Data Structures by Horowitz and Sahni

#### Tutorials

1. Problem set #1: Induction, recurrences and counting. Postscript, PDF, html.
2. Problem set #2: Asymptotic orders of growth. Postscript, PDF, html.
3. Problem set #3: Some Data structures + Algorithms. Postscript, PDF, html.
4. Problem set #4: Binary search trees and height balancing. Postscript, PDF, html.
5. Problem set #5: Dictionaries. Postscript, PDF, html.
6. Problem set #6: Miscelleneous Algos and Data Structures. Postscript, PDF, html
7. Problem set #7: Basic graph traversal. Postscript, PDF, html
8. Problem set #8: Weighted graphs. Postscript, PDF, html

#### Assignments

1. Assignment #1: Implementing big numbers. Errata.
2. Assignment #2: Symbolic differentiation.
3. Assignment #3: Discrete event simulation and some graphics animation. Here are two early submission examples (perhaps not entirely correct):
4. Assignment #4: Weighted graphs.

#### Programming resources

Subhashis Banerjee / Dept. Computer Science and Engineering / IIT Delhi / Hauz Khas/ New Delhi 110016 / suban@cse.iitd.ac.in