Dokument se učitava


School of Electrical and Computer Engineering of Applied Studies


Algorithms and Data Structures Course 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:
  1. Basic data types. Simple and complex structures.
  2. Static and dynamic structures.
  3. Sequence-types and operations. Presentation of memory sequence.Optimization in sequence storing.
  4. Lists, simple, double and circular lists linking - definition and operations.
  5. Queues - definition, implementation and basic operations.
  6. Stacks - definition, implementation and basic operations.
  7. Trees - definition, representation and tree types.
  8. Binary trees - definition, memory representation, basic operations.
  9. Definition of the algorithm. Algorithm presentation .
  10. Algorithic complexity.
  11. Sorting. Linear complexity sorting methods.
  12. Searhc. Sequencial and binary search.
  13. Graphs, definitions, representations. Graph tour. Nodes reachability determination.
  14. Compression.
  15. Basic cryptographic methods.
Practical instruction (Problem solving sessions/Lab work/Practical training):
  1. Tuition is in compliance to the curriculum.
Textbooks and References
  1. M. Tomašević, Strukture podataka, Akademska misao, 2005.
  2. A.Savić, S. Štrbac-Savić, Priručnik za laboratorijske vežbe iz predmeta Diskretna matematika i algoritmi, VIŠER, Beograd 2016.
  3. S. Đenić, J. Mitić, S. Štrbac, Programiranje na jeziku S i osnovi programiranja na jeziku S++, zbirka primera i zadataka za laboratorijske vežbe iz predmeta Osnovi Programiranja 2, VIŠER, Beograd, 2006.
Number of active classes (weekly)
Lectures: 2
Practical classes: 3
Other types of classes: 0
Grading (maximum number of points: 100)
Pre-exam obligations
activities during lectures
activities on practial excersises
seminary work
Final exam
Written exam
Oral exam