| Recommended semester: 4th semester |
| Scope and form: Classteaching and lab.work |
Evaluation: Written exam
8 hours written exam in datalaboratory |
| Examination: 13-scale |
| No credit points with: 92403, 49142 |
| Aim: The participants must understand a number of fundamental concepts and techniques for the construction and analysis of efficient algorithms and data structures. Furthermore they must understand different principles for programming languages. they must be able to construct simple interpreters and compilers. |
Contents: - Different programming languages and their profiles. Imperative languages, logi languages. Object oriented programming.
- Presentation of a series of fundamental algorithms and data structures for searching, sorting and more.
- Recursion. Analysis of the efficiency of different algorithms. O notation.
- Interpretation and compilation. Principles for construction of compilers / interpreters: EBNF notation, lexical analysis, syntax analysis using both recursive descent and table methods, semantic analysis, code generation. Compiler-compilers.
- The use of the learned principles by implementation of practical cases as a simple interpreter. |
| Contact: Knud Smed Christensen, building 451, (+45) 4525 5334, ksc@imm.dtu.dk |
| Department: 002 Informatics and Mathematical Modelling |
| Course URL: http://www.imm.dtu.dk/courses/02348 |
| Keywords: Algorithms, Recursion, Parsing, Interpreters, Compiler-compilers |
| Updated: 28-01-2002 |
