Subject Area | Applications and Foundations of Computer Science |
---|---|
Semester | Semester 3 – Fall |
Type | Required |
Teaching Hours | 4 |
ECTS | 6 |
Recommended Courses | |
Course Site | http://eclass.uth.gr |
Course Director |
|
Course Instructors |
|
Scientific Responsible |
|
---|---|
Title | MLSysOps: Machine Learning for Autonomic System Operation in the Heterogeneous Edge-Cloud Continuum |
Duration | 2023 – 2025 |
Site | https://csl.e-ce.uth.gr/projects/mlsysops |
Department of Electrical and Computer Engineering | |
---|---|
| |
Tel. | +30 24210 74967, +30 24210 74934 |
gece ΑΤ e-ce.uth.gr | |
PGS Tel. | +30 24210 74933 |
PGS e-mail | pgsec ΑΤ e-ce.uth.gr |
URL | https://www.e-ce.uth.gr/contact-info/?lang=en |
Subject Area | Applications and Foundations of Computer Science |
---|---|
Semester | Semester 3 – Fall |
Type | Required |
Teaching Hours | 4 |
ECTS | 6 |
Recommended Courses | |
Course Site | http://eclass.uth.gr |
Course Director |
|
Course Instructors |
|
The course provides the students an introduction to the basic data structures, sorting and searching techniques. The following topics are covered: Review of asymptotic estimations, worst case and average case performance; Basic Data Structures like Arrays, Lists, Stacks, FIFOs, Dequeues, Static and Dynamic Trees and their Traversals; Binary Search and Introduction and Αnalysis of Comparison-based sorting algorithms (i.e., Insertion Sort, Selection Sort, Bubble Sort, Shaker Sort, Quick sort, Heap Sort, Merge Sort) and Distribution-based Sorting Algorithms (i.e., Bucket Sort, LSD and MSDRadix Sort); Selection and Order Statistics; Ordered Dictionaries, like Simple, Balanced Search Trees (AVL Trees, (a, b)-Trees, Red-Black Trees) and Digital Trees (Trie, PATRICIA Trees); Union-Find in Disjoint Sets; Introduction to Hashing and Unordered Dictionaries like Hashing with Chaining, Hashing with Open Addressing, Rehashing,and Extendible Hashing; Skip Trees, Splay Trees, Treaps; Heaps (Binomial, Fibonacci).
The course introduces to the basic concepts of data structuring and efficient data storage and manipulation. Aims at introducing to the right usage and application of fundamentals data structures and sorting algorithms. The lectures are based on reading material and applets that demonstrate and explain the use of the various data structure and sorting algorithms.
Upon successful completion of this course, the student will be able to: