# 13E112ASP - Algorithms and Data Structures

Course specification
Course title Algorithms and Data Structures
Acronym 13E112ASP
Study programme Electrical Engineering and Computing
Module
Type of study bachelor academic studies
Lecturer (for classes)
Lecturer/Associate (for practice)
Lecturer/Associate (for OTC)
ESPB 6.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 application. Teaching students the algorithms and corresponding data structures used for searching and sorting and their implementation in a particular programming language
The outcome This course should learn the student to implement the linear and nonlinear data structures as well as the algorithms that use them in typical applications. In addition, the student should also be able for program implementation of searching and sorting algrithms and for solving of the pratical problems.
Contents
Contents of lectures Linear data structures. Arrays. Lists. Stacks. Queues. Non-linear data structures. Binary trees. Graphs: representation and algorithms. Searching. Basic searching methods and improvements. Binary search tree, AVL trees, m - ary search tree. B, B*, and B + trees. Hashing – hash functions and collision resolving. External hashing. Sorting. Insertion, selection, exchange and merge methods.
Contents of exercises The same as theoretical. The accent is on implementation.
Literature
1. Algorithms and Data Structures, Milo Tomasevic, Academic mind, 2010.
2. Introduction to Algorithms,Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, MIT Press, 2009. (Original title)
Number of hours per week during the semester/trimester/year
Lectures Exercises OTC Study and Research Other classes
3 2
Methods of teaching auditory class lessons and exercises with presentations
Knowledge score (maximum points 100)
Pre obligations Points Final exam Points
Activites during lectures 0 Test paper 70
Practical lessons 0 Oral examination 0
Projects
Colloquia 30
Seminars 0