Course details

Algorithms and Programming

APR Acad. year 2003/2004 Summer semester 5 credits

Current academic year

A basic course on programming in Pascal: Definition and description of the Pascal syntax and semantics. Delphi Pascal: modular programming. Algorithms and data structures, introduction. Control and data structures of programming languages. Problem of an analysis and specification. Algorithm development. Program coding. Program execution and testing. Algorithms classification, illustrative examples. Syntax and semantic specification, abstract data types (ADT). Basic ADT and their static implementation. Basic algorithms types for ordering, searching, numeric calculations, etc. Program debugging and documentation.

Details ...

Guarantor

Kreslíková Jitka, doc. RNDr., CSc. (DIFS)

Language of instruction

Czech

Completion

Examination

Time span

Department

Faculty of Information Technology (FIT)

Subject specific learning outcomes and competences

Upon successful completion of the course, students will be able to program in a high level program language like the Pascal: students will be able to use a computer language as a formal way of expressing ideas; students will be able to use a recursion as an algorithm development technique; students will be able to use beneficially programming concepts like an abstraction and modularity to handle complexity of large programs.

Learning objectives

The aim of the course is to acquaint students with principles of algorithms, evaluation of a complexity, algorithms prove, to familiarise with control and data structures of programming languages, and abstract data types.

Progress assessment

Evaluated home assignments with the defence (40 points). Mid-term written examination (15 points). Final written examination (45 points).

Course inclusion in study plans

Back to top