Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.
SYLLABUS
UNIT-I
Linear Data Structures: Arrays, Stacks and Queues Data Structures – Operations – Abstract Data Types – Complexity of Algorithms – Time and Space – Arrays – Representation of Arrays – Linear Arrays – Insertion – Deletion and Traversal of a Linear Array – Array as an Abstract Data Type – Multi-Dimensional Arrays – Strings – String Operations – Storing Strings – String as an Abstract Data Type. Stack – Array Representation of Stack – Stack Abstract Data Type – Applications of Stacks: Prefix – Infix and Postfix Arithmetic Expressions – Conversion – Evaluation of Postfix Expressions – Recursion – Towers of Hanoi – Queues – Definition – Array Representation of Queue – The Queue Abstract Data Type – Circular Queues – Dequeues – Priority Queues.
UNIT-II
Linked Lists Pointers – Pointer Arrays – Linked Lists – Node Representation – Single Linked List – Traversing and Searching a Single Linked List – Insertion into and Deletion from a Single Linked List – Header Linked Lists – Circularly Linked Lists – Doubly Linked Lists – Linked Stacks and Queues – Polynomials – Polynomial Representation – Sparse Matrices.
UNIT-III
Trees Terminology – Representation of Trees – Binary Trees – Properties of Binary Trees – Binary Tree Representations – Binary Tree Traversal – Preorder – Inorder and Postorder Traversal – Threads – Thread Binary Trees – Balanced Binary Trees – Heaps – Max Heap – Insertion into and Deletion from a Max Heap – Binary Search Trees – Searching – Insertion and Deletion from a Binary Search Tree – Height of Binary Search Tree, m-way Search Trees, B-Trees.
UNIT-IV
Graphs Graph Theory Terminology – Graph Representation – Graph Operations – Depth First Search – Breadth First Search – Connected Components – Spanning Trees – Biconnected Components – Minimum Cost Spanning Trees – Kruskal’s Algorithm – Prism’s Algorithm – Shortest Paths – Transitive Closure – All-Pairs Shortest Path – Warshall’s Algorithm.
UNIT-V
Searching and Sorting Searching – Linear Search – Binary Search – Fibonacci Search – Hashing – Sorting – Definition – Bubble Sort – Insertion Sort – Selection Sort – Quick Sort – Merging – Merge Sort – Iterative and Recursive Merge Sort – Shell Sort – Radix Sort – Heap Sort.
No Preview is available for this book
CategoriesElectrical & Electronics
Format PDF
TypeeBook