Department of Information Technology

Algorithms and Data Structures I (1DL210), 2013

News

  • 2013-10-14 Assignment 4 is online. The deadline is October 23.
  • 2013-10-03 The third assignment is online. The deadline is October 12.
  • 2013-09-23 The first assignment is marked. Marked assignment with comments are by the window outside room 1457 (just right of the printer). You can also see your result in Studentportalen, under "Progress".
  • 2013-09-23 The second assignment is online. The deadline is October 1.
  • 2013-09-09 Deadline for Assignment 1 extended to September 16.
  • 2013-09-09 Fixed a typo in Assignment 1, part 2.3. The O(n^2) is supposed to be outside the recursive call.
  • 2013-09-05 The first assignment is online. The deadline is September 16.
  • 2013-08-29 A (very) short example of how to use LaTeX is online.
  • 2013-08-29 Course page online. You will need a Unix account for the assignments. If you don't have a Unix account, go to room 4118b (Polacksbacken building 4, first floor). Bring ID.

Schedule

TimeEdit

Note that the class is split into two parts for the tutorials. Carl will give the tutorials in English, and Jari will give them in Swedish. You can choose which session you want to attend.

Date Time Room Type Content Reading List
3/9 8-10 2247 Lecture Introduction -Time Complexity L1
4/9 10-12 80101 Lecture Insertion Sort- Asymptotic Notations L2
5/9 13-15 6140 Lecture Insertion Sort (cont.)
6/9 10-12 2245 Tutorial Asymptotics, Algorithm Analysis
6/9 15-17 2245 Tutorial Asymptotics, Algorithm Analysis
9/9 10-12 2146 Lecture Divide-and-Conquer - Merge Sort L3
10/9 13-15 2147 Lecture Merge Sort (cont.)
11/9 13-15 80101 lecture QuickSort L4
13/9 10-12 2347 Tutorial Sorting
13/9 13-15 1145 Tutorial Sorting
17/9 13-15 2247 Lecture Heapsort, Priority Queues L5
20/9 13-15 2347 Lecture Hash Tables L6
23/9 15-17 2347 Lecture Binary Search Trees L7
26/9 13-15 1111 Tutorial Algorithm Analysis, Heaps, Hash Tables
27/9 13-15 1145 Tutorial Algorithm Analysis, Heaps, Hash Tables
1/10 13-15 80101 Lecture Graph Algorithms - Breadth-First Search L8
3/10 10-12 10134 Lecture Graph Algorithms (Cont.)
4/10 8-10 2446 Lecture Graph Algorithms (Cont.)
7/10 10-12 1145 Tutorial Binary Search Trees, Graph Algorithms.
9/10 10-12 2446 Tutorial Binary Search Trees, Graph Algorithms.
15/10 10-12 1145 Tutorial Exam Questions
15/10 13-15 2446 Tutorial Exam Questions
18/10 08-17 Written exam

Examination

Written exam, plus mandatory assignments. The assignments also give bonus points for the exam.

Updated  2014-09-01 01:41:08 by Mohamed Faouzi Atig.