Data Structures I, practicals (NTIN066)

Thursday 15:40 via Zoom

Practicals are taught by Ondřej Mička and follow up Martin Mareš's Wednesday lecture.

Muhehehe

How to get the credit

How the practicals work

Do not be afraid to ask questions! (either during the practicals or via e-mail). In the worst case, you just learn nothing new :-).

Exercises

4.3.
11.3.: Intro to splay trees and lecture notes
18.3.
25.3.
1.4.
8.4.
22.4.
29.4.
6. 5.: Polynomial hashing of strings and Rabin-Karp, recording is available on the course webpage. See also the lecture notes.
13. 5.: Bloom filters, recording is available on the course webpage. See also the lecture notes.
3.6.

Assignments

Few suggestions:

If you get stuck you can try:



Language intermezzo

Implementation assignments can be submitted either in Python 3 or in C++17. More detailed parameters, such as compiler options, can be found in ReCodEx. If you do not know C++ but you know C, do not despair! It is recommended to use C++ as if it was plain old C (perhaps with exception of C++ vectors), so you can ignore most of the features the C++ has.

If you know neither C++ nor Python there are references to documentation and some tutorials below. And, as always, you can ask the instructor.

If you are unsure which language to choose I personally would recommend Python. I consider it to be more beginner-friendly and perhaps more useful in general. Either way, I would definitely recommend using the language you feel comfortable with.

Python

C++