Courses – Fakultet tehničkih nauka u Novom Sadu

Subject: Discrete and combinatorial methods for computer graphics (17.IAM002)

Native organizations units: Department of Fundamentals Sciences

Type of studies	Title
Undergraduate Academic Studies	Engineering Animation (Godina: 2, Winter)

General information:

Category	Theoretical-methodological
Scientific or art field	Teorijska i primenjena matematika
Interdisciplinary	Yes
ECTS	4

Educational goal:

In the course students will get introduced to the basic techniques of algorithms and data structures applicable in computer graphics. Students will be introduced to basic abstract data structures used in algorithms. Combinatorial algorithms, optimization and searching algorithms above all, are applied to discrete structures and are inevitable tools in the field of computer science. In the case of large space search, deterministic procedures become inadequate, and the need for heuristic method is necessary.

Educational outcome:

Acquisition of basic knowledge in the field of discrete methods of sorting, search and combinatorial optimization. Understanding basic techniques, as well as their application to some known combinatorics and/or optimization problems.

Course content:

Sorting, searching, algorithms, complexity. Elementary data structures. Graphs. Representation of graphs. Digraphs.Trees. Algorithms on graphs. The shortest path. Minimal spanning tree. Network algorithms.

Teaching methods:

Lectures and Auditory Practice. Consultations. During the Auditory Practice knowledge from lectures is being practiced. During the semester students will have two tests. Parts of the course which represent a logical whole may be taken in the form of colloquiums. If the student wins at least 50% of possible points on each colloquium, it is considered that the student passed the written part of the examination. Otherwise, the student has to take written examination. Oral exam is obligatory. In order for the student to pass the examination, he/she has to win at least one half of possible points in the written part of the examination and to show satisfying knowledge at the oral part of the examination. The course grade is formed based on the points won during semester.

Literature:

Authors	Title	Year	Publisher	Language
Cormen, T.H. et al.	Introduction to Algorithms	2009	MIT Press, Cambridge	English
Ovcin Zoran	Algoritmi i optimizacioni postupci na diskretnim strukturama, osnove i savremeni pristupi	2019	Fakultet tehničkih nauka, Novi Sad	Serbian language