1. komponenta

Lecture type	Total
Lectures	30
Exercises	30

* Load is given in academic hour (1 academic hour = 45 minutes)

COURSE AIMS AND OBJECTIVES: Acquiring basic knowledge about abstract data types, and data structures that are used for their implementation. Getting familiar with basic techniques for design and analysis of algorithms.

COURSE DESCRIPTION AND SYLLABUS:
1. Introduction. The notion of type, abstract data type, and data structure. Building blocks of a data structure: arrays, records, pointers, cursors. The notion of algorithm. Specification and analysis of algorithms.
2. Abstract data types. Lists, stacks, queues, ordered trees, binary trees, sets, dictionaries, priority queues, mappings.
3. Data structures (serving for implementation of the considered abstract data types). Linked lists and other linked structures, hash tables, binary search trees, heaps.
4. Basic algorithms (performing basic operations over structures). Insertion and deletion of data, traversal, searching, retrieval of contents, etc.
5. More complex algorithms (that apply the considered structures). Sorting and merging of lists, evaluation of arithmetic expressions, various recursive procedures.
6. General algorithm design techniques. Divide and conquer, dynamic programming, greedy approach, backtracking, local search.

Enrollment :
Passed : Computer programming 2

Mandatory course - Regular study - Mathematics