Principles of Data Organisation (NDBI007)

Basic Information

Annotation (source: SIS)
Lecturer: Irena Holubová (irena.holubova (at) matfyz.cuni.cz)
Tutor: Irena Holubová (irena.holubova (at) matfyz.cuni.cz), Pavel Koupil (pavel.koupil (at) matfyz.cuni.cz)
Lectures
Schedule
- Lectures: Friday 10:40 - 12:10 (room S4)
- Practical classes: Every even Friday 12:20 - 13:50 (room S4)
Table with points

Attendance is not compulsory, yet recommended
During each 2nd to 6th practical class, 1 activity point can be acquired for solving exercises

You will be assigned 5 individual homework during the semester
There will be standard and extended version of the homework
If you miss a practical class or you will not get bonus point during practical class, completing an extended version of homework may award you by 1 extra activity point
Otherwise, up to 5 activity points can be earned for complete and correct solution
There will always be at least 7 days for completing homework assignment
Particular homework solution can be submitted only once (email: pavel.koupil@matfyz.cuni.cz)
No late submission is accepted

At least 15 points from practical classes and individual assignments is required for the course credit to be granted
All above 15 activity points are transferred as bonus points to the exam (up to 15 points)

Date	Content	Supplementary Material	Homework
10. 10. 2025	The Hard Disk Drive (.pdf)	deskstar.pdf	-
24. 10. 2025	Static Indexes and Bitmaps (.pdf)	-	NDBI007_A1.pdf
7. 11. 2025	Static Hashing (.pdf)	-	NDBI007_A2.pdf records_A2.csv
21. 11. 2025	Dynamic Hashing (.pdf)	-	NDBI007_A3.pdf records_A3.csv
5. 12. 2025	B-Tree (.pdf)	-	NDBI007_A4.pdf records_A4.csv
12. 12. 2025	R-Tree, Splitting of an Overflown Node (.pdf)	-	NDBI007_A5.pdf

Pokorný, Jaroslav, and Michal Žemlička. Základy implementace souborů a databází. Karolinum, 2004.