Faculty of Information Technology, BUT

Course details

Algorithms and Programming

APR Acad. year 2004/2005 Summer semester 5 credits

Course is not open in this year
Close
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.

Guarantor

Language of instruction

Czech

Completion

Examination (written)

Time span

39 hrs lectures, 26 hrs pc labs

Assessment points

45 exam, 15 half-term test, 40 projects

Department

Lecturer

Instructor

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.

Study literature

  • Teaching materials available on WWW
  • Koffman, B.: Turbo Pascal, 5th Edition Update, Addison-Wesley Longman, Inc., 1998

Fundamental literature

  • Wirth, N., Jensen, K.: Pascal User manual and report, ISO Pascal Standard, Springer-Verlag, 1991

Syllabus of lectures

  • A basic course on programming in the Pascal: data types
  • A basic course on programming in the Pascal: control structures
  • A basic course on programming in the Pascal: statements
  • Definition and description of the Pascal syntax and semantics, EBNF
  • Modular programming, program debugging, documentation
  • Algorithms and data structures, introduction
  • Control and data structures of programming languages
  • Complexity and computability of algorithms
  • Algorithms proving and programs verification
  • Algorithms classification, illustrative examples
  • Syntactic and semantic specifications of abstract data types (ADT)
  • ADT principles and static implementation
  • Basic algorithms types for ordering, searching, numeric calculations, etc.

Progress assessment

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

Controlled instruction

Realisation of 4 home assignments, demonstration of home assignments during lab-experiments, delivered and checked documentation of 3 home assignments. Mid-term written test. Final written examination.
Back to top