Theory of Algorithms
Attention: We start at 10:15 on Thursdays from 12 April (during 6 weeks to compensate the postponed occasion on 3 April). You can repeat your midterm on 19 April from 8:30 to 10:00, in the same room (IE219).
Lectures: Tuesday 8:30-10:00 am, Thursday 10:30-12:00 am, IE219
Book: Cormen-Leiserson-Rivest: Introduction to Algorithms
Grading: There will be one midterm for 30% of the final grade and a final exam for 70%. You need to get a passing grade on the midterm to be able to go to the final. That is, the midterm will be for 30 points, the final for 70 points, and you need to get at least 12 points on the midterm to pass it. You need to get 28 points on the final to pass the final. These two must be done independently.
The midterm is OPEN BOOK. The exam is CLOSED BOOK.
Exams in the last semester:

Syllabus

Date Subject Pages Exercises
13/02 The concept of algorithms shortest path problem+5-14 1.2-2.
15/02 Running time, Insertion sort running time notations+15-21 4 Jan/1.
20/02 Insertion sort, binary search, merge two sorted arrays binary search+21-28 2.3-5, 2.3-6
22/02 Merge sort+examples 29-40 2.3-1, 2-1/a,b
27/02 Binary trees, heaps 123-132 6.1-1,2,7; 6.2-1
01/03 Heapsort 132-138 6.3-1, 6.4-1
06/03 Priority queues, Quicksort 139-149 7.1-1, 7.1-3
08/03 Analysis of quicksort, Randomized Quicksort 149-164 7.2-3, 7.2-4
13/03 Lower bound for sorting, Counting sort 165-169 8.1-2
20/03 Radix sort, Bucket sort 170-182 8.3-1, 8.4-1
22/03 Minimum, maximum, Select in linear time 183-185, 189-195
27/03 review!!!
29/03 MIDTERM, here you can find the results
03/04 postponed!!!
05/04 by Reka Szabo: stack and queues 198-204
10/04 Linked lists 204-209 10.2-2
12/04 Pointers and objects, representing rooted trees 210-220 10.4-1
17/04 Hash tables, hashing with chaining 221-226
19/04 Hash functions 226-237 11.2-2
24/04 Open addressing 237-244 11.4-1
26/04 Binary search trees 253-264
03/05 Cancalled...
08/05 Red-black trees 1. 273-279 13.1-5, 13.1-7
10/05 Red-black trees 2. (280-293)
15/05 Graph representations, BFS 525-539 22.1-1, 22.1-3, 22.1-5
17/05 DFS, Topological sort 540-551