|
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
Grades
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
|
Exams
Tutorials
- Problem set #1: Induction, recurrences and counting.
Postscript,
PDF,
html.
- Problem set #2: Asymptotic orders of growth.
Postscript,
PDF,
html.
- Problem set #3: Some Data structures + Algorithms.
Postscript,
PDF,
html.
- Problem set #4: Binary search trees and height balancing.
Postscript,
PDF,
html.
- Problem set #5: Dictionaries.
Postscript,
PDF,
html.
- Problem set #6: Miscelleneous Algos and Data Structures.
Postscript,
PDF,
html
- Problem set #7: Basic graph traversal.
Postscript,
PDF,
html
- Problem set #8: Weighted graphs.
Postscript,
PDF,
html
Assignments
- Assignment #1: Implementing big numbers. Errata.
- Assignment #2: Symbolic differentiation.
- Assignment #3: Discrete event simulation and some
graphics animation. Here are two early
submission examples (perhaps not entirely correct):
- Example 1
- Example 2
- Assignment #4: Weighted graphs.
Programming resources
|