• Course code:63279
  • Credits:6
  • Semester: winter
  • Contents

Lectures:

  • models of computation, computational complexity
  • sorting
  • abstract data types
  • tree structures
  • greedy algorithms
  • graphs, minimum spanning trees
  • shortest paths
  • divide and conquer
  • dynamic programming
  • computational geometry
  • solving hard problems

Tutorials and homeworks:

Practical applications of the knowledge gained through lectures. The emphasis is on the autonomous work of students with the help of assistants. During tutorials, students will implement solutions of various short problems. With successful solutions they will pass their continuous study and can take the exam.

  • Study programmes
  • Distribution of hours per semester
45
hours
lectures
30
hours
laboratory work
  • Professor
Assist. Prof. dr. Tomaž Hočevar
Instructor
Room:R3.20 - Laboratorij LB
details
Assist. dr. Gašper Fele Žorž
Teaching Assistant
Room:R3.41 - Računalniški center, vodja
details
Assist. Assist. Maj Zirkelbach
Teaching Assistant
details
Assist. Prof. dr. Bojan Žunkovič
Teaching Assistant
Room:R2.26 - Laboratorij LKM
details