Data Structures 1 (practicals)
Time and space coordinates:
Monday 9:00, S6
This practicals are taught by David Mareček
The lectures are taught by Petr Gregor on Wednesdays at 10:40 in S9 (link to the lectures page)
(the other parallel practicals taught by Jirka Fink are on Wednesdays 15:40)
LECTURE NOTES
Passing requirements:
-
To get the credit you need at least 75 points from homework assignments.
-
There will be 7 programming assignments per 10 points and 3 experimental assignments per 15 points. (i.e. 115 points in total).
Assignments:
-
All assignments are submitted using the ReCodEx system (including the experimental ones).
-
Please join the ReCodEx group corresponding to these practicals.
-
You will have at least 14 days to complete each assignment.
-
Instructor's feedback on your solutions will also be in ReCodEx (it can be useful to set up mail notifications).
-
Materials for assignments (source codes etc.) will be published to the git repository.
-
Programming assignments:
-
You are given a partial implementation of a DS
-
Implement the missing bits
-
Automatic checking, tests are public
-
The instructor looks at the source code
-
C++ and Python are available
-
Experimental assignments:
-
Measure properties of a given implementation
-
Write a report (and submit PDF)
-
Make sure that the figures are properly labelled.
-
Describe the plots: are the curves asymptotically constant/logarithmic/linear?
-
Explain why: cite the theorem supporting your observation, or try to prove it yourself. Or at least try to guess. (In some cases it is harder to prove it.)
-
Compare the curves among each other and among the experiments. Try to explain the differences.
-
General rules
Practicals:
-
Attendance at the practicals is not mandatory but recommended.
-
The practicals will usually have three parts:
-
Discussing the homework: solution of the previous assignment, questions about the current assignment, and explanation of the next assignment
-
Discussing questions and issues from the lecture
-
Other exercises that should help you better understand the topic
23th February: HW: tree_successor, exercises,