IB111 Introduction to Programming

Faculty of Informatics
Autumn 2016
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
doc. Mgr. Radek Pelánek, Ph.D. (lecturer)
RNDr. Nikola Beneš, Ph.D. (lecturer)
RNDr. Mgr. Jaroslav Bayer (seminar tutor)
RNDr. Jaroslav Bendík (seminar tutor)
Mgr. Jaroslav Čechák (seminar tutor)
Mgr. Jan Drábek (seminar tutor)
RNDr. Jiří Glozar (seminar tutor)
Ing. Miroslav Kadlec (seminar tutor)
Mgr. Matěj Klusáček (seminar tutor)
Mgr. Slavomír Krupa (seminar tutor)
RNDr. Adam Kučera, Ph.D. (seminar tutor)
RNDr. Marek Medveď (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
Ing. Michaela Pokludová (seminar tutor)
RNDr. Lukáš Ručka (seminar tutor)
RNDr. Jiří Řihák, Ph.D. (seminar tutor)
Mgr. Bedřich Said (seminar tutor)
Mgr. Martin Stančík (seminar tutor)
RNDr. Valdemar Švábenský (seminar tutor)
RNDr. Michal Zima (seminar tutor)
Guaranteed by
doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Supplier department: Department of Computer Systems and Communications - Faculty of Informatics
Timetable
Wed 12:00–13:50 D2, Wed 12:00–13:50 D3, Wed 12:00–13:50 D1
  • Timetable of Seminar Groups:
IB111/T01: Mon 19. 9. to Thu 22. 12. Mon 13:40–15:15 KOM 110, Fri 23. 9. to Thu 22. 12. Fri 12:00–13:35 KOM 116, J. Glozar, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB111/01: Fri 10:00–11:50 A318, R. Pelánek
IB111/02: Mon 12:00–13:50 B311, N. Beneš
IB111/03: Mon 16:00–17:50 A219, J. Plhák
IB111/04: Mon 14:00–15:50 A219, J. Plhák
IB111/05: Mon 8:00–9:50 A215, J. Plhák
IB111/06: Mon 10:00–11:50 A219, J. Plhák
IB111/07: Thu 10:00–11:50 A215, J. Drábek
IB111/08: Thu 12:00–13:50 A215, J. Drábek
IB111/09: Thu 18:00–19:50 A215, M. Medveď
IB111/10: Thu 16:00–17:50 A215, M. Medveď
IB111/11: Tue 16:00–17:50 A215, J. Řihák
IB111/12: Tue 8:00–9:50 B116, J. Bendík
IB111/13: Tue 14:00–15:50 A219, J. Bendík
IB111/14: Mon 18:00–19:50 A219, M. Klusáček
IB111/15: Wed 8:00–9:50 A219, M. Stančík
IB111/16: Thu 8:00–9:50 A219, V. Švábenský
IB111/17: Tue 14:00–15:50 B117, J. Bayer
IB111/18: Tue 12:00–13:50 B117, J. Bayer
IB111/19: Wed 16:00–17:50 A219, J. Bayer
IB111/20: Wed 18:00–19:50 A219, J. Bayer
IB111/21: Mon 8:00–9:50 B116, A. Kučera
IB111/22: Mon 10:00–11:50 B116, A. Kučera
IB111/23: Tue 12:00–13:50 A215, V. Švábenský
IB111/24: Thu 8:00–9:50 A215, M. Stančík
IB111/25: Thu 10:00–11:50 B117, J. Čechák
IB111/26: Wed 16:00–17:50 A215, S. Krupa
IB111/27: Wed 14:00–15:50 A215, S. Krupa
IB111/28: Mon 12:00–13:50 A215, B. Said
IB111/29: Tue 18:00–19:50 B311, M. Kadlec
IB111/30: Thu 18:00–19:50 A219, M. Kadlec
IB111/31: Wed 8:00–9:50 A215, M. Zima
IB111/32: Tue 18:00–19:50 A219, L. Ručka
IB111/33: Wed 18:00–19:50 B117, M. Pokludová
IB111/34: Tue 16:00–17:50 A219
Prerequisites (in Czech)
OBOR ( SOCI ) || OBOR ( INVS ) || (! PB162 Java && ! PB161 C++ Programming && ! PB071 Introduction to the C language && ! IB001 Intro to Prog. using C && ! NOW ( IB001 Intro to Prog. using C ))
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 18 fields of study the course is directly associated with, display
Course objectives
The course is an introduction to programming and algorithmic style of thinking. At the end of the course students should be able to: understand and apply basic constructs of programming languages (e.g., conditions, loops, functions, basic data types) and know several basic algorithms.
Syllabus
  • Basic constructions of imperative programming languages: conditions, loops, data types, functions, input, output.
  • Number types, randomness, algorithms with numbers.
  • Data types, lists, dictionaries, objects.
  • Basic algorithms: prime numbers, sorting, searching. Complexity of algorithms (basics).
  • Recursion.
  • Turtle graphics, bitmap graphics, regular expressions, text processing.
Literature
    recommended literature
  • PELÁNEK, Radek. Programátorská cvičebnice: algoritmy v příkladech. Brno: Computer Press, 2012. 175 pp. ISBN 978-80-251-3751-2. info
  • GUZDIAL, Mark and Barbara ERICSON. Introduction to computing & programming in Python : a multimedia approach. 2nd ed. Upper Saddle River [N.J.]: Prentice Hall, 2010. xxiii, 401. ISBN 9780136060239. info
  • ZELLE, John M. Python programming : an introduction to computer science. Wilsonville: Franklin, Beedle &Associates, 2004. xiv, 514. ISBN 1887902996. info
Teaching methods
lectures, programming seminars, homeworks (programming)
Assessment methods
Assesment consists of 3 parts: homeworks (30 %), mid-term programming test (20 %), final written test with multiple choice questions (50 %).
Language of instruction
Czech
Further Comments
Study Materials
Listed among pre-requisites of other courses
Teacher's information
http://www.fi.muni.cz/IB111/
The course is also listed under the following terms Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2017, Autumn 2018, Autumn 2019.
  • Enrolment Statistics (Autumn 2016, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2016/IB111