| studiehandbok@lith | |
|
|
|
|
|
| TNG008 | Data Structures and Algorithms, 3 p (sw) /Datastrukturer och algoritmer/ Advancement level: B | |
| Aim: The aim of this course is to present fundamental abstract data types, and to describe how they can be implemented by various data structures and algorithms. The course should also give a knowledge of various methods for searching and sorting, and give an introduction to design and analysis of algorithms. Prerequisites: TNG003 Program Languages and Methodology. Course organization: Lectures, lessons, and laboratory work. Course content: Algorithm analysis, complexity measures, and order notation. Lists, stacks, and queues. Tree structures and tree traversals. Binary search trees, AVL trees, and 2-3 trees. Hash tables. Binary heaps. Sorting and selection. Simple sorting algorithms. Mergesort, Heapsort, and Quicksort. Course literature: M. A. Weiss. Data Structures and Algorithm Analysis in Java. Addison-Wesley (1999). | ||
| |
|
|
 |
|||||
|
|
||||||
