Algorithms and Data StructuresCourse code: 130111 | 6 ECTS credits
Basic information
Level of Studies:Undergraduate applied studies
Year of Study:1
Semester:2
Requirements:None
Goal:This module is designed to provide understanding of fundamental data structures and algorithms used in software development.
Outcome:On successful completion of this module, students gain fundamental problem solving skills and should be able to apply knowledge of algorithms and data structures in software development.
Contents of the course
Theoretical instruction:
Basic data types. Simple and complex structures.
Static and dynamic structures.
Sequence-types and operations. Presentation of memory sequence.Optimization in sequence storing.
Lists, simple, double and circular lists linking - definition and operations.
Queues - definition, implementation and basic operations.
Stacks - definition, implementation and basic operations.
Trees - definition, representation and tree types.
Binary trees - definition, memory representation, basic operations.
Definition of the algorithm. Algorithm presentation .
М. Томашевић, Структуре података, Академска мисао, 2005.
А.Савић, С. Штрбац-Савић, Приручник за лабораторијске вежбе из предмета Дискретна математика и алгоритми, ВИШЕР, Београд 2016.
С. Ђенић, Ј. Митић, С. Штрбац, Програмирање на језику С и основи програмирања на језику С++, збирка примера и задатака за лабораторијске вежбе из предмета Основи Програмирања 2, ВИШЕР, Београд, 2006.
