FI:IB111 Programing and algorithms - Course Information

IB111 Programing and algorithms

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)
Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (lecturer)

Guaranteed by

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 8:00–9:50 B410, Mon 12:00–13:50 A104

Prerequisites (in Czech)

! IB002 Algorithms I

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

• Czech Language with Orientation on Computational Linguistics (programme FF, B-FI)
• Public Administration Informatics (programme FI, B-AP)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (programme FI, N-AP)

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 use basic constructs of programming languages (e.g., conditions, loops, basic data types);
know fundamental algorithms and data structures and appreciate their elegance;
have an overview of different programming languages and understand their scope of applicability.

Syllabus

• Basic constructions of imperative programming languages: conditions, loops, data types, functions, input, output.
• Data structures: list, queue, stack, trees.
• Fundamental algorithms: sorting, searching, graph traversals, geometric algorithms.
• Algorithm design techniques: recursion, heuristics.
• Overview of programming languages: object oriented languages, logic and functional programming, scripting languages.

Literature

• LEVITIN, Anany. Introduction to the design & analysis of algorithms. 2nd ed. Boston: Pearson Addison-Wesley, 2007, xxiii, 562. ISBN 9780321364135. info
• CORMEN, Thomas H. Introduction to algorithms [2nd ed.]. 2nd ed. Cambridge: MIT Press, 2001, xxi, 1180. ISBN 0-262-03293-7. info

Teaching methods

lectures, programming seminars, homeworks (programming)

Assessment methods

homeworks, final written test

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
  IB111 && PB151  
• PV275 Introduction to Quantum Computer Programming
  ( MB141 || MB151 || MB101 || MB201 ) && IB111  

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