IB001 Introduction to Programming

Faculty of Informatics
Autumn 2005
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
Teacher(s)
RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
Mgr. Lubomír Krejčí (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. Ondřej Nečas (seminar tutor)
Mgr. Jiří Poláček, Ph.D. (seminar tutor)
RNDr. Pavel Šmerk, Ph.D. (seminar tutor)
Guaranteed by
prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D.
Timetable
Thu 18:00–19:50 D1
  • Timetable of Seminar Groups:
IB001/01: Mon 12:00–13:50 B116, L. Bártek
IB001/02: Tue 16:00–17:50 B116, L. Bártek
IB001/03: Tue 18:00–19:50 B116, L. Bártek
IB001/04: Wed 14:00–15:50 B116, L. Bártek
IB001/05: Wed 16:00–17:50 B116, L. Bártek
IB001/06: Mon 10:00–11:50 B116, L. Krejčí
IB001/07: Mon 14:00–15:50 B116, L. Krejčí
IB001/08: Tue 10:00–11:50 B116, L. Krejčí
IB001/09: Fri 8:00–9:50 B117, P. Šmerk
IB001/10: Fri 10:00–11:50 B117, P. Šmerk
IB001/11: Tue 14:00–15:50 B116, L. Krejčí
Prerequisites
! I001 Intro to Programming
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
there are 13 fields of study the course is directly associated with, display
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
  • Borland Pacsal 7.0 manuál, Borland International, 1992
  • 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
  • WIRTH, Niklaus. Algoritmy a štruktúry údajov. Translated by Pavol Fischer. 2. vyd. Bratislava: Alfa, 1989. 481 s. ISBN 80-05-00153-3. 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á).
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.
Listed among pre-requisites of other courses
Teacher's information
http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015.
  • Enrolment Statistics (Autumn 2005, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2005/IB001