Index
Data Structure Concept
- Definition
- Algorithm and Sub-Algorithm
- Difference between Algorithm and sub-Algorithm
- Algorithmic conventions, Controls used in Algorithm
- Qualities and Capabilities of Good Algorithm
- Computational Complexity of Algorithm
- Time Complexity
- Asymptotic Notation, Big-O Notation
- Worst and Average case behavior
- Examples on Big-O Notation
- Data, Data Types, Operations on Data Structure
Abstract Data Types
- Abstract Data Type (ADT)
- ADT of Rational Number
- ADT of varying length character string
- ADT of Array, Stack, Queue
Array (One Dimension)
- Array (Definition)
- Location of any (Kth) element in Linear Array
- Problems to find length of array and location of array element in one dimensional array
- Traverse a linear array (Algorithm)
- Algorithms on array
- Insert an ITEM into a linear array (Algorithm)
- Delete an element from a linear array (Algorithm)
- Searching in Linear Array: Linear, Binary
Array (Two Dimension)
- Representation of Two Dim. Array in Memory
- Finding location of element in a 2D array
- Problems to find length & Location of array
- Pointer array
- Sparse Matrix, Transpose of Sparse Matrix
String
- String
- Operations on String
Stack
- Array representation of Stack
- PUSH an ITEM into a stack (Algorithm)
- POP an ITEM from a stack (Algorithm)
- Polish Notation
- Problems on Convert infix expression to equivalent postfix and prefix expressions
- Evaluation of Postfix Expression (Algorithm)
- Transforming Infix expression into Postfix (Algo.)
Recursion
- Recursion (Definition)
- Factorial Function using Recursion (Algorithm)
- Fibonacci Function using Recursion (Algorithm)
- Problems on Fibonacci function
- GCD Function using Recursion (Algorithm)
- Tower of Hanoi using Recursion (Algorithm)
- Ackermann Function
- Problems on Ackermann function
Queue
- Queue, Representation of Queue in Memory
- Insert an ITEM in queue (Algorithm)
- Delete an element from queue (Algorithm)
- DEQUE, Priority Queue
- Array representation of Priority Queue
- Josephus Problem
- Difference between stack and queue
Linked List
- Linked List (Definition)
- Representation of Linked List in Memory
- Traversing a Linked List (Algorithm)
- Searching in Unsorted Linked List (Algorithm)
- Searching in Sorted Linked List (Algorithm)
- Memory Allocation: Garbage Collection
- Overflow and Underflow in Linked List
- Insertion (beginning) into a Linked List (Algorithm)
- Insertion (at the end) into a Linked List (Algo.)
- Insertion (after given node) into a LL (Algo.)
- Deletion of node following given node in LL (Algo.)
- Deletion of node with a given ITEM of information in a linked list (Algorithm)
- Header linked list, Two-way Lists
- Comparison between one-way list and two-way list
- Representing Polynomial using linked list
- Difference between array and linked list
- Buddy System
Tree
- Tree, Binary Tree , Tree Terminology
- Complete Binary Tree
- Extended Binary Tree (2-Tree)
- Representation of Binary Tree in Memory
- Traversing Binary Tree
- Traverse a Tree in Preorder (Algorithm)
- Traverse a Tree in In-order (Algorithm)
- Traverse a Tree in Post-order (Algorithm)
- Problems on Tree Traversal
- Header node in Binary Tree
- Threads
- Binary Search Tree
- Search an ITEM in Binary Tree (Algorithm)
- Insert an ITEM in Binary Tree (Algorithm)
- Huffman Tree and Huffman Algorithm
- AVL Tree, Multi-Way search tree
Heap
- Heap
- Insert new ITEM in Heap (Algorithm)
- Delete an ITEM from Heap (Algorithm)
Graph
- Graph, Sequential/ Matrix representation of Graph
- Linked/ Multi-list representation of Graph
- Graph Traversal
- Breadth-First search (Example & Algo)
- Depth-First search (Example & Algo)
- Spanning Tree
- Difference between tree and graph
Hashing
- Hashing, Hash table, Hash functions
- Examples on Hash function
- Collision
Sorting in Array
- Sorting methods
- Bubble Sort (Algorithm)
- Insertion Sort (Example and Algorithm)
- Selection Sort (Example and Algorithm)
- Heap Sort, Building a Heap, Problem
- Merge Sort (Example and Algorithm)
- Quick Sort, Problem
- Shell Sort, Problem
- Radix Soft
- Comparing Complexity in various Sorting Methods
- Programs (64 Programs in C & C++)
- Question Bank
- Viva Questions