TDDB57	Data Structures and Algorithms, ECTS-points /DATASTRUKTURER OCH ALGORITMER/ Advancement level: B
	Aim: The course aims at presenting fundamental abstract data types and efficient inplementations of these, in terms of data structures and procedures, and also at introducing methods for design, analysis and verification of algorithms. Prerequisites: Discrete mathematics and logic (corresponding to TATM90 or TDDB 90). TDDB92 or TDDB93 Programming in Incremental Systems. Basic knowledge of programming in Pascal (or some similar language). Supplementary courses: TDDA32 Design and Analysis of Algorithms TDDB45 Computability and Complexity Theory The course is further a prerequisite for the following courses: TDDB12 Concurrent Programming TDDA28 Compilers and Interpreters TDDA37 Compiler Construction TDDB38 Database Technology TDDA13 Artificial Intelligence, D TDDA58 Artificial Intelligence, C Course organization: The purpose of the lectures is to present the theory. The purpose of the seminars is to practice the theory. The purpose of the laboratory sessions is to solve problem assessments, mostly using computers, but sometimes "by hand". Course content: - Basic notions - Fundamental abstract data types and data structures - Design, analysis, and verification of algorithms. - Sorting and searching. Course literature: H. Lewis & L. Denenberg, Data Structures & Their Algorithms, Harper Collins, 1991. Compendium to be distributed by the Department of Computer and Information Science (IDA).
TEN1	Written examination
LAB1	Laboratory work

Course language is Swedish.