Data structures
This website contains information about the Data Structures course DIT961, which runs in study period 4 in VT-2018. During the run of the course we will often update the website content, so you should check the website regularly.
Latest news
- 20181112, The second re-exam and the suggested solutions are now online.
- 20180907, The re-exam and the suggested solutions are now online.
- 20180604, The exam and the suggested solutions are now online. The exams have been graded and handed over to the administration.
Older news…
- 20181112, The second re-exam and the suggested solutions are now online.
- 20180907, The re-exam and the suggested solutions are now online.
- 20180604, The exam and the suggested solutions are now online. The exams have been graded and handed over to the administration.
- 20180523, The exam will be in SB-MU.
- 20180506, Notes of the mid period meeting are now online.
- 20180501, No lecture tomorrow (2:e maj) (moved to next week Wednesday (9:e maj)).
- 20180423, The exercises for week 6 are online.
- 20180423, Possible answers for week 5 are online.
- 20180420, Possible answers for week 4 are online.
- 20180413, We have moved the lecture on 4 May (13-15) to 3 May (10-12). The ‘konsulttid’ on the 4th of May is canceled.
- 20180407, Possible answers for the week 2 exercises are online.
- 20180407, The exercises for week two are now online.
- 20180327, Possible answers for the week 1 exercises are online.
- 20180326, The exercises for week two are now online.
- 20180301, The first lecture will be on Tuesday the 20th of March, 13:15-15:00, in room EL43.
- 20170921, New course code, new website! The website is still under construction and will probably change here and there.
Less news…
This week (11)
Thursday, 31/5
|
Exam (8:30-12:30 in SB-MU)
|
Course overview (preliminary):
Here is a (rough) overview of the course per week. The topics probably spill over from one week to the other.
(Week / Topic)
-
Introduction
-
Complexity
-
(re-exam week)
-
Sorting
-
Basic data structures (stacks, queues, etc.)
-
Heaps and trees
-
More trees
-
Lists and hash tables
-
Graphs
-
Summing up
-
Exam