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 | Tutorials | Assignments | Exams | Programming resources

• Current assignment submission
• Re-submissions open: Assignment 1| Assignment 2| Assignment 3

General Information

Exams

• Minor I
• Minor II
• Minor III
• Major

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

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):
   1. Example 1
   2. Example 2
4. Assignment #4: Weighted graphs.

• Java Tutorials
• Programming Principles in Java by Dave Schmidt , a draft of a forthcoming book with the kind permission of the author.
• Java Technology Home Page