Courses – Fakultet tehničkih nauka u Novom Sadu

Subject: Design of Algorithms (17.RT43N)

General information:

Category	Scientific-professional
Scientific or art field	Computer Engineering and Computer Communication
ECTS	6

Teaching students to design and analyze the basic algorithms and data structures.

After taking this subject students should be able to: calculate the complexity of the given algorithmic solution to a problem, design an algorithmic solution to the given problem and apply the basic algorithms and data structures when solving the given computational problem.

Introduction to design and analysis of algorithms. Complexity of functions. Asymptotic notation. Recursion and Master Theorem. Sorting algorithms (Insertion Sort, Merge Sort, Heapsort, Quicksort and linear-time sorting). Basic data structures (stack, queue, list, tree, hash tables). Numerical algorithms of calculus. Examples of number-theoretic algorithms and cryptography. Graph algorithms (graph searching, topological sort, connected components, minimum spanning tree, shortest path problem). Dynamic programming. Greedy algorithms. String algorithms (Least Common Subsequence). Selected topics of the theory of computation (NP completeness). Problem solving.

Lectures. Computer laboratory exercises. Tutorials for tests and exams. Office hours. Optional challenging problem solving.

Authors	Title	Year	Publisher	Language
Henry S. Warren Jr.	Hackers Delight	2013	Addison-Wesley	English
Cormen, T.H. et al.	Introduction to Algorithms	2009	MIT Press, Cambridge	English

Course activity	Pre-examination	Obligations	Number of points
Complex exercises	Yes	Yes	6.00
Complex exercises	Yes	Yes	6.00
Test	Yes	Yes	10.00
Written part of the exam - tasks and theory	No	Yes	30.00
Test	Yes	Yes	10.00
Computer exercise attendance	Yes	Yes	3.00
Lecture attendance	Yes	Yes	3.00
Complex exercises	Yes	Yes	6.00
Test	Yes	Yes	10.00
Complex exercises	Yes	Yes	6.00
Test	Yes	Yes	10.00