Algorithms and Data Structures

Basic concepts of algorithms, basic algorithmic structures Analysis algorithms (algorithms performance, accuracy algorithms, complexity of algorithms). Basic concepts tables storage tables tables for specific forms Recursion Search, sequential search, binary search Sort, rank by direct selection, classification of direct import, bubble sort, quick sort Linear lists, serial lists (stack, queue) Linked lists (simple linked list, stack as a linked list, queue as a linked list) Trees, binary trees, binary tree traversal methods (predisposed method endodiatetagmeni method metadiatetagmeni method) B-trees, Tries Graphs, graph representation methods, graph traversal methods (search by Depth priority, search priority width), the problem of the shortest path Hash tables, conflicts, open addressing, separate connection

Objectives

To equip students with the necessary theoretical and practical background for understanding Ms. handling simple and complex data structures, familiarizing and using known algorithms and developing new algorithms suitable for solving problems with PC.

Prerequisites

No

Syllabus

Basic concepts of algorithms, basic algorithmic structures Analysis algorithms (algorithms performance, accuracy algorithms, complexity of algorithms). Basic concepts tables storage tables tables for specific forms Recursion Search, sequential search, binary search Sort, rank by direct selection, classification of direct import, bubble sort, quick sort Linear lists, serial lists (stack, queue) Linked lists (simple linked list, stack as a linked list, queue as a linked list) Trees, binary trees, binary tree traversal methods (predisposed method endodiatetagmeni method metadiatetagmeni method) B-trees, Tries Graphs, graph representation methods, graph traversal methods (search by Depth priority, search priority width), the problem of the shortest path Hash tables, conflicts, open addressing, separate connection