The course identifies and elaborates the most important data structures being used in modern programming, presenting each of them with exercises.

None.

Fundamentals of Data Structures

Concept of data types

Primitive composite Data types

Arrays Representation of Arrays

Stacks: Definition, Operations on stack implementation, Applications of stack

Recursion

Queues: Definition, Operations on queue , Implementation, , Applications of queue

Circular queue

Dqueu

Sparse matrix

Expression Evaluation

Infix to postfix

Postfix Evaluation

Linked List: Definition, Operations , Implementation Applications of list

Doubly linked list

Linked stack

linked queue

Searching: Introduction, Sequential search, Binary search.

Sorting: Introduction, Sorting methods

Bubble sort

Selection sort

Insertion sort

Merge sort

Quick sort

Shell sort

Heap sort

Efficiency of sorting methods

Hashing: Introduction , Advantages and applications

Hash table

Hash functions

Collision resolution

Trees: Definition and Axioms

Tree traversal

Spanning Trees

Minimum spanning trees

Binary search tree

Avl tree

B-Tree

PROJECT : Development of a Scientific Application Using C and the Algorithms covered in the course