FI:PB164 Seminar on Design of Algorithm - Course Information

PB164 Seminar on Design of Algorithm

Extent and Intensity

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

Teacher(s)

Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (lecturer)
Mgr. Miroslav Buda (seminar tutor)
RNDr. Filip Jurnečka, Ph.D. (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)

Guaranteed by

doc. RNDr. Vlastislav Dohnal, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable of Seminar Groups

PB164/01: Wed 10:00–11:50 G191a, Z. Říha
PB164/02: Tue 10:00–11:50 G191a, F. Jurnečka
PB164/03: Mon 14:00–15:50 B204, M. Buda
PB164/04: Tue 14:00–15:50 B311, A. Zlámal

Prerequisites (in Czech)

IB001 Intro to Prog. using C && ! NOW( IB002 Algorithms I )

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

• 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)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (programme FI, N-AP)
• Social Informatics (programme FI, B-AP)
• Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

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.

• Enrolment Statistics (recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2013/PB164