Introduction: Basic Terminology, Types and application of Data
Structures, Algorithm, Efficiency of an algorithm, Time-space trade-off 1 Write a Program to implement addition and multiplication of two 2D arrays and complexity, asymptotic notation. Array: Single and Multidimensional Arrays, Representation of Arrays: 2 Write a program to implement Linear search and binary Search Row Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D, and multi-D Array, Application of arrays, Sparse Matrices, and their representations, arithmetic operations on 3 Write a program to implement Insertion Sorting matrices. Recursion: Tail recursion, Head Recursion, Nested recursion, Removal of recursion. Problem solving using iteration and recursion with 4 Write a program to implement Bubble Sorting examples such as Fibonacci numbers, and Hanoi towers. Trade-offs between iteration and recursion. 5 Write a Program to implement Singly Linked List Searching & Sorting: Linear search, Binary Search, Indexed Sequential search, Hashing, Insertion Sort, Bubble sort, Selection sort, Quick Sort, Merge Sort. 6 Write a Program to implement stack using array Linked lists: Introduction, Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Eclipse/NetBeans/ Active Traversal, Reversing, Application of Linked List: Polynomial 7 Write a program to implement stack using linked list internet connection for Representation, Addition and Multiplication, Generalized Linked online complier List.Stack: Introduction, Abstract Data Type, Primitive Stack 8 Write a program to implement queue using array operations: Push & Pop, Array and Linked List Implementation of Stack, Application of Stack: Prefix and Postfix Expressions, Evaluation of postfix expression. 9 Write a program to implement queue using linked list Queue: Introduction, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues, Double Ended queue, and Priority Queue. 10 Write a program to implement circular queue using array Trees: Binary Tree and Its array and linked list representation, Strict Binary Tree, Complete Binary Tree, Tree Traversal algorithms: In- 11 Write a program to implement circular queue using linked list order, Pre-order, and Post-order, level order, Constructing Binary Tree from given Tree Traversal, BST Operation: Searching, Insertion, Deletion, Threaded Binary Trees, Traversals in Threaded Binary Trees, 12 Write a program to implement binary search tree using linked list Heaps, Heap Sort. Graph: Introduction to graph, Concepts, and representation. 13 Write a program to convert Infix to Prefix and postfix representation of an expression