Introduction to the logical organization and memory representation of linear and nonlinear data
\nstructures, basic operations and typical applications of these structures. Students are trained to
\nimplement linear and nonlinear data structures, as well as algorithms in typical applications such as
\nsearching and sorting.<\/p>\n
<\/p>\n
Linear structures. Arrays. List. Stacks. Queues. Nonlinear structures. Trees: binary trees, tree tour, path
\nlength minimization. Graphs. Representation, Depth first search and Breadth first search, determining
\narticulation points of a connected graph, determination of graph bridges, separation of doubly connected
\ncomponents, separation of components of strong connectivity. Determination of topological order and
\ncritical path, spanning trees and minimum spanning trees, determination of shortest distances.
\nSearching. Basic method and improvements. Binary search tree, AVL tree, optimal tree. M-ary search
\ntree. B, B* and B+ trees, digital search trees. Hashing. Hash functions, collision resolution, external
\nhashing. Sorting. Sort by comparison – methods of insertion, selection, substitution, methods of linear
\ncomplexity. Time complexity sorting algorithms O (N log N). Lower limit of sorting complexity.<\/p>\n
<\/p>\n
Implementation of some structures presented in the lectures: linked lists, stack, queue, binary tree,
\npriority queue, binary search tree, AVL tree, B tree, hash tables. Implementation of sorting algorithms.
\nDesign and analysis of algorithms for various algorithmic problems with the application of data structures
\nand algorithms presented in lectures (during the analysis, special emphasis should be places on the
\nestimation of the worst case, as well as on the average case).<\/p>\n","protected":false},"excerpt":{"rendered":"
Objectives and outcomes Introduction to the logical organization and memory representation of linear and nonlinear data structures, basic operations and typical applications of these structures. Students are trained to implement linear and nonlinear data structures, … Read more<\/a><\/p>\n Read more<\/a>","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[199],"tags":[],"class_list":["post-13767","post","type-post","status-publish","format-standard","hentry","category-subjects"],"acf":[],"yoast_head":"\n