Department of Mathematics | University of Patras


Data Structures
Description

Algorithms and Data Structures. The notions of time and space complexity of an algorithm. Dynamic data structures: Stacks, Queues, Lists, Trees (2-3 trees, AVL trees). Fundamental operations on data structures. Basic algorithms for the sorting problem: Mergesort, Heapsort, Quicksort. The UNION-FIND problem and its application in finding a minimal spanning tree of a graph.

Division: Computational Mathematics and Informatics
Instructors:

Program of Studies:
Undergraduate Studies
Semester: G
ECTS: 6
Hours per week (Lec/Tut/L): 2/2/0
Code: IC336
Course type: Elective
Compulsory course for the specialization
"Informatics and Computational Mathematics"
Erasmus students: No




keyboard_arrow_up