Data Structures (0368.2158)

1st Semester, 2005/06 -
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 2005/06):

• Week 1 :
  Introduction (Nov 2+ oct 31).

• Week 2 :
  
  
Complexity. Started Master theorem (Nov 7+9).
• Week 3 :
  Completed Master Theorem. Started simple data structures - lists (Nov 16 + 18).
• Week 4 :
  Completed Lists including Stack+Queue. Started Tree Introduction (Nov 21+23).
• Week 5 :
  Completed Tree introduction, including Huffman Trees (Nov 28+30).
• Week 6 () :
  Binary search trees: Insert+delete+find, Scanning (LDR+DLR),successor+predecessor, rotate (Dec 5 +7).
• Week 7 () :
  Completed Binary serach trees. Started 2-3 trees. (Dec 12 +14)
• Week 8 () :
  Completed 2-3 trees, B-trees. Started merge-find trees (Monday). (Dec 19 +21)
• Week 9 () :
  Will work on finishing mege-find trees and Heaps. Will start Hash . (Dec 26 + 28)
  
• Week 10 : Hash (2-4/1/06) .
  
• Week 11 : .
  
• Week 12 :Sorting. (16-18/1/06)
  
• Week 13 : Sorting. Perfect Hash. (23-25/1/06)
  
• Week 14 :
  

• This page was last modified on 19/1/06.