Items list

Subject Code: IC336
ECTS: 6
Study Program: Undergraduate Degree Program
Teaching Semester: Semester 7
Type
Επιλογής
Κατεύθυνση ΓΝΜ: Βασικό
Κατεύθυνση ΘΡΜ: Ελεύθερης Επιλογής
Κατεύθυνση ΕΦΜ: Ελεύθερης Επιλογής
Κατεύθυνση ΠΛΗ: Υποχρεωτικό Κατεύθυνσης
Κατεύθυνση ΣΠΕ: Ελεύθερης Επιλογής
Teaching Hours (Theory / Tutorial / Laboratory): 2-0-2
Erasmus Students: No
Description
Introduction: the concept of algorithm and data structure. Basic characteristics of an algorithm. Arrays as a data structure. Sparse arrays. Abstract data types. Definition of the time and space complexity of an algorithm. Dynamic data structures: stacks, queues, types of linked lists (ordered, singly or doubly linked, circular), trees. Basic operations in dynamic data structures. Access procedures (searching) in a data structure. 2-3 trees and AVL trees. Algorithms for the problem of sorting sequences (sorting): Mergesort, Heapsort, Qiucksort. The UNION-FIND problem and its application to finding a minimum factor tree in a graph.