Navigation

13S111ASP1 - Algorithms and Data Structures 1

Course specification
Course title Algorithms and Data Structures 1
Acronym 13S111ASP1
Study programme Software Engineering
Module
Type of study bachelor academic studies
Lecturer (for classes)
Lecturer/Associate (for practice)
Lecturer/Associate (for OTC)
ESPB 5.0 Status mandatory
Condition
The goal Teaching students the logic organization and memory representation of linear and non - linear data structures, basic operations and their typical applications.
The outcome This course should learn the student to be able for program implementation of searching and sorting algorithms and for solving of the pratical problems
Contents
Contents of lectures Linear data structures: Arrays. Lists. Stacks. Queues. Non-linear data structures. Binary trees. Optimal topologies. Traversal algorithms. Threaded trees. Graphs: representations, BFS and DFS algorithms, spanning treеs and MST, reachability, shortest paths, flow maximization. topological sorting, critical path.
Contents of exercises lab exercises, homeworks
Literature
  1. Algoritmi i strukture podataka, Milo Tomašević, Akademska misao, 2010.
Number of hours per week during the semester/trimester/year
Lectures Exercises OTC Study and Research Other classes
2 2 1
Methods of teaching auditory class lessons and exercises with presentations, lab exercises, homeworks
Knowledge score (maximum points 100)
Pre obligations Points Final exam Points
Activites during lectures 0 Test paper 30
Practical lessons 20 Oral examination 0
Projects
Colloquia 50
Seminars 0