Course detail

Programming and Usage of Computers 2.

FEKT-SPP2Acad. year: 2005/2006

Algorithms and problem solving - strategy of problem solving, structured decomposition, concept and features of algorithm. Basic programming construction in Pascal - syntax and semantics, variables, type, assignment, control structures, procedure and functions, parameter passing, input/output, exceptional state processing. Basic data structure - simple data types, structured data typed - array, record, set, file, strings. 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.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

RNDr. Lubomir Bajgar

Department

Department of Mathematics (UMAT)

Learning outcomes of the course unit

Obtaining basic programming abilities and the ability of algorithmic thinking. Understanding basic properties and structures of Pascal and the ability to apply them.

Prerequisites

It is a course of the non-structured ending study program

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

Not applicable.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Educating students in algorithmic and programming thinking. Explaining basic properties and structures of language Pascal.

Specification of controlled education, way of implementation and compensation for absences

Not applicable.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Jinoch, Muller, Vogel: Programování v jazyku Pascal, SNTL.
Wirth: The Programming Language Pascal, Acta Informatica

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme EI-B3 Bachelor's

    branch B3-KAM , 1. year of study, summer semester, compulsory
    branch B3-EST , 1. year of study, summer semester, compulsory
    branch B3-SEE , 1. year of study, summer semester, compulsory
    branch B3-EVM , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-KAM , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-KAM , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-EST , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-EST , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-SEE , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-SEE , 1. year of study, summer semester, compulsory
    branch M5-EVM , 1. year of study, summer semester, compulsory

  • Programme EI-M5 Master's

    branch M5-EVM , 1. year of study, summer semester, compulsory

Type of course unit

 

Lecture

39 hours, compulsory

Teacher / Lecturer

RNDr. Lubomir Bajgar

Syllabus

Properties of algorithms, notations for describing algorithms.
. Problem solving techniques. Design and implementation of algorithms
Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers, labels.
Expression and statements.
Text file input and output.
The concept of data. Simple data types, structured data types.
Structured programming. Control structures. Blocks, scope and activation.
Procedures and functions, parameters.
Recursion.
Pointer types and dynamic variables. Linked structures.
Sorting.
Searching.
Program verification, debugging, documentation.

Exercise in computer lab

26 hours, compulsory

Teacher / Lecturer

RNDr. Lubomir Bajgar

Syllabus

Properties of algorithms, notations for describing algorithms.
. Problem solving techniques. Design and implementation of algorithms
Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers, labels.
Expression and statements.
Text file input and output.
The concept of data. Simple data types, structured data types.
Structured programming. Control structures. Blocks, scope and activation.
Procedures and functions, parameters.
Recursion.
Pointer types and dynamic variables. Linked structures.
Sorting.
Searching.
Program verification, debugging, documentation