ABCDEFGHIJKL
1
Lectures (in Palmstedtsalen)Lab supervisionDeadlines
2
WeekDatesMonday 13–15Thursday 8:30-12Friday 15–17Mon 10-12Mon 15-17Tue 10-12Wed 15-17Fri 13-15WednesdayFriday
3
1 (w45)2–6/11Introduction.
Binary search.
(§1)
Insertion sort, selection sort.
Mergesort.
(§1, §4.1–4.2)
Quicksort.
(§4.3–4.4)
MT11
MT12
MT13
ES61
ES62
ES63
ES61
ES62
ES63
MT10
MT11
MT12
Lab 1
submission
4
2 (w46)9–13/11Complexity 1.
(§3)
Dynamic arrays, stacks, queues.
Complexity 2.
(§5, §6)
Linked lists.
ADTs.
(§6, §8)
SB-D209
SB-D309
SB-L216
MT11
MT12
MT13
SB-D080
SB-M022
MT11
MT12
MT13
MT10
MT11
MT12
Lab 2
status report
Quiz 1
5
3 (w47)16–20/11Trees.
Binary search trees.
(§9.1–9.2, §10.1)
Self-balancing trees.
AVL trees.
(§10.2–10.3)
2-3 trees.
B trees.
(§10.4)
SB-D040
SB-D042
SB-D209
SB-D020
SB-D023
SB-D025
ES61
ES62
ES63
MT11
MT12
MT13
ES61
ES62
ES63
Lab 2
submission
Quiz 2
6
4 (w48)23–27/11Hazem:
Hash tables 1.
(§11)
Exercises.Hazem:
Hash tables 2.
(§11)
SB-D040
SB-D042
SB-D209
KB-D41
KD1
KD2
ES61
ES62
ES63
MT11
MT12
MT13
ES61
ES62
ES63
Lab 3
status report
Quiz 3
7
5 (w49)30/11–4/12Priority queues.
Binary heaps.
(§8.2, §9.5)
Graph traversal algorithms:
DFS, BFS, Dijkstra.
(§12)
Meldable heaps.
Complexity 3.
(§5, §9.6)
ED2480
ED3354
ED3358
MT11
MT12
MT13
SB-D040
SB-D080
SB-M022
SB-D023
SB-D042
SB-D080
SB-D025
SB-D080
SB-D509
Lab 3
submission
Quiz 4
8
6 (w50)7–11/12MST algorithms:
Prim, Kruskal.
(§12)
Complexity 4.
Repetition.
(§7)
SB-D209
SB-D309
SB-D409
MT11
MT12
MT13
ED3354
ED3358
EL41
MT11
MT12
MT13
(13-17)
MT12
MT13
Lab 4
status report
Quiz 5
9
7 (w51)14–18/12Repetition.Practice exam.ED2480
ED3354
ED3358
MT11
MT12
MT13
ED3354
ED3358
EL41
SB-D040
SB-D080
(13-17)
MT12
MT13
Lab 4
submission
Quiz 6
10
Xmas
break
21/12–1/1
11
Reexam
week
4–8/1
12
Exam
week
11–15/1Written exam
(Thu 14 Jan, 14:00-18:00)
10-12
13-15

EL42
10-12
13-15
EL42