|
Total
number of hours per semester
|
|
Semester
I
|
Lectures
60
|
Practices
10(A)+50(C)
|
Contents / Structure of the subject:
Introduction (brief
history and overview of programming languages)
Syntax of programming
languages (BNF, EBNF and syntactic diagrams)
Programming language Pascal
Algorithms and algorithmic
systems (Turing machines, Markov normal algorithms, recursive
functions)
Analysis of algorithms and
structured programming
Data structures
Abstract data types
Program testing
Program documentation
|
|
Preexam duties:
|
Mode of studies and evaluation:
Lectures; Practices
(Auditory (A), Computing
(C)); Consultations.
The exam is written and
oral. Written part of the exam is eliminatory.
The exam grade comprises the results on partial exams,
computing practices, written and oral part of the exam.
|