Homeworks

Deadline for submissions is before the start of your group's practical session. In the session, you should be able to present any of the tasks marked as completed.

1. (16,17.02) Homework 1 Order of growth

2. (02,03.03) Homework 2 Linear structures: Search, sort

3. (09,10.03) Homework 3 Search, skip-lists, etc continued

4. (16,17.03) Homework 4 Trees 1

5. (23,24.03) Homework 5 Trees 2

6. (30,31.03) Homework 6 Heaps, Hashing

7. (6,7.04) Homework 7 Graphs I

8. (13,14.04) Homework 8 Graphs II

9. (20.04, 21.04) Homework 9 Graphs III

10. (27,28.04) Homework 10 Dynamic programming

11. (4,5.05) Homework 11 Search

No Homework tasks for May 11, May 12th

Project proposals The presentation file with some of the project proposal ideas.

Essay Deadline May 12th

  • Please select an article from the list:

1. Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing

2. An Optimal Bloom Filter Replacement

3. A Practical Quicksort Algorithm for Graphics Processors

4. Beam-Stack Search: Integrating Backtracking with Beam Search

5. Ant Colony Optimization

6. Patent: Scalable Minimal Perfect Hashing

7. Algorithms for de novo short read assembly using de Bruijn graphs

8. Software Transactional Memory for Dynamic-Sized Data Structures

Use 2-column layout, write appropriate title, author, affiliation, abstract, 2-3 sections, conclusions, references, 1-2-3 Figures/Tables/Agorithms. Make sure to follow one of the good citing manners [ABC05], [Aut99] or (Author, 1999), etc.

Project: Deadline May 26th

Sidebar
Page edit