From PBDN

Introduction

This is a set of wiki pages for the course Datastructures (Datastrukturer) at Uppsala University in the Autumn term of 2007 (HT07). The lecturer is Parosh Abdulla and the teaching assistant is Jonathan Mörndal.

Anyone associated with the class is free to register an account and contribute by editing the material that's already here or adding new material. If you add a new page, please add {{datastruk}} to the bottom of the page so that it appears in the Datatstructures category.

Although it looks quite different, this wiki uses the same Wikimedia software as Wikipedia. If you're familiar with editing or creating Wikipedia pages, you can do the same here. The TeX mathematics extension works fine (it was previously broken).

Course Text

The course text is Introduction to Algorithms, Second Edition (ISBN 0-262-03293-7), by Cormen, Leiserson, Rivest, and Stein. Its availability in local bookshops, Studentbokhandeln and Akademibokhandeln, is unknown.

Online Resources

The Introduction to Algorithms course from the MIT Open CourseWare seems somewhat similar to this course and may be a source of useful supplementary material.

This list of algorithm animations and visualisations may be useful.

Lectures

Lecture Summary

1. Lecture 1 (2007-08-27 13:00) Introduction - Insertion Sort
2. Lecture 2 (2007-08-28 10:00) Time Complexity, Asymptotic Notation
3. Lecture 3 (2007-08-30 10:00) Divide-and-Conquer, Merge Sort
4. Tutorial 1 (2007-08-31 10:00) Induction Proofs, Asymptotic Notation, Recurrences
5. Lecture 4 (2007-09-03 10:00) Heaps, Heapsort
6. Lecture 5 (2007-09-04 10:00) Priority Queues, QuickSort
7. Tutorial 2 (2007-09-07 10:00) Probability Theory, Sorting
8. Lecture 6 (2007-09-10 10:00) QuickSort (cont.), Sorting in Linear Time
9. Lecture 7 (2007-09-11 13:00) Sorting in Linear Time. Hashing
10. Lecture 8 (2007-09-13 10:00) Hash Tables
11. Lecture 9 (2007-##-## ##:00) Binary Search Trees
12. Lecture 10 (2007-##-## ##:00) Graph Algorithms: Breadth First Search
13. Lecture 11 (2007-##-## ##:00) Graph Algorithms (contd.)
14. Lecture 12 (2007-##-## ##:00) Graphs: Strongly Connected Components
15. Lecture 13 (2007-##-## ##:00) Guest Lecture: Randomized Binary Search

Topics

All the topics listed by lecture: Lecture Summary.

• Sorting Algorithms
• Binary Search Trees
• Graph Algorithms

Examination

The exam is scheduled for 15th October, 2007. You can register through the exam registration system in the usual way.

Back to Datastructures main page.