PřF:M1160 Intro to Programming I - Course Information
M1160 Introduction to Programming I
Faculty of ScienceAutumn 2011 - acreditation
The information about the term Autumn 2011 - acreditation is not made public
- Extent and Intensity
- 2/2/0. 4 credit(s) (příf plus uk k 1 zk 2 plus 1 > 4). Type of Completion: k (colloquium).
- Teacher(s)
- RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
RNDr. Aleš Zlámal (seminar tutor) - Guaranteed by
- RNDr. Jaroslav Pelikán, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D. - Prerequisites
- !( FI:IB001 Intro to Programming )
The course Introduction to Programming I 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
- Mathematics (programme PřF, B-MA)
- Course objectives
- The main aim of the course Introduction to Programming I is to introduce students to basic principles of computer problem-solving.
This course is based on the use of the Pascal programming language.
At the end of this course, students should be able to:
design an algorithm to solve a given problem;
code an algorithm in the Pascal programming language;
debug a created program. - Syllabus
- Basic concepts, units of information.
- Design of algorithms - phases of task processing on a computer. Algorithm - algorithm properties, possibilities of algorithm notation, design of simple algorithms.
- Programming languages - compiler. Pascal programming language. Basic lexical units of Pascal. Program structure in Pascal.
- Pascal commands - input and output commands, assignment, composed command, conditional command, loop commands.
- Data types - ordinal types, type Boolean, integer, char, interval, real, enumerated types.
- Case and for commands.
- Structured data types - array, string, set.
- Searching and sorting algorithms - linear and binary searching, sorting methods of SelectSort, BubbleSort and InsertSort.
- Subprograms (procedures and functions). Formal and actual parameters, calling by value and by reference, global and local objects.
- Literature
- 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
- HRUŠKA, Tomáš. PASCAL pro začátečníky. 1. vyd. Praha: SNTL - Nakladatelství technické literatury, 1990, 366 s. info
- KRAEMER, Emil. Algoritmizace s příklady v jazyce PASCAL. Praha: České vysoké učení technické v Praze, 1988, 114 s. info
- MIHULA, Pavel and Jiří SOUKENKA. Borland pascal 7.0 : kompendium. Edited by Kateřina Juhová. Praha: Grada, 1994, 913 s. ISBN 8071690090. info
- Teaching methods
- Theoretical lectures with examples, practical lessons, homeworks.
- Assessment methods
- Lectures - 2 hours per week (the attendance is optional), class exercises - 2 hours per week (class exercises take place in a computer classroom and the attendance is mandatory, the students also must submit all required homeworks and successfully pass intrasemestral tests).
Colloquium takes place in computer classroom and students code a program solving a given problem. After it the solution of the given problem is discussed. - Language of instruction
- Czech
- Follow-Up Courses
- Further comments (probably available only in Czech)
- The course is taught annually.
The course is taught: every week. - Teacher's information
- http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
- Enrolment Statistics (Autumn 2011 - acreditation, recent)
- Permalink: https://is.muni.cz/course/sci/autumn2011-acreditation/M1160