Dansk - English
Short version - Full version
Computer Science (Spring 2013) |
|||
| Course code : | ICOMP-U1 | ||
| ECTS Credits : | 7,5 | Status : | Optional |
| Revised : | 27/09 2011 | Written : | 21/06 2010 |
| Placement : | 5. - 6. semester | Hours per week : | 4 |
| Length : | 1 semester | Teaching Language : | Danish and English |
| Objective : | Through this course the student will Know about well-known data structures as those listed below. You will be able to implement these structures. • Be able to analyse algorithms with respect to efficiency • Determine which structures are appropriate in various situations • Be confident in learning new structures beyond what’s presented during this course • Even more important the fundamental knowledge of data structures transcends to any language or operating system. Twenty years from now you will still be using the data structures that you learn this semester. 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 Evaluation 02: if the student fulfils the criteria from (i) 7: if further the criteria from (ii) are met 12: if all criteria from (i), (ii), and (iii) are met |
||
| 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 | ||
| Recommended prerequisites : | You are already competent at programming in Java. You should feel confident in design and implement programs using classes and methods. You have used some basic structures like arrays and Arraylists in Java. | ||
| Relations : | - | ||
| Type of examination : | Look under remarks | ||
| External examiner : | Internal | ||
| Marking : | 7 step scale | ||
| Remarks : | Internal, oral examination based on assignments. 7-step scale. Grades are defined above. Through the course the students will have to solve a number of compulsory course assignments. To be admitted for examination all compulsory assignments have to be handed in within the time limits indicated in the assignment. Furthermore all assignments have to be approved. Oral examination. Questions will be based on the course assignment. Moreover general questions to the topics of the principal content will be raised |
||
| Teaching material : | Notes and slides Recommended literature: Michael T. Goodrich: “Data Structures & Algorithms in Java” ISBN: Other titles of interest: Frank M Carrano: “Data Structures and Abstractions with Java” ISBN: 0-13-204367-x |
||
| Responsible teacher : | Henrik Kold Mikkelsen
, hokm@dtu.dk |
||