Data Structures (0368.2158)
Messages to Students:
Instructors:
Prof. Hanoch Levy (hanoch@cs.tau.ac.il)
The material covered during the semester (Second semester 2003/04):
- Week 1 (March 1) :
Recursions + Introduction (from problem to program)
- Week 2 (March 8) :
- Week 3 (March 15) : Lists, Queues, Stacks, started dynamic tables
- Week 4 (March 22) :
Finished dynamic tables, amortized complexity and the doubling method, covered
the basics of trees, binary trees and Huffman Code
- Week 5 (March 29) : Simple set representation, prioirty queues: Heaps, binary search trees (completed operations and started analysis)
- Week 6 (April 19) : Binary search trees, 2-3 trees, B-trees, Multi-lists.
- Week 7 (May 3): Dictionary, Hash, Universal Hashing
- Week 8 (May 10) :
- Week 9 (May 17) : Finished Sorting.
- Week 10 (May 24) : Order Stat, Merge-Find, Started Perfect hash.
- Week 11 (May 31) :
- Week 12 (June 7) :
-
This page was last modified on 25/05/04.