Students will understand how to develop and maintain algorithms used for managing different data structures.
Students are expected to learn how to apply the main methods of creating, maintaining, searching and consulting different algorithmic structures.
Theoretical training
• Introduction: The concept of type, abstract data type and data structure;
• Component elements of the structure;
• Abstract data types: list, stack, queue, ordered and binary trees (tree B-tree), arrays, dictionary, priority order;
• Overview of data structures: linked list and other bound structures, hash tables, stacks;
• Algorithms for performing basic operations on the data structures: writing, inserting and deleting data, searching;
• Application of the described structures in complex algorithms: sorting and merging of data sets, arithmetic expressions, recursive methods;
• General strategies for creating algorithms: divide and control, dynamic programming, greedy approach, backtracking, local search;
• Handling files: search, consultation, creation and coupled procedures.-spregnuti postupci
Practical training
Work on tasks related to mentioned algorithm structures.
Божић, Д., Богданов, Н., & Шеварлић, М. (2011). Економика пољопривреде. Београд: Пољопривредни факутет.
Влаховић, Б. (2011). Тржиште и маркетинг пољопривредно-прехрамбених производа. Нови Сад: Пољопривредни факултет.
Закић, З., & Стојановић, Ж. (2008). Економика аграра. Београд: Економски факултет.
Јанковић, С. (2009). Европска унија и рурални развој Србије. Београд: Институт за примену науке у пољопривреди.
Lectures, work in a computer laboratory, presentations, discussions.
