PřF:M1160 Intro to Programming I - Course Information
M1160 Introduction to Programming I
Faculty of ScienceAutumn 2007 - for the purpose of the accreditation
- Extent and Intensity
- 2/2/0. 4 credit(s) (fasci plus compl plus > 4). Type of Completion: k (colloquium).
- Teacher(s)
- RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
Mgr. Vlastimil Holer (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor) - Guaranteed by
- RNDr. Jaroslav Pelikán, Ph.D.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D. - Prerequisites
- ! IB001 INNOLEC prof. Serge Morand
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.
The capacity limit for the course is 112 student(s).
Current registration and enrolment status: enrolled: 0/112, only registered: 0/112, only registered with preference (fields directly associated with the programme): 0/112 - fields of study / plans the course is directly associated with
- Mathematical Biology (programme PřF, M-BI)
- Mathematics (programme PřF, B-MA)
- Mathematics (programme PřF, M-MA)
- Course objectives
- The main aim of the course Introduction to Programming I 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 subject Introduction to Programming I is based on the use of the Pascal programming language.
- Syllabus
- Basic concepts, units of information.
- History of computers. Basic operational units of a computer and the principle of its operation.
- 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.
- Recursion - types of recursion, problems effectively solvable by recursion.
- 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
- 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á).
Kolokvium: Kolokvium bude probíhat v počítačové učebně, kde studenti budou vytvářet program řešící zadaný problém. Dále bude následovat rozprava nad řešeným problémem. - 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 2007 - for the purpose of the accreditation, recent)
- Permalink: https://is.muni.cz/course/sci/autumn2007-forthepurposeoftheaccreditation/M1160