Data Structure syllabus
| 1 | Introduction of Data structure |
| 2 | Revision of if-else statement |
| 3 | loop control structure |
| 4 | switch case statement |
| 5 | function in c |
| 6 | array in c |
| 7 | string in c |
| 8 | Pointer in c |
| 9 | Structure in c |
| 10 | Introduction of Linked list |
| 11 | Advantage of Linked list over Array |
| 12 | Single Linked List |
| 13 | Doubly Linked List |
| 14 | circular Linked List |
| 15 | Introduction of Stack |
| 16 | Infix to Postfix conversion |
| 17 | Infix to prefix conversion |
| 18 | Postfix to infix conversion |
| 19 | Prefix to infix conversion |
| 20 | Postfix evaluation |
| 21 | Introduction of Queue |
| 22 | Circular queue |
| 23 | Priority Queue |
| 24 | Introduction of sorting |
| 25 | Selection sorting |
| 26 | Insertion sorting |
| 27 | Bubble sorting |
| 28 | Merge sorting |
| 29 | Quick sorting |
| 30 | Radix sorting |
| 31 | Linear searching |
| 32 | Binary searching |
| 33 | Introduction of Tree |
| 34 | Types of Tree |
| 35 | Binary search tree |
| 36 | Binary Tree |
| 37 | AVL Tree |
| 38 | m way tree |
| 39 | different types of traversal in Tree |
| 40 | Introduction of graph |
| 41 | Depth in first search in graph |
| 42 | Breadth first search in graph |
