Course Slides

Description Type Size Version
Section 1: Introduction PDF503.36 kB04.02.2016 @ 00:56:49
Section 2: Stacks, Queues, Lists PDF170.54 kB04.02.2016 @ 00:56:32
Section 3: Trees PDF141.08 kB04.02.2016 @ 00:56:51
Section 4: Sets, Dictionaries PDF250.46 kB04.02.2016 @ 00:56:23
Section 5: Balanced Trees: Implementation of dynamic dictionaries PDF1.12 MB04.02.2016 @ 00:57:03
Section 6: Hashing PDF559.77 kB04.02.2016 @ 00:56:39
Section 7: Priority Queues PDF176.22 kB04.02.2016 @ 00:56:27
Section 8: Sorting PDF608.60 kB04.02.2016 @ 00:57:11
Section 9: Disjoint sets that support Union-find PDF179.53 kB04.02.2016 @ 00:56:28
Section 10: Graphs PDF428.37 kB04.02.2016 @ 00:57:01



Assistive Classes' Slides

Description Type Size Version
Solved exercises on section 1 PDF141.72 kB04.02.2016 @ 00:57:17
Solved exercises on section 2 PDF86.98 kB04.02.2016 @ 00:57:14
Solved exercises on section 3 & 4 PDF146.34 kB04.02.2016 @ 00:57:11
Solved exercises on section 5 PDF246.10 kB04.02.2016 @ 00:57:16



Additional Teaching Material

Description Type Size Version
Arrays (former section 2) PDF69.86 kB04.02.2016 @ 00:56:13
Threaded Trees PDF738.15 kB04.02.2016 @ 00:56:24