Course: Selected subjects from algorithms and data structures

« Back
Course title Selected subjects from algorithms and data structures
Course code KST/IDSDS
Organizational form of instruction no contact
Level of course Doctoral
Year of study not specified
Semester Winter and summer
Number of ECTS credits 0
Language of instruction Czech, English
Status of course Optional
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Kavička Antonín, prof. Ing. Ph.D.
Course content
The content of the course is focused mainly on the basic concepts and applications of advanced data structures and algorithms from the following fields: interval and multi-dimensional searching (k-D trees, priority search trees, interval trees, quad and octal trees, grid files), hash tables (static hash tables, hash files with dynamic hashing) and multi-indexed files (files with dense indices, inverted files).

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Skills training
Learning outcomes
The main goal of the course is to familiarize the students with the selected parts of advanced data structures and relevant algorithms, which are applicable to designing and effective implementations of the software solutions utilized within control and information systems.
Passing the course supports the skills related to analysis and effective implementations of the software solutions utilized within control and information systems.
Prerequisites
There is expected an intermediate knowledge from the field of data structures and algorithms (abstract data types and structures, data structures with linear and hierarchical organization, priority queues, tables/dictionaries, graphs, block-oriented files).

Assessment methods and criteria
Oral examination, Written examination, Home assignment evaluation

The examination is focused on the theoretical principles related to advanced data structures and relevant algorithms. In addition, it is required to implement a software application, which utilizes selected advanced data structures and algorithms.
Recommended literature
  • CORMEN, H. a kol. Introduction to algorithms. Boston, MIT Press, 2001..
  • GOODRICH, M. T.; TAMASSIA, R. Algorithm Design. Hoboken (NJ), John Wiley & Sons, 2002..
  • LEWIS, H. R.; DENENBERG, L. Data structures and their algorithms. Berkley, Adison-Wesley, 1997..


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester
Faculty of Electrical Engineering and Informatics Information, Communication and Control Technologies (2013) Electrical engineering, telecommunication and IT - -
Faculty of Electrical Engineering and Informatics Information, Communication and Control Technologies (2013) Electrical engineering, telecommunication and IT - -
Faculty of Electrical Engineering and Informatics Information, Communication and Control Technologies (2013) Electrical engineering, telecommunication and IT - -
Faculty of Electrical Engineering and Informatics Information, Communication and Control Technologies (2013) Electrical engineering, telecommunication and IT - -