|
Week
|
Topics
|
Study Metarials
|
|
1
|
Classification of data structures and data models and their basic properties
|
K1-Chapter-2
|
|
2
|
Summarizing data models: linked list, trees, graphs, state machine data models
|
K2-Chapter-8, K2-Chapter-9, K2-Chapter-10
|
|
3
|
State machine data model and sample applications
|
K2-Chapter-14
|
|
4
|
Word search and application in the text with the state machine. Development of state machine application in a programming language
|
K2-Chapter-14
|
|
5
|
Introduction to graph theory and representation of graphs: Neighborhood matrix
|
K2-Chapter-12
|
|
6
|
Graph types and retention of graphs; sample applications
|
K2-Chapter-12
|
|
7
|
The examination of problems such as graf coloration, shortest path algorithm, path tree
|
K2-Chapter-12
|
|
8
|
Graf coloring and solving the problem of assignment assignment without overlap
|
K2-Chapter-12
|
|
9
|
Shortest path algorithms: Dijkstra algorithm behavior, implementation and application of Dijkstra algorithm on the map
|
K1-Chapter-2
|
|
10
|
Shortest path tree algorithms: Analysis and application of Kruskla algorithm
|
K1-Chapter-2
|
|
11
|
Calculation of execution time and complexity of algorithms. Big O notation
|
K3-Chapter-2
|
|
12
|
Compression algorithms and programs
|
K2-Chapter-15
|
|
13
|
Huffman coding tree and sample application: Frequency of characters usage and Huffman tree creation
|
K3-Chapter-4
|
|
14
|
Application development and grammar analysis algorithms on Probability Theory
|
K3-Chapter-4
|