Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.
Unit-I
Fundamental Concepts: Introduction to Data Structures, Types of Data Structures, Introduction to Algorithm,Pseudo-code, Flowchart, Analysis of Algorithms.Linear Data Structure Using Arrays: 1-D Arrays, 2-D Arrays, N-D Arrays, Memory Representation and Address Calculation of 1-D, 2-D, N-D Arrays, Concept of Ordered Lists, String Manipulation, Pros and Cons of Arrays. Stacks: Concepts, Primitive Operations, Abstract Data Type, Representation Stacks Using Arrays, Prefix, Infix, Postfix Notations for Arithmetic Expression, Applications of Stacks – Converting Infix Expression to Postfix
Expression, Evaluating the Postfix Expression, Checking Well-formed (Nested) Parenthesis, Processing of Function Calls, Reversing a String.
Unit-II
Recursion: Introduction, Recurrence, Use of Stack in Recursion, Variants of Recursion, Execution of Recursive
Calls, Recursive Functions, Iteration Versus Recursion.
Queues: Concept, Primitive Operations, Abstract Data Type, Representation Queues Using Arrays, Circular
Queue, Double-ended Queue, Applications of Queues.
Linked Lists: Introduction, Concept, Terminology, Primitive Operations – Creating, Inserting, Deleting, Traversing,
Representation of Linked Lists, Linked List Abstract Data Type, Linked List Variants – Singly Linked List, Doubly
Linked List, Linear and Circular Linked List, Representation Stacks and Queues Using Linked Singly Lists,
Application of Linked List – Garbage Collection.
Unit-III
Trees: Introduction, Representation of a General Tree, Binary Tree Introduction, Binary Tree Abstract Data Type,
Implementation of Binary Trees, Binary Tree Traversals – Preorder, Inorder, Postorder Traversals, Applications
of Binary Trees Briefly.
Graphs: Introduction, Graph Abstract Data Type, Representation of Graphs, Graph Traversal – Depth-first
Search, Breadth-first Search, Spanning Tree – Prim’s Algorithm, Kruskal’s Algorithm. Hashing: Introduction, Hash Functions, Collision Resolution Strategies.
Unit-IV
Searching and Sorting: Sequential (Linear) Search, Binary Search, Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort and Comparison fo Sorting Techniques.
Heaps: Concept, Implementation, Abstract Data Type, Heap Sort.
No Preview is available for this book
CategoriesArts and Science
Format EPUB
TypeeBook