Datastructures and algorithms
The course covers basic algorithms and data structures and their properties, including search and sorting, stacks, trees, graphs, queues, and hashing, as well as time and memory complexity, and recursion.
The course introduces the basics of algorithm analysis, and basic algorithms and data structures. After completing the course you should be able to reason about use of resources in an informed way, and choose between algorithms and data structures based on their various properties.
The course consists of two modules: theory (4.5 credits) and practical exercises (3 credits).
Teaching Format
Teaching consists of lectures, exercise sessions and supervision.
Assessment
The course is assessed through written examination and hand-in assignments.
Examiner
The schedule will be available no later than one month before the start of the course.
We do not recommend print-outs as changes can occur. At the start of the course,
your department will advise where you can find your schedule during the course.
Note that the course literature can be changed up to two months before the start of the course.
Cormen, Leiserson, Rivest and Stein: Introduction to Algorithms.
The book is available as an e-book via Stockholm University library.
Course reports are displayed for the three most recent course instances.
