Data Structures (0368.2158)

1st Semester, 2006/07 -
School of Computer Science
Tel-Aviv University

Messages to Students:

Instructors:

The material covered during the semester (First semester 2006/07):

• Week 1 :
  Introduction (Oct 23 +25 ).
• Week 2 :
  
  Complexity. Started Master theorem (Oct 30 + Nov 1).
• Week 3 :
  Complete Master Theorem. Will Start simple data structures - lists (Nov 6 + 8)
• Week 4 :
  Completed lists: Stacks / queues, dynamic lists and amortized complexity. Started Trees. (Nov 13 +15)
• Week 5 :
  Continue basic trees. (Nov 20 + 22)
• Week 6 (Nov 27 + 29) : Completed Priority queues + Heap. Started Dictionaries and hash
  
• Week 7 (Dec 4 +6) : Continue Hash (not including Probability). Do Multi-lists. Start Sophisticated trees.
  
• Week 8 ( Dec 11+13) Binary search trees + 2-3 trees + B-trees :
  
• Week 9 ( Dec 18+20) Merge-Find trees, Probabilistic part of Hash Tables :
  
  
• Week 10 : Finish Hash (Prob.). Do Perfect Hash. Start Sort. .
  
• Week 11 : Sorting .
  
• Week 12 Order Stat + start RB tree. :
  
• Week 13 Finish RB tree, AVL tree, Splay, Bloom Filter:
  
• Week 14 : Review session
  

This page was last modified on 26/01/07.