Data Structure - Syllabus ¹

About Cycles ²

Cycle 1 ³

01 - Implementation of Linear Search

02 - Implementation of Binary Search

03 - Implementation of Sparse Matrix

04 - Implementation of Polynomial Addition

05 - Implementation of Stack

06 - Implementation of Queue

07 - Infix to Postfix Conversion

08 - Evaluation of postfix Expression

09 - Circular Queue

Cycle 2 ⁴

Linked List

10 - Stack using Linked List

11 - Queue using Linked List

12 - Priority Queue using Linked List

13 - Singly Linked List

14 - Circular Linked List

15 - Doubly Linked List

16 - Polynomial Addition using Linked List

Tree and Graph

17 - Binary Seach Tree

18 - BFS (Breath First Search) and DFS (Depth First Search) of Graph Traversal

Cycle 3 ⁵

Sorting

19 - Bubble Sort

20 - Selection Sort

21 - Insertion Sort

22 - Quick Sort

23 - Merge Sort

24 - Heap Sort

Hashing

25 - Linear Probing

26 - Separate Chaining

Footnotes

1. Syllabus as per 2019 Scheme, found on KTU website. ↩

2. KTU Syllabus doesn't specify any Cycle, this method of splitting the programs into three sections is for better understanding. ↩

3. Some basics. ↩

4. Familiarisation with Linked Lists, Graphs and Tree. ↩

5. Sorting Methods and Hashing. ↩