TDDC91 · 6 credits · Basic level (G1X) · Informationsteknologi
Data Structures and Algorithms
Discontinued
No exam statistics yet
There is no exam sitting with at least 5 students in the last three academic years. New courses and project-only courses often have no statistics.
Part of 1 programme
About the course
Aim
The purpose of the course is to give the student tools to independently be able to construct computer programs that use time and memory in an efficient way. Upon completion of the course the student shall be able to:
- demonstrate ability to analyze time and space complexity of iterative and simple recursive algorithms.
- explain and use the most common abstract data types and sorting algorithms.
- implement the most common abstract data types with different data structures and algorithms.
- describe established methods for design (and analysis) of algorithms in general.
Content
- Basic notions
- Mathematical foundations for analysis of algorithms
- Fundamental abstract data types and data structures, such as lists, stacks, queues, search trees, hash tables and graphs
- Efficiency analysis of algorithms
- Sorting and searching
- Algorithm paradigms
- Examiner
- Erik Nilsson
- Scheduled hours
- 52 h
- Main field of study
- Informationsteknologi