Search
FEL 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 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.
Upload system Communication with the upload system is described on the page Upload System. Read it carefully.
First homework – problem statement Collecting samples
Homework deadlines
assignment -- deadline 1. 7.3. -- 28.3. ( Asymptotic complexity ) 2. 14.3. -- 4.4. ( Tree traversal ) 3. 21.3. -- 11.4. ( Tree traversal ) 4. 28.3. -- 25.4 ( Graph search ) 5. 4.4. -- 2.5. ( Graph search ) 6. 11.4. -- 9.5. ( 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
Seminar 1. problems – (complexity) – pdf , additional: pdf . Seminar 2. problems – (recursion, recurrences) – pdf . With solutions: here. Seminar 3. problems – (tree traversal) – pdf. With solutions: here. Seminar 4. problems – (graph traversal) – doc. With solutions: doc.
Seminar 5. problems – (search trees, state space search) docx . Seminar 6. problems – (AVL and B-trees) – docx . Seminar 7. problems – (O(n^2) sorts) – docx Seminar 8. problems – (O(n log(n)) sorts, binary heap) – doc Seminar 9. problems – (O(n) sorts) – pdf. Seminar 10. problems – (Dynamic programming I) – doc. With solutions: doc. Seminar 11. problems – (Dynamic programming II) – doc Seminar 12. problems – (Hash tables I) – I and II: doc Seminar 13. problems – (Hash tables II) – dtto Seminar 14. problems – (Multi Dim sorts, median search) – In preparation.