Data Structures

The course contains the following: 1. Introduction to Data Structures. Necessity-Usefulness. 2. Arrays. 3. Stacks (Static and Dynamic). 4. Queues (Static and Dynamic). 5. Lists and Priority Queues. 6. Linked Lists, singly and doubly linked. 7. Trees. Binary Search Trees. 8. Red and Black Trees. 2-3-4 Trees. 9. Hash Tables. 10. Heaps. 11. Graphs. 12. Sorting Algorithms. 13. Summary and comparison of the Data Structures.

Objectives

When the student has successfully completed the course will be able to: 1. Describe the data structures (DD) used. 2. assess the possibilities (pros-limitations) specific DD 3. Examine each problem in relation to the available DD 4. To plan the appropriate DD in each case. 5. creates-implements the selected DD in C programming language 6. To compare and evaluate the performance of DD

Prerequisites

No prerequisites

Syllabus

• Basic data types • More Indicators • Memory Management • Paintings • Stacks • Queues • Single linked lists • Double linked lists • Retroactivity • Sort • Binary search trees (ICN)