Faculty of Technical Sciences

Subject: Algorithms and Data Structures (17.SE0008)

Native organizations units: Sub-department for Applied Computer Science and Informatics
General information:
 
Category Scientific-professional
Scientific or art field Applied Computer Science and Informatics
ECTS 7

Introduce students to concepts of in-memory data structures and their use in program development.

Upon successful course completion, student is familiar with abstract data types and capable of handling linear data structures - arrays, sets, maps, lists, stacks, queues; Student is also familiar with basic concepts of program efficiency analysis; Student is capable of using search and sort methods on data structures; Student understands the concept of recursiond and its use in program development; Student understands and use hash tables as well as tree structures.

Abstract data types: concept of abstract data type; new type definition. Arrays: concept of an array, operations on arrays, efficency analysis for operations on arrays, matrix, operations on matrices. Sets and maps: concept od data set, set impelementation, concept of map, map implementation, multidimensional arrays and operations on them. Algorvišedimenzionalni nizovi i operacije nad njima. Algorithm analysis: O notation, Pzthon list analysis. Searching and sorting: lienar and binary search, sorting alhorithms, operations on sorted arrays.List, stack and queue: linked lists, use of linked lists, operations on linked lists; double linked lists; stack - concept and operations; queue - concept and operation. Stack and Queue implementation; Multiple-linked lists. Recursion - concept and features. recursion implementation and usage. Hash tables: hash functions, hash tables - concept and operations, hash usage. Trees: binary trees - concept and operation; N-Trees; Search trees.

Lectures, Computer exercises; Consultations. The exam is oral. Assessment and final marks are based on the success of the laboratory exercises and an oral exam.

Authors Title Year Publisher Language
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein Introduction to Algorithms, 3rd Edition 2009 MIT Press English
R.D. Necaise Data Structures and Algorithms Using Python 2010 Wiley English
Course activity Pre-examination Obligations Number of points
Project defence Yes Yes 50.00
Theoretical part of the exam No Yes 50.00
API Image

Prof. Milosavljević Branko

Full Professor

Lectures

Asst. Prof. Nikolić Siniša

Assistant Professor

Lectures

Assistant - Master Dragaš Bojana

Assistant - Master

Computational classes

Teaching Associate Mihić Relja

Teaching Associate

Computational classes

Faculty of Technical Sciences

© 2024. Faculty of Technical Sciences.

Contact:

Address: Trg Dositeja Obradovića 6, 21102 Novi Sad

Phone:  (+381) 21 450 810
(+381) 21 6350 413

Fax : (+381) 21 458 133
Emejl: ftndean@uns.ac.rs

© 2024. Faculty of Technical Sciences.