Dansk - English
Kort version - Fuld version
Computer Science (Forår 2013) |
|||
Kursuskode : | ICOMP-U1 | ||
ECTS Point : | 7,5 | Status : | Tilvalg |
Placering : | 5. - 6. semester | Timer pr. uge : | 4 |
Længde : | 1 semester | Undervisningssprog : | Dansk og engelsk |
Hovedindhold : | • Binary notations, storing integers and fractions • Precondition and post condition specifications • Time analysis strategies • Algorithms and their efficiency • Dynamic arrays • Linked lists • Iterators • Stacks and queues • Recursive thinking • Set and maps • Hash tables and hash functions • Bin. Heap structures; priority queues; Fibonacci Heaps • Graphs; traversing graph • Spanning trees; shortest path • Searching and sorting techniques • Dynamic Programming |
||
Undervisningsform : | The lessons consist of theory combined with practical exercises and course assignments. During the semester the student will have to hand in a number of mandatory course assignments. These assignments are used as a base for the oral examination. | ||
Krævede forudsætninger : | Documented knowledge corresponding to PROG2. | ||
Ansvarlig underviser : | Henrik Kold Mikkelsen
, hokm@dtu.dk |