PB164 Seminar on Design of Algorithm

Faculty of Informatics
Spring 2010
Extent and Intensity
0/2. 2 credit(s) (plus extra credits for completion). Type of Completion: z (credit).
Teacher(s)
Mgr. et Mgr. Jan Krhovják, Ph.D. (seminar tutor)
RNDr. Václav Lorenc (seminar tutor)
Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (seminar tutor)
doc. RNDr. Petr Švenda, Ph.D. (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
Guaranteed by
prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Timetable
Mon 14:00–15:50 B116
  • Timetable of Seminar Groups:
PB164/01: Mon 10:00–11:50 B116, A. Zlámal
PB164/03: Thu 10:00–11:50 B116, V. Lorenc
PB164/04: Thu 12:00–13:50 B116, V. Lorenc
PB164/05: Wed 10:00–11:50 B116, P. Švenda
PB164/06: Wed 12:00–13:50 B116, P. Švenda
PB164/07: Thu 12:00–13:50 A104, Z. Říha
Prerequisites
IB001 Intro to Programming
Basic knowledge of structured programming and ability of composition of basic algorithm .
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 100 student(s).
Current registration and enrolment status: enrolled: 0/100, only registered: 0/100, only registered with preference (fields directly associated with the programme): 0/100
fields of study / plans the course is directly associated with
there are 10 fields of study the course is directly associated with, display
Course objectives
PB164 extends the IB002 Algorithm design. The aim of the subject is to practice programming of basic algorithms on computers. At the end of the course students will be able write procedural programms in C on basic level.
Syllabus
  • Algorithms cover data structures (trees, lists, arrays, circular buffers,dictionaries, associative arrays), sorting and graph algorithms and memory management algorithms.
  • Exercises also touch the area of secure programming (the most common faults and their detection).
Literature
  • DEMEL, Jiří. Grafy a jejich aplikace. Vyd. 1. Praha: Academia, 2002, 257 s. ISBN 8020009906. info
  • TÖPFER, Pavel. Algoritmy a programovací techniky. 1. vyd. Praha: Prometheus, 1995, 299 s. ISBN 80-85849-83-6. info
  • KUČERA, Luděk. Kombinatorické algoritmy. 2., nezměn. vyd. Praha: SNTL - Nakladatelství technické literatury, 1989, 286 s. info
  • DEMEL, Jiří. Grafy. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1988, 180 s. info
Teaching methods
excercise in a computer lab, homeworks
Assessment methods
homeworks, final project
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2009, Spring 2011, Spring 2012, Spring 2013.
  • Enrolment Statistics (Spring 2010, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2010/PB164