| Kursusnavn (dansk): | Grundlæggende strukturer for beregninger - Algoritmer og datastrukturer |
| Kursusnavn (engelsk): | Foundations of Computing - Algorithms and Data Structures |
| Semester: | Forår 2010 |
| Udbydes under: | cand.it., softwareudvikling og -teknologi (sdt) |
| Omfang i ECTS: | 7,50 |
| Kursussprog: | Engelsk |
| Kursushjemmeside: | https://blog.itu.dk/SGSB-F2010/ |
| Min. antal deltagere: | 0 |
| Forventet antal deltagere: | 12 |
| Maks. antal deltagere: | 30 |
| Formelle forudsætninger: | This course is only for students who are exempted from the mathematical part of Foundations of Computing, because they have followed a similar course in the past. |
| Læringsmål: | This description is under development
This course serves as an introduction to data structures, algorithms and complexity for freshly educated programmers.
After the course the student should be able to:
- Understand and clearly explain the mechanics of computations and data structures involving manipulation of references, nested loops and recursion, specified in natural language, in abstract pseudocode or in concrete programming language (Java).
- Implement abstractly specified computations and data structures in an imperative programming language (Java).
- Analyze time and space usage of algorithms/programs.
- Argue for correctness of programs using invariants.
- Assess scalability of a given single-threaded software application, using asymptotic analysis.
- Choose among and make use of the most important algorithms and data structures in libraries, based on knowledge of their complexity.
- Design algorithms for ad hoc problems by using and combining known algorithms and data structures.
- Know about the most important hardware and programming language factors influencing the speed at which a program runs.
|
| Fagligt indhold: | This description is under development
Topics covered are among others complexity analysis, big-O, correctness (loop invariants, assertions), algorithmic problem solving techniques including divide-and-conquer, concrete algorithms and data structures for search trees, sorting, hashing, graphs, shortest paths.
The lectures will cover theory and the exercise will train practical issues of applying the theory.
|
| Læringsaktiviteter: | This description is under development
NB!! Course restriction I!!
Please note that there is a course restriction between this course and the SDT course Performance and Test.
NB!! Course restriction II!!
Please note that there is a course restriction between this course and the SDT course Foundations of Computing. |
| Eksamensform og -beskrivelse: | X. experimental examination form (7-scale; external exam), 7-trins-skala, Ekstern censur
|
| Litteratur udover forskningsartikler: | |
| | |
Kursusoversigt