Department of Information Technology

Algorithms and Data Structures I (1DL210), 2012

News

  • 2013-01-24 The re-exam is marked.
  • 2012-10-18 Course evaluation form available [1]. Please, fill in.
  • 2012-10-17 Remember that the exam is at Ekonomikum, B:154 on Friday 19 between 08:00 and 13:00.
  • 2012-10-08 Assignment 4 is online. The deadline is October 16.
  • 2012-10-08 The tutorial 2012-10-09 will be segregated by language. To attend the one in Swedish, go to Jonathan in 1213. For the English version, go to Jari in 1212.
  • 2012-10-08 Sadly, the guest lecture is postponed for a couple of weeks due to events outside of our control. The new date will be announced by email to all participants of the course.
  • 2012-10-01 Those of you that did not attend the tutorial can find your corrected solutions of Assignment 1 in a binder marked "AD1 2012" outside P1421.
  • 2012-10-01 Assignment 3 is online. The deadline is October 8.
  • 2012-09-24 Due to illness, the second tutorial is moved to 1111
  • 2012-09-21 Previous exams added.
  • 2012-09-21 Assignment 2 online. The deadline is September 30.
  • 2012-09-17 Some notes from the first tutorial are online.
  • 2012-09-12 By request, we've uploaded the LaTeX source code for assignment 1.
  • 2012-09-10 Assignment 1 online.
  • 2012-09-07 Tutorial schedule updated.
  • 2012-09-03 A (very) short example of how to use LaTeX is online.
  • 2012-09-03 Course started. 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).

Course evaluation

[2].

Schedule

Date Time Room Type Content Reading List Slides
3/9 13-15 1111 Lecture Introduction - Insertion Sort. L1
5/9 10-12 1111 Lecture Time Complexity. Asymptotic Notations. L2
7/9 10-12 1211 Lecture Divide-and-Conquer. L3
10/9 10-12 1111 Lecture Merge Sort.
12/9 10-12 1111 Lecture QuickSort. L4
14/9 13-15 1145/1146 Tutorial Asymptotics, Algorithm Analysis
17/9 10-12 1111 Lecture QuickSort (cont.)
19/9 10-12 1111 Lecture Heapsort, Priority Queues L5
20/9 10-12 2146 Lecture Hash Tables. L6
25/9 10-12 1111 Tutorial Sorting, Hash Tables.
27/9 10-12 1111 Lecture Binary Search Trees. L7
2/10 13-15 1212/1213 Tutorial Algorithm Analysis, Heaps, Hash Tables.
4/10 10-12 1111 Lecture Graph Algorithms - Breadth-First Search. L8
5/10 10-12 1311 Lecture Graph Algorithms (Cont.)
8/10 10-12 1111 Lecture Strongly Connected Components
9/10 8-10 1212/1213 Tutorial Binary Search Trees, Graph Algorithms.
10/10 CANCELLED 2247 Guest Lecture CANCELLED Per Gustafsson from Google: CS in practice.
15/10 10-12 1211 Tutorial Exam Questions
19/10 08-13 Ekonomikum, B:154 Written exam

Examination

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

Updated  2014-09-01 02:12:01 by Mohamed Faouzi Atig.