|
|
Main menu for Browse IS/STAG
Course info
KST / IDSDS
:
Course description
Department/Unit / Abbreviation
|
KST
/
IDSDS
|
Academic Year
|
2023/2024
|
Academic Year
|
2023/2024
|
Title
|
Selected subjects from algor. and struct
|
Form of course completion
|
Examination
|
Form of course completion
|
Examination
|
Long Title
|
Selected subjects from algorithms and data structures
|
Accredited / Credits
|
Yes,
0
Cred.
|
Type of completion
|
Combined
|
Type of completion
|
Combined
|
Time requirements
|
|
Course credit prior to examination
|
No
|
Course credit prior to examination
|
No
|
Automatic acceptance of credit before examination
|
No
|
Included in study average
|
NO
|
Language of instruction
|
Czech, English
|
Occ/max
|
|
|
|
Automatic acceptance of credit before examination
|
No
|
Summer semester
|
0 / -
|
0 / -
|
0 / -
|
Included in study average
|
NO
|
Winter semester
|
0 / -
|
0 / -
|
0 / -
|
Repeated registration
|
NO
|
Repeated registration
|
NO
|
Timetable
|
No
|
Semester taught
|
Winter + Summer
|
Semester taught
|
Winter + Summer
|
Minimum (B + C) students
|
not determined
|
Optional course |
Yes
|
Optional course
|
Yes
|
Language of instruction
|
Czech, English
|
Internship duration
|
0
|
No. of hours of on-premise lessons |
|
Evaluation scale |
S|N |
Periodicity |
každý rok
|
Periodicita upřesnění |
|
Fundamental theoretical course |
No
|
Fundamental course |
No
|
Fundamental theoretical course |
No
|
Evaluation scale |
S|N |
Substituted course
|
None
|
Preclusive courses
|
N/A
|
Prerequisite courses
|
N/A
|
Informally recommended courses
|
N/A
|
Courses depending on this Course
|
N/A
|
Histogram of students' grades over the years:
Graphic PNG
,
XLS
|
Course objectives:
|
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.
|
Requirements on student
|
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.
|
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).
|
Activities
|
|
Fields of study
|
|
Guarantors and lecturers
|
|
Literature
|
-
Recommended:
GOODRICH, M. T.; TAMASSIA, R. Algorithm Design. Hoboken (NJ), John Wiley & Sons, 2002..
-
Recommended:
LEWIS, H. R.; DENENBERG, L. Data structures and their algorithms. Berkley, Adison-Wesley, 1997..
-
Recommended:
CORMEN, H. a kol. Introduction to algorithms. Boston, MIT Press, 2001..
|
Prerequisites - other information about course preconditions |
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). |
Competences acquired |
Passing the course supports the skills related to analysis and effective implementations of the software solutions utilized within control and information systems. |
Teaching methods |
- Monologic (reading, lecture, briefing)
- Dialogic (discussion, interview, brainstorming)
- Skills training
|
Assessment methods |
- Oral examination
- Written examination
- Home assignment evaluation
|
|
|
|