Subject: Theory of Algorithms (14 - IFE211)

Basic Information

Scientific or art field:Applied Computer Science and Informatics
Course specification

Course is active from 16.05.2014..

The overall education goal of course is development of algorithmic culture in todays engineers, as an important part of general engineering culture. The particular education goals are development of student’s ability to ?) understand basic concepts from Theory of Algorithms and Computational Complexity disciplines, b) determine algorithmic hardness of the problems, c) chose algorithmic technique which is adequate to the hardness of the problem at hand and d) apply adequate algorithms in solving problem of interest.
The basic education outcomes are understanding and determination of algorithmic hardness of the problem and the complexity of algorithms, as well as independent algorithmic solving of engineering problems of interest.
Introduction to the Theory of Algorithms and Computational Complexity. Determination of algorithmic hardness of the problem. Reductions among problems. Asymptotic notation, time and space complexity. Basic complexity classes. Types of algorithms. Greedy, divide-and-conquer algorithms, breadth and depth first search, dynamic programming, branch-and-bound algorithms. Randomized and probabilistic algorithms. Parameterized and approximation algorithms. Algorithmic heuristics and meta-heuristics. ??thematical programming. Single- and multi-objective optimization algorithms. Parallel and distributed algorithms.
Lectures. Exercises and computer lab exercises. Consultation. On lectures, students become familiar with general algorithmic techniques, which are adequate in solving problems of different algorithmic hardness. Lectures are followed with adequate example problems on exercises and in computer lab, which helps in understanding course topics and material. Besides lectures and exercises, consultations with students are regularly held.
Christos H. PapadimitriouComputational Complexity1995Addison Wesley LongmanEnglish
G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. SpaccamelaComplexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties1999SpringerEnglish
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford SteinIntroduction to Algorithms, Third Edition1999The MIT PressEnglish
Zbigniew Michalewicz, David B. FogelHow to Solve It: Modern Heuristics2010Springer, 2nd Rev&Ext. editionEnglish
Course activity Pre-examination ObligationsNumber of points
Computer excersise defenceYesYes30.00
Coloquium examYesYes20.00
Oral part of the examNoYes30.00
Name and surnameForm of classes
Missing picture!

Dautović Staniša
Assistant Professor

Missing picture!

Kupusinac Aleksandar
Associate Professor

Missing picture!

Knežević Marko

Computational classes
Missing picture!

Dimitrieski Vladimir
Assistant Professor

Computational classes