|
|
Main menu for Browse IS/STAG
Course info
KST / DADAS
:
Course description
Department/Unit / Abbreviation
|
KST
/
DADAS
|
Academic Year
|
2023/2024
|
Academic Year
|
2023/2024
|
Title
|
Sel.Chapters fr. Algorit. & Data Struct.
|
Form of course completion
|
Examination
|
Form of course completion
|
Examination
|
Long Title
|
Selected Chapters from Algorithms and Data Structures
|
Accredited / Credits
|
Yes,
20
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 / -
|
1 / -
|
0 / -
|
Included in study average
|
NO
|
Winter semester
|
0 / -
|
0 / -
|
0 / -
|
Repeated registration
|
NO
|
Repeated registration
|
NO
|
Timetable
|
Yes
|
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 |
0
|
Evaluation scale |
S|N |
Periodicity |
každý rok
|
Periodicita upřesnění |
|
Fundamental theoretical course |
No
|
Fundamental course |
Yes
|
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:
|
Theoretical principles of selected advanced data structures and their relevant algorithms are introduced. Essential attention is paid to designing and implementing efficient software solutions (namely from the viewpoint of computational complexity).
|
Requirements on student
|
The student is supposed to create a software application within the frame of which selected data structures (incl. relevant algorithms) are implemented. The implemented structures correspond with the theoretical topics of the course.
The student completes at least 3 consultations during the semester concerning the theoretical content of the course. The student will pass at least 1 consultations concerning the assigned practical problem.
|
Content
|
The main topics of the course:
*Data structures and algorithms applying hash techniques - abstract data type table/dictionary, principles of creating hash functions, static and dynamic (extendible) hashing, methods of solving collisions, universal hashing, hash files. *Indexed files - indices over base/data files (block-oriented), sparse and dense indices (fixed and unfixed records), linear indices (indexed sequential files), hierarchical indices - B-trees, multiple indices. *Selected data structures for storing multidimensional data - range tree, k-D tree, priority search tree, quad tree (octal tree), R-tree, grid file, interval searching within multidimensional data.
|
Activities
|
|
Fields of study
|
|
Guarantors and lecturers
|
|
Literature
|
-
Basic:
Cormen, Thomas H. Introduction to algorithms. Cambridge, Mass.: Massachusetts Institute of Technology, 2001. ISBN 0-262-53196-8.
-
Recommended:
LEWIS, H. R.; DENENBERG, L. Data structures and their algorithms. Berkley, Adison-Wesley, 1997..
-
Recommended:
Samet, Hanan. Foundations of multidimensional and metric data structures. San Francisco: Morgan Kaufmann, 2006. ISBN 0-12-369-446-9.
-
Recommended:
Bhattacharya, Arnab. Fundamentals of database indexing and searching. 2014. ISBN 978-1466582545.
|
Prerequisites - other information about course preconditions |
- |
Competences acquired |
- |
Teaching methods |
- Monologic (reading, lecture, briefing)
- Methods of individual activities
- Laboratory work
|
Assessment methods |
- Oral examination
- Written examination
- Home assignment evaluation
|
|
|
|