1: الخطة التدريسية

know the basic concepts of DS.
2- Category DS into statics and dynamic.
3- Indicate the differences between linear and non-linear DS, and between static and dynamic DS.

4- Apply arrays DS with examples.

5- Know what are the stings and the operations applied with, methods of representing the string.

6- Explain what are pointers and references.

7- Study the singly linked list.

8- Study stack DS and implement it with arrays and linked list .

9- Implement the queue DS with arrays and linked list .

10- Explain the concepts of circular and priority queue.

11- Indicate what are circular and double linked list DS.

12- Study tree DS.

13- Take example of binary tree.

14- What is graph and how implementing it.
أهداف المادة:
Course overview: Basic Concept of DS, Abstruct DS, arrays and strings, Stacks & queues, Circular queue, Priority queues, singly Linked lists, circular and double linked list, trees and Binary search trees, graph.