Dansk - English
Short version - Full version
Computer Science (Fall 2008) |
|||
| Course code : | ICOMP3-U1 | ||
| ECTS Credits : | 5 | Status : | Compulsory |
| Placement : | 3. semester | Hours per week : | 4 |
| Length : | 1 semester | Teaching Language : | English |
| Principal Content : | Learning outcomes (i) Ability to 1. describe binary and integer and floating point presentation 2. define and identify basic data structures and algorithms 3. define and identify efficiency of a simple algorithm used with a specific data structure (ii) Ability to 1. analyse and compare advantages and disadvantages using basic algorithms together with different data structures 2. analyse and compare strength and weaknesses of basic sorting algorithms 3. analyse algorithms with respect to efficiency 4. analyse examples of 1. and 3. in the students own solution (iii) Ability to 1. discuss solutions involving items listed in the Principal Content 2. estimate efficiency of an algorithm with worst, average, and best case 3. estimate and analyse a specific solution 4. estimate and summarize efficiency measurements 5. reflect on a data structure application |
||
| 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 |
||