M1160 Introduction to Programming I

Faculty of Science
Autumn 2003
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. Lubomír Krejčí (seminar tutor)
Mgr. Jaroslav Šilberský (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.
Timetable of Seminar Groups
M1160/01: No timetable has been entered into IS. A. Zlámal
M1160/02: No timetable has been entered into IS. A. Zlámal
M1160/03: No timetable has been entered into IS. L. Krejčí
M1160/04: No timetable has been entered into IS. L. Krejčí
M1160/05: No timetable has been entered into IS. L. Krejčí
M1160/06: No timetable has been entered into IS. L. Krejčí
M1160/07: No timetable has been entered into IS. J. Šilberský
M1160/08: No timetable has been entered into IS. J. Šilberský
Prerequisites
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
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. Online. 1. vyd. Praha: Grada, 1992. 306 s. ISBN 80-85424-41-X. [citováno 2024-04-23] info
  • HRUŠKA, Tomáš. PASCAL pro začátečníky. Online. 1. vyd. Praha: SNTL - Nakladatelství technické literatury, 1990. 366 s. [citováno 2024-04-23] info
  • KRAEMER, Emil. Algoritmizace s příklady v jazyce PASCAL. Online. Praha: České vysoké učení technické v Praze, 1988. 114 s. [citováno 2024-04-23] info
  • MIHULA, Pavel and Jiří SOUKENKA. Borland pascal 7.0 : kompendium. Online. Edited by Kateřina Juhová. Praha: Grada, 1994. 913 s. ISBN 8071690090. [citováno 2024-04-23] 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.
Teacher's information
http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
The course is also listed under the following terms Autumn 2007 - for the purpose of the accreditation, Autumn 2010 - only for the accreditation, Autumn 2002, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2011 - acreditation, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, autumn 2021, Autumn 2022, Autumn 2023.
  • Enrolment Statistics (Autumn 2003, recent)
  • Permalink: https://is.muni.cz/course/sci/autumn2003/M1160