* - Remember (R), Understand (U), Apply (Ap), Analyse (An), Evaluate (E), Create (C) # - Factual Knowledge(F) Conceptual Knowledge (C) Procedural Knowledge (P) Metacognitive Knowledge (M) Detailed Syllabus Page 50 of 241 Module Unit Content Hrs (45+30) Marks I Introduction to Data Structures and Basic Algorithms 9 15 1 Overview of Data Structures: Data type Vs. Data structure, ADT, Definition of Data structure, Data structure Classification – Linear, Non Linear (Array, Linked List, Stack, Queue, Tree, Graph) 1 2 Introduction to Arrays:
Definition, Types (1 Dimensional, 2 Dimensional, Multi-Dimensional, Sparse matrix), Different Array Operations with Algorithm (insertion, deletion, traversal) 3 3 Structures and Self-referential structures 1 4 Introduction to Linked list: Definition, Types (Single linked list, Double linked list, Circular linked list- concept only). 2 5 Singly Linked List Operations with Algorithm (insertion, deletion, traversal) 2 II Stack and Queue 10 20 6 Introduction to Stack: Definition, stack operations with Algorithm, Applications: recursion, infix to postfix - example and Algorithm 3 7 Implementation of Stack:
using array (overflow & underflow) and Linked list (with algorithm) 2 8 Introduction to Queue: Definition, queue operations with Algorithm, Types: Double ended queue (Input Restricted and Output restricted), Circular queue, Applications 2 9 Implementation of Queue: using array and Linked list (with algorithm) 3 III Non- Linear Data Structures 16 20 10 Introduction to Trees: Basic terminology, Types (Binary tree- complete, full, skewed etc., Expression Tree) 2 11 Properties of Binary tree, Applications.
2 12 Binary tree representations- using array and linked list 2 13 Operations on Binary tree- Insertion, Deletion, Traversal- inorder, preorder, postorder - (concepts with examples) 3 14 Algorithm of non-recursive Binary tree traversal 3 15 Introduction to Graph: Definition, Basic terminology, Types (Directed, Undirected, Weighted). 2 16 Graph representation –Adjacency list and Adjacency Matrix, Applications. 2 IV Sorting and Searching 10 15 17 Introduction to Sorting: Definition, Classification (Internal, External) 1 18 Internal Sorting Algorithms: Selection sort- Selection sort algorithm, Exchange sort- Bubble sort algorithm 2 19 External Sorting Algorithms:
Merge sort- Demonstrate with example (No Algorithm needed) 1