Practices

Semester organization

Programming homeworks
There are 6 programming homeworks in the semester. The total value of the homeworks is 12 points, the value of each one homework is 2 points. To obtain the assessment it it necessary to solve successfully a number of problems which yields at least 8 points. The homeworks are assigned and the solutions are evaluated in the upload system BRUTE.

Communication with the upload system is described on the page Upload System.

• Each homework implements some lecture topics, sometimes that topics might be only a part of the homework. To solve an advanced homework it may be necessary to acquaint oneself with another basic algorithm not covered in the lectures, for example shortest paths in weighted graphs, minimum spanning tree etc.
• A successful solution of a homework must produce a correct result on at least 9 of 10 input data files.
• A successful solution has to be effectively implemented. A time limit is specified for each input data file. The limit varies between 1 and few tens of seconds for different inputs. The solution must produce the result within the time limit.
• The deadlines of the homeworks are fixed. Individual plan can be agreed upon in case of prolonged sickness, foreign trip or other important causes.
• The Discussion board may help with discussions about the homeworks and other issues of the course.

1.  1.10. -- 22.10.   ( Asymptotic complexity )
2. 15.10. --  5.11.   ( Tree traversal )
3. 29.10. -- 19.11.   ( Tree traversal )
4. 12.11. --  3.12.   ( Graph search )
5. 26.11. -- 17.12.   ( Graph search )
6. 10.12. --   7.1.   ( Graph search )

Correct 10 of given 10 test cases   ... 2 pts
Correct 9 of given 10 test cases    ... 1 pt
Correct 8 or less of 10 test cases  ... 0 pts

Assessment

• It is necessary to obtain at least 8 points for solving the programming homeworks.
• It is vitally important to avoid plagiarism in the homeworks, read carefully the rules of Plagiarism. Consult the teacher in advance if there is anything unclear to you in this regard.

Practices problems

Practices 1. problems – (complexity) – pdf , additional: pdf .
Practices 2. problems – (tree traversal) – pdf. With solutions: here. Online version: pdf .
Practices 3. problems – binary tree examples, A. binary tree problems, B. more recursive problems – write as many as possible working solutions of problems in A. and B.
Practices 4. problems – continue with recursion and tree problems
Practices 5. problems – (graph traversal) – doc. With solutions: doc.
Practices 6. problems – (recursion, recurrences) – pdf . With solutions: here.
Practices 7. problems – (search trees, state space search) docx .
Practices 8. problems – (AVL and B-trees) – docx .
Practices 9. problems – (O(n^2) and O(n log(n)) sorts, binary heap) – docx, doc
Practices 10. problems – (O(n) sorts) – pdf.
Practices 11. problems – (Dynamic programming I) – doc. With solutions: doc.
Practices 12. problems – (Dynamic programming II) – doc
Practices 13. problems – (Hash tables I) – I and II: doc
Practices 14. problems – (Hash tables II) – dtto
Practices 14. problems – (Multi Dim sorts, median search) – In preparation. 