ESF:PMUDP Introduction to Program.-sem. - Course Information
PMUDP Introduction to Programming - seminar
Faculty of Economics and AdministrationAutumn 2006
- Extent and Intensity
- 0/2/0. 0 credit(s). Type of Completion: -.
- Teacher(s)
- RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
Mgr. Jiří Poláček, Ph.D. (seminar tutor) - Guaranteed by
- prof. Ing. Osvald Vašíček, CSc.
Department of Applied Mathematics and Computer Science – Faculty of Economics and Administration
Contact Person: Lenka Hráčková - Timetable of Seminar Groups
- PMUDP/1: Fri 10:15–11:50 VT206, J. Poláček
PMUDP/2: Fri 8:30–10:05 VT203, J. Poláček - Prerequisites
- The course Introduction to Programming requires basic knowledge of PC computer handling (on a user level).
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Economic Information Systems (programme ESF, B-SI)
- Course objectives
- The main aim of the course Introduction to Programming is to introduce students to basic principles of computer problem-solving. Students obtain knowledge and skills that are necessary for designing an algorithm to solve a given problem, coding it in a programming language and debugging it. The course Introduction to Programming is based on the use of the Pascal programming language.
- Syllabus
- Programming languages, compiler.
- Output statements, constants, expressions.
- Variables, input statements.
- Assignment statement, conditional statement, loops.
- Algorithms based on recurrence relation.
- Data types (abstraction, representation, data processing): array, string, set, record, file, text file.
- Procedures and functions, parameters, recursion, side effect.
- Basic algorithms: searching, sorting.
- Numerical algorithms: precision, errors.
- Non-numerical algorithms: text processing.
- Algorithm analysis: correctness, effectivity.
- Pointer type. Dynamic data structures.
- Asymptotic time complexity: polynomial, exponential and optimal algorithms.
- Literature
- MIHULA, Pavel and Jiří SOUKENKA. Borland pascal 7.0 : kompendium. Edited by Kateřina Juhová. Praha: Grada, 1994, 913 s. ISBN 8071690090. info
- KRAEMER, Emil. Algoritmizace s příklady v jazyce PASCAL. Praha: České vysoké učení technické v Praze, 1988, 114 s. info
- DRÓZD, Januš and Rudolf KRYL. Začínáme s programováním. 1. vyd. Praha: Grada, 1992, 306 s. ISBN 80-85424-41-X. info
- Borland Pacsal 7.0 manuál, Borland International, 1992
- Assessment methods (in Czech)
- Typ výuky: Přednáška + cvičení (cvičení probíhá v počítačové učebně a účast na něm je povinná).
Zkouška se skládá ze dvou částí: teoretická část (probíhá písemnou formou bez použití počítače) a praktická část (probíhá písemnou formou u počítačů. Studenti v průběhu této části vytvářejí program, který řeší zadaný problém.). K praktické části zkoušky jsou připuštěni pouze ti studenti, kteří úspěšně složili část teoretickou. - Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually.
General note: Slouží k zápisu cvičení do IS. - Teacher's information
- http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
- Enrolment Statistics (Autumn 2006, recent)
- Permalink: https://is.muni.cz/course/econ/autumn2006/PMUDP