| TDDA29 | Data Structures, ECTS-points /DATASTRUKTURER/ Advancement level: B | |
| Aim: This course teaches commonly used data structures and algorithms. The course shall also give an understanding for how the selection of data structures and algorithms affects programs, both concerning memory disposition and computing time, and in this context basic analysis of data structures and algorithms is discussed. Prerequisites: Basic course in programming (preferably based on Pascal or some other imperative programming language). Supplementary courses: Data bases, Programming in Ada, Artificial intelligence and Lisp, Compilers and interpreters, Realtime- and process programming. Course organization: The lectures deal mainly with principal aspects of data structures and algorithms. The exercises are dedicated to problem solving and preparation for laboratory work. The laboratory work consists of various kinds of assignments, related to different data structures and algorithms. Course content: Abstract data types, lists (incl. stack and queue), trees of various kinds, hash tables and priority queues. Searching and sorting. Analysis of algorithms, formally and informally,"Big-O-notation. Course literature: Mark Allen Weiss, Data Structures and Algorithm Analysis, Benjamin/Cummings, 1992. Course material from the Dept. of Computer and Information Science (IDA) | ||
| TEN1 | Written examination | |
| LAB1 | Labratory work | |