Dansk - English
Short version - Full version
Computer Science (Spring 2013) |
|||
Course code : | ICOMP3-U1 | ||
ECTS Credits : | 5 | Status : | Compulsory |
Placement : | 3. semester | Hours per week : | 4 |
Length : | 1 semester | Teaching Language : | 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 • Heap structures; priority queues • Graphs; traversing graphs • Spanning trees; shortest path • Searching and sorting techniques |
||
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. | ||
Required prequisites : | Documented knowledge corresponding to PROG2. | ||
Responsible teacher : | Henrik Kold Mikkelsen
, hokm@dtu.dk |