Subject: Algorithms for discrete data structures (17.0M554 )
Study programmes of the course:
| Type of studies | Title |
|---|---|
| Master Academic Studies | Mathematics in Engineering (Year: 2, Semester: Summer) |
In the course students will get introduced to the basic techniques of algorithms and data structures applicable on disrete structures. 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.
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.
Sorting, searching, algorithms, complexity. Elementary data structures. Graphs. Representation of graphs. Digraphs.Trees. Algorithms on graphs. The shortest path. Minimal spanning tree. Network algorithms.
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.
| Authors | Title | Year | Publisher | Language |
|---|---|---|---|---|
| Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein | Introduction to Algorithms | 2009 | Third Edition (3rd ed.). The MIT Press | English |
| Course activity | Pre-examination | Obligations | Number of points |
|---|---|---|---|
| Test | Yes | Yes | 30.00 |
| Written part of the exam - tasks and theory | No | Yes | 50.00 |
| Oral part of the exam | No | Yes | 20.00 |
Asst. Prof. Ovcin Zoran
Assistant Professor
Lectures
Assistant - Master Tošić Stefan
Assistant - Master
Practical classes
Assistant - Master Tošić Stefan
Assistant - Master
Computational classes
Faculty of Technical Sciences
© 2024. Faculty of Technical Sciences.
Contact:
Address: Trg Dositeja Obradovića 6, 21102 Novi Sad
© 2024. Faculty of Technical Sciences.