FI:IB111 Foundations of Programming - Course Information

IB111 Foundations of Programming

Extent and Intensity

2/2/0. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

doc. Mgr. Radek Pelánek, Ph.D. (lecturer)
RNDr. Mgr. Jaroslav Bayer (seminar tutor)
Mgr. Štefan Bojnák (seminar tutor)
Mgr. Martina Cvinčeková (seminar tutor)
RNDr. Jaroslav Čechák, Ph.D. (seminar tutor)
Zdenko Čepan (seminar tutor)
Ing. Lenka Dobešová (seminar tutor)
Mgr. David Dobrovolný (seminar tutor)
doc. RNDr. Vlastislav Dohnal, Ph.D. (seminar tutor)
Mgr. Jan Horáček (seminar tutor)
Ing. Miroslav Kadlec (seminar tutor)
Mgr. František Lachman (seminar tutor)
RNDr. Filip Lux (seminar tutor)
doc. RNDr. Martin Maška, Ph.D. (seminar tutor)
doc. RNDr. Pavel Matula, Ph.D. (seminar tutor)
doc. RNDr. Petr Matula, Ph.D. (seminar tutor)
Ing. Michaela Pokludová (seminar tutor)
doc. Mgr. Pavel Rychlý, Ph.D. (seminar tutor)
Mgr. Martin Stančík (seminar tutor)
Mgr. Monika Stančíková (seminar tutor)
Mgr. Miloslav Staněk (seminar tutor)
Mgr. Marek Sýs, Ph.D. (seminar tutor)
Mgr. Radim Šašinka (seminar tutor)
RNDr. Valdemar Švábenský, Ph.D. (seminar tutor)
RNDr. Matej Troják, Ph.D. (seminar tutor)
Mgr. Adam Vaňko (seminar tutor)
Jakub Žák (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (assistant)
RNDr. Martin Macák, Ph.D. (assistant)

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

Mon 17. 9. to Mon 10. 12. Mon 12:00–13:50 D2, Mon 12:00–13:50 D3, Mon 12:00–13:50 D1

• Timetable of Seminar Groups:

IB111/T01: Mon 17. 9. to Thu 13. 12. Mon 16:00–18:50 106, M. Macák, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB111/01: Tue 12:00–13:50 C511, R. Pelánek
IB111/02: Wed 16:00–17:50 A219, P. Matula
IB111/03: Tue 12:00–13:50 A219, F. Lachman
IB111/04: Tue 14:00–15:50 A219, M. Staněk
IB111/05: Tue 8:00–9:50 A215, J. Bayer
IB111/06: Tue 10:00–11:50 A215, J. Bayer
IB111/07: Fri 12:00–13:50 B130, D. Dobrovolný, R. Šašinka
IB111/08: Tue 10:00–11:50 B130, D. Dobrovolný, R. Šašinka
IB111/09: Wed 8:00–9:50 B116, M. Maška
IB111/10: Tue 18:00–19:50 A215, M. Cvinčeková
IB111/11: Mon 17. 9. to Mon 10. 12. Mon 16:00–17:50 B116, M. Kadlec
IB111/12: Wed 18:00–19:50 A215, M. Kadlec
IB111/13: Mon 17. 9. to Mon 10. 12. Mon 14:00–15:50 B311, M. Stančíková
IB111/14: Mon 17. 9. to Mon 10. 12. Mon 16:00–17:50 A219, M. Stančíková
IB111/15: Tue 14:00–15:50 B130, M. Stančík, J. Žák
IB111/16: Thu 18:00–19:50 A215, M. Sýs
IB111/17: Tue 18:00–19:50 B311, M. Sýs
IB111/18: Wed 14:00–15:50 A215, J. Bayer
IB111/19: Wed 10:00–11:50 A215, V. Dohnal
IB111/20: Wed 8:00–9:50 A215, V. Dohnal
IB111/21: Fri 10:00–11:50 B311, P. Matula
IB111/22: Fri 10:00–11:50 A215, M. Pokludová
IB111/23: Tue 16:00–17:50 A215, M. Pokludová
IB111/24: Fri 12:00–13:50 A219, P. Rychlý
IB111/25: Tue 18:00–19:50 A219, M. Troják
IB111/26: Wed 18:00–19:50 A219, M. Troják
IB111/27: Thu 12:00–13:50 A215, J. Horáček
IB111/28: Tue 8:00–9:50 B130, J. Horáček, A. Vaňko
IB111/29: Mon 17. 9. to Mon 10. 12. Mon 14:00–15:50 A215, Z. Čepan, V. Švábenský
IB111/30: Mon 17. 9. to Mon 10. 12. Mon 16:00–17:50 A215, Z. Čepan, V. Švábenský
IB111/31: Wed 12:00–13:50 B130, J. Čechák, L. Dobešová
IB111/32: Mon 17. 9. to Mon 10. 12. Mon 14:00–15:50 B130, J. Čechák, F. Lux
IB111/33: Wed 10:00–11:50 A219, F. Lux
IB111/34: Tue 16:00–17:50 A219, Š. Bojnák

Prerequisites (in Czech)

(! PB162 Java && ! PB161 C++ Programming && ! PB071 Principles of low-level prog. && ! IB001 Intro to Prog. using C && ! IB113 Intro to Programming & Algs && !NOW( IB113 Intro to Programming & Algs ) )
Předmět je určen pouze studentům FI. Pro studenty ostatních fakult je určen předmět IB113.

Course Enrolment Limitations

The course is only offered to the students of the study fields the course is directly associated with.

fields of study / plans the course is directly associated with

• Applied Informatics (programme FI, B-AP)
• Bioinformatics (programme FI, B-AP)
• Public Administration Informatics (programme FI, B-AP)
• Mathematical Informatics (programme FI, B-IN)
• Parallel and Distributed Systems (programme FI, B-IN)
• Computer Graphics and Image Processing (programme FI, B-IN)
• Computer Networks and Communication (programme FI, B-IN)
• Computer Systems and Data Processing (programme FI, B-IN)
• Programmable Technical Structures (programme FI, B-IN)
• Social Informatics (programme FI, B-AP)
• Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

Course objectives

The course is an introduction to programming and algorithmic style of thinking.

Learning outcomes

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); write and debug a program in Python; use basic data types and structures (strings, lists, dictionaries); describe several basic algorithms; describe main conventions and recommended programming style.

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, mid-term programming tests, final written test with multiple choice questions.

Language of instruction

Czech

Further Comments

Study Materials

Listed among pre-requisites of other courses

• IB002 Algorithms and data structures I
  ( IB015 || IB111 ) && !NOW(IB114)  
• IB113 Introduction to Programming and Algorithms
  !NOW(IB111) && !IB111 && !PB162 && !PB161 && !PB071 && !IB001 && !program(B-INF) && !program(B-PVA) && !program(B-CS)  
• IB114 Introduction to Programming and Algorithms II
  (IB111 || IB113) && !IB002 && !NOW(IB002)  
• Naskoc8 Nulté cvičení IB111
  fakulta(FI) && typ_studia(B) && semestr(1) && NOW(IB111)  
• PB006 Principles of Programming Languages and OOP
  (IB111 || NOW(IB111)) && (PB071 || PB111)  
• PB111 Principles of low-level programming
  IB015 || IB111  
• PV275 Introduction to Quantum Computer Programming
  ( MB141 || MB151 || MB101 || MB201 ) && IB111  

Teacher's information

http://www.fi.muni.cz/IB111/

• Enrolment Statistics (Autumn 2018, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2018/IB111