FEE timetable ALG students Upload system BRUTE Discussion board
Programming homeworks
There are 6 programming homeworks in the semester. The total value of the homeworks is 10 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 6 points. The homeworks are assigned and the solutions are evaluated in the upload system BRUTE.
Upload system
Communication with the upload system is described on the page Upload System.
Read it carefully.
Homework deadlines
assignment -- deadline 1. 30.9. -- 21.10. ( Asymptotic complexity ) 2. 14.10. -- 4.11. ( Tree traversal ) 3. 28.10. -- 18.11. ( Tree traversal ) 4. 11.11. -- 2.12. ( Graph search ) 5. 25.11. -- 16.12. ( Graph search ), two variants 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 The 5th homework is issued in two variants, one of them may be perceived by some as relatively less complex. However, both variants are graded equally.
Assessment
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.
jumping frogs/BFS
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.