Data structures I
General information
- information in Czech
- contents changed nontrivially since the previous years
- we keep close to the classes in Czech (they are substitutable)
Lecture notes
- they are continuously restructuralized after the marker inside,
- each topic should be printable the evening before the lecture that concerns it
- current version of lecture notes (timestamped)
Useful literature
Most topics are well covered in both of these books:
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms. MIT Press, Second or third edition. Several hard copies are in our library.
- D. P. Mehta, S. Sahni eds.: Handbook of Data Structures and Applications. Chapman & Hall/CRC, Computer and Information Series, 2005. PDF is downloadable from our library (from faculty IP addresses).
Homework
- it is optional and practically oriented (programming)
- if all five are passable, they can improve the mark up to one point difference (even 4 to 3)
Rules
- All source code must be original, i.e. created only by you.
- You may discuss the homework and approaches to its solution with others, but you must not share your code.
- Submitted solutions not conforming to the rules will not be accepted.
Assignments
- external sorting. Submit source code until October 23 and measurement until October 30. Students of the English program can submit both up to November 6.
- splay trees. Submit until November 13. Students of the English program can submit up to November 20.
- heaps. Submit until December 15.