Dansk - English
Short version - Full version
Computer Science (Spring 2013) |
|||
| Course code : | ICOMP-U1 | ||
| ECTS Credits : | 7,5 | Status : | Optional |
| Placement : | 5. - 6. semester | Hours per week : | 4 |
| Length : | 1 semester | Teaching Language : | Danish and English |
| Principal Content : | • • 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 |
||
| Teaching method : | 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. | ||
| Required prequisites : | Documented knowledge corresponding to PROG2 | ||
| Responsible teacher : | Henrik Kold Mikkelsen
, hokm@dtu.dk |
||