Grades: 20% Targilim 20% Bojan Magen 60% Bjina Sofit
The 20% of targilim will be comprised of 6 targilim, each of which 4%. 2 of the 6 are "hova". The 4 others are "sjut".
To obtain the magen from targilim the 2 targilim hova have to be submitted.
Targil hova 1 will be given on 3.4.1998 to return on 24.4.1998.
Targil hova 2 will be given on 30.5.1998 to return on 12.6.1998.
If the 4 targilim sjut are submitted, the 3 best will be chosen.
Bojan: 8.5.1998.
Bibliography: DL, Cormen and Aho.
SCHEDULE:
KVUTZOT: A, B, C "X" means no class. The numbers 1a, 1b refer to week 1, first artzaa is "a" second artzaa is "b":
WEEK 1 : 8-13 XXXXX A-1a BC-1a XXXXXXXXXX
WEEK 2 :15-20 BC-1b A-1b BC-2a A-2a
WEEK 3 :22-27 BC-2b A-2b BC-3a A-3a
WEEK 4 :29-3 BC-3b A-3b BC-4a A-4a
APRIL:
WEEK 5 : 5-10 BC-4b A-4b XXXXXXXXXXXXXXXX
WEEK 6 :12-17 XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
WEEK 7 :19-24 BC-5a A-5a BC-5b A-5b
WEEK 8 :26-1 BC-6a A-6a XXXXXXXXXXXXXXXX
MAY:
WEEK 9 : 3-8 BC-6b A-6b BC-7a A-7a BOJAN
WEEK 10:10-15 BC-7b A-7b BC-8a XXXX A-8a
WEEK 11:17-22 BC-8a A-8b BC-9a A-9a
WEEK 12:24-29 BC-9a A-9b BC-10a A-10a
JUNE:
WEEK 13:31-5 XXXXXX A-10b BC-10b A-11a
WEEK 14: 7-12 BC-11a A-11b BC-11b A-12a
WEEK 15:14-19 BC-12a A-12b BC-12b XXXXX
TENTATIVE Contents of the course, likely to be modified during the course:
WEEK 1-2-3: LD 1-2 Cormen 1-4. Introduction Mathematical Background Order of Growth. Recurrence Equations HOMEWORK 1-2
WEEK 3-4: LD-3 Cormen 11 Lists HOMEWORK3 HOVA
PESAJ
WEEK 5-6: Trees LD: 4.1-4.4 Defintions, representation, operations, traversals, implementations. ImplementIng traversals LD: 4.5 stack based, tail-recursion->iteration, threaded trees (targil), level order String Searching LD: 5.5 HOMEWORK 4.
WEEK 7: Binary search LD: 6.3 (upto page 184) Binary search trees & skip lists LD: 6.4 Huffman encoding LD: 5.4
WEEK 8: AVL trees LD: 7.1 (first part: including the theorem on the height of a AVL tree and its proof) AVL trees & 2-3 trees LD: 7.1 (second part: focus on the algorithm for insertion without the code & and on a brief description of the algorithm for deletion. HOMEWORK 5 LD: 7.2
WEEK 9: Hashing LD: 8
WEEK 10: Priority Queues LD: 9
WEEK 11: Graphs LD: 12 BFS, DFS
WEEK 12: Red-Black trees Corman, Leiserson, Rivest; Algorithms; chapter 14