* - 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 100 of 241 Modul e Unit Content Hrs (45+30) Marks I Introduction to Data Structures and Analysis of Quality of an Algorithm 9 12 1 Data structure - definition - types & operations, characteristics of data structures 2 2 Abstract Data Type (ADT) – algorithms - concepts - definition - objectives of algorithms - 1 3 Quality of an algorithm - space complexity and time complexity of an algorithm. 2 4 Growth of Functions:
Asymptotic notations, Cost estimation based on key operations- Big Oh, Big Omega, Little Oh, Little Omega and Theta notations 3 5 Algorithm Design:
Introduction, Steps in developing algorithm, Methods of specifying an algorithm 1 II Basic Technique for Design of Efficient Algorithm 11 15 6 Brute Force approach (String pattern matching) 1 7 Divide-and-Conquer approach (Merge sort) 1 8 Branch-and-Bound technique (Knapsack problem) 2 9 Greedy approach (Kruskal's algorithm and Prim's Algorithm) 3 10 Dynamic Programming (Longest Common Subsequence) 2 11 Backtracking (Sum of subsets problem) 2 III Linked lists - operations and implementations 12 15 12 Introduction to Singly Linked list and its operations 2 13 Circular Linked list and its operations 3 14 Doubly Linked list and its operations 2 15 Circular Doubly Linked list and its operations 2 16 Recursive lists, heterogeneous lists, deterministic skip lists- Creation & Searching 3 IV Non-linear Data Structures 13 20 17 Binary search trees - traversals and operations on BST 3 18 AVL tree, Red Black Tree (concept only) 2 19 Balanced trees - M-way trees - B Tree (Concepts only) 1 20 Graphs - representation of graphs 1 21 Graphs- operations - traversals and their implementation.
2 22 Heap structures- Min-Max heaps - Deaps - leftist heaps - binomial heaps (concepts only) - Applications 3 V Practical Implementations of Data Structures and its Operations in Java or C Programming Language 30 20 1 ● Implementation of linear linked list ● Implementation of circular linked list ● Implementation of doubly linked list ● Implementation of BST operations ● Implementation of Depth First Search using graph ● Implementation of Breadth First Search using graph 25