Data Structures (0368.2158)

1st Semester, 2004/05 -
School of Computer Science
Tel-Aviv University

Messages to Students:

Instructors:

Prof. Hanoch Levy (hanoch@cs.tau.ac.il)

The material covered during the semester (First semester 2004/05):

• Week 1 :
  Recursions. Introduction.

• Week 2 :
  
  
Complexity.
• Week 3 :
  Lists, stacks, queues.
• Week 4 :
  Trees, the basics.
• Week 5 :
  Complete trees. Hufman Code. Set-Storage. Dictionaries. Hash.
• Week 6 (20-22/Nov) :
  Hash. Continued. Priority queues (Heap).
• Week 7 (27-29 Nov) :
  
• Week 8 (6-8 Dec) : Binary Search trees, 2-3 trees
  
• Week 9 (13-15 Dec) : Finished 2-3 trees, B-Trees, Started Merge-find
  
  
• Week 10 (20-22 Dec) : Complete Merge-Find. Universal hash. Analysis of closed hash. Started perfect hash.
  
• Week 11 : Finish Perfect hash.
  
• Week 12 :
  
• Week 13 :
  
• Week 14 :
  

• This page was last modified on 26/12/04.