Course details

Introduction to Programming Systems

IZP Acad. year 2003/2004 Winter semester 7 credits

Current academic year

Algorithms and problem solving: strategy of problem solving, structured decomposition, concept and features of algorithm. Basic programming construction: syntax and semantics of high programming language, variables, types, assignment, control structures, procedure and functions, parameter passing, input/output, exceptional state processing. Basic data structure: simple data types. Structured data: array, record, set, file, string. Dynamic data structures: concept of pointers. Strategy for selecting appropriate data structure. Recursion - concept of recursion. Global and local variables. Simply recursion procedures. Modular Design and abstraction. Concepts will be illustrated by using appropriate programming language.

Details ...

Guarantor

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

Language of instruction

Czech, English

Completion

Examination

Time span

Department

Department of Information Systems (UIFS)

Subject specific learning outcomes and competences

Students will learn how to analyse and how to design simple computer algorithms. This course will introduce students to the fundamental concepts of programming languages. Students will learn how to write programs in high programming languages. Students will learn how to use EBNF for programming language syntax describing. Students will learn the vocabulary of programming, syntax, and semantics of programming languages.

Learning objectives

To grasp an analysis of problems and to determine basic algorithms for their solving. To acquaint oneself with principles and features of high programming language and to possess them for implementing of algorithms. To learn how to use tools for program debugging. To get basic knowledge of data representation in memory. To make the acquaintance of testing principles of programs. To possess active basic algorithms.

Study literature

  • Schildt, H.: Nauč se sám C, SoftPress s.r.o, Praha, 2001, ISBN 80-86497-16-X.
  • Teaching materials available on WWW.
  • Soubor materiálů prezentovaných na přednáškách je dostupný na WWW.
  • The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
  • Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988.
  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937.
  • Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
  • Schildt, H.: Teach Yourself C, McGraw-Hill Companies, 2001.

Fundamental literature

  • Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988. 
  • The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
  • Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937. 

Progress assessment

Evaluated home assignments with the defence: 35 points. Mid-term written examination: 15 points. Final written examination: 50 points.

Course inclusion in study plans

Back to top