Selected Topics in Data Structures

Syllabus:

  • Amortized analysis
  • Priority queues
  • Binary search trees
  • Hashing
  • RMQ and LCA
  • Sufix trees and arrays
  • Succinct data structures
  • BWT, FM-index
  • DS for external memory
  • Streaming DS
  • Persistent and functional DS

Schedule: Wednesdays in M-I and Thursdays in M-II at 8:10 am.

Contact: jakub.kovac47[at-sign]gmail[dot]com

Materials:

Lecture notes and slides:

Announcements

Homework

All deadlines are until 8:00 in the morning, i.e. before the lecture. Submission by email.

Points

radix deque hash bwt wavelet bonus 1 total
Max points 5 5 5 5 5 325(+3)
Antal Tomáš 4.54 5 5 4
Balan Viktor 3.55 0.5 5
Balanchuk Nadiya 5 4.5 1 5 4
Bucher Matúš 3 5 5 5 4
Bujňák Lukáš 1.54.5 4.5 54.5
Dovičič Ľuboš 2 - 5 5 4 16
Drobný Jakub 5 5 4 5 5
Farnbauer Michal 4 5
Galková Kristína 5 4 0.5 5 4.5
Halmová Daniela 2.54 4.5 5 2
Hroššová Zuzana 4.52 5 4
Hudcovský Lukáš 5 5 4 2
Jaremčuková Paulína 0.51 0.5 4.55
Kaminský Tadeáš 4 3 5 1.5
Kovalov Fedir 0.54 1 2.5 4.5
Lörinc Matej 3.55 5 5
Lukáčik Matej 55
Makuch Martin 5 5 5 5 4.5
Nágel Tomáš 2 3.5 4.5 5 4.5
Pištek Daniel 3.5 2.5 1 3 4
Poľašková Jana 5 2 4.5 5 5
Škorňák Ondrej 5 5 3 5 5
Varga Tomáš 4 4.5 4.5 5 4.5
Zrubák Filip 1.5 5 5 5

Grading: 25 points for HW + 15 points from final exam. To pass, you need at least 12.5points from homeworks.

Points Grade
40 — 34.5 points A
34 — 30 points B
29.5 — 23 points C
22.5 — 17.5 points D
17 — 12.5 points E
< 12 points Fx

Lectures