Data Structures Through C in Dept by S K Srivastava and Deepali Srivastava
Contents of Data Structures Through C in Dept
- BASICS Overview
- Characteristics of a Data Structure
- Need for Data Structure
- Execution Time Cases
- Basic Terminology
- Environment Setup
- Try it Option Online
- Local Environment
- Setup
- Installation on
- UNIX/Linux
- Installation on Mac
- OS
- Installation on Windows
- ALGORITHM Algorithms ─ Basics
- Characteristics of an Algorithm
- How to Write an Algorithm?
- Algorithm
- Analysis
- Algorithm
- Complexity
- Space Complexity
- Time
- Complexity
- Asymptotic
- Analysis Asymptotic
- Notations
- Common Asymptotic Notations
- Greedy Algorithms
- Counting
- Coins
- Divide & Conquer
- Divide/Break
- Conquer/Solve
- Merge/Combine
- Dynamic
- Programming iii
- DATA STRUCTURES
- Basic Concepts
- Data Definition
- Data Object
- Data Type
- Basic Operations
- Arrays
- Array Representation
- Basic Operations
- Insertion Operation
- Array Insertions
- Insertion at the Beginning of an Array
- Insertion at the Given Index of an Array
- Insertion After the Given Index of an Array
- Insertion Before the Given Index of an
- Array Deletion
- Operation Search
- Operation Update
- Operation LINKED
- LIST Linked List ─
- Basics Linked List Representation
- Types of Linked List
- Basic Operations
- Insertion Operation
- Deletion Operation
- Reverse Operation
- Linked List Program in C
- Doubly Linked List
- Doubly Linked List Representation
- Basic Operations
- Insertion Operation
- Deletion Operation
- Insertion at the End of an Operation
- Doubly Linked List Program in C
- Circular Linked List
- Singly Linked List as Circular
- Doubly Linked List as Circular
- Basic Operations
- Insertion Operation
- Deletion Operation
- Display List Operation
- Circular Linked List Program in C
- STACK & QUEUE
- Stack
- Stack Representation
- Basic Operations
- peek
- isfull
- isempty
- Push
- Operation
- Pop Operation
- Stack Program in C
- Expression Parsing
- Infix
- Notation
- Prefix Notation
- Postfix
- Notation
- Parsing Expressions
- Postfix Evaluation Algorithm
- Expression Parsing Using
- Stack Queue
- Queue Representation
- Basic Operations
- Enqueue Operation
- Dequeue Operation
- Queue Program in C
- SEARCHING
- TECHNIQUES Linear Search
- Linear Search Program in C
- Binary Search
- How Binary Search Works?
- Binary Search Program in C
- Interpolation Search
- Positioning in Binary Search
- Position Probing in Interpolation
- Search
- Interpolation Search Program in C
- Hash Table
- Hashing
- Linear Probing
- Basic Operations
- Data Item
- Hash Method
- Search
- Operation
- Insert Operation
- Delete Operation
- Hash Table Program in C
- SORTING
- TECHNIQUES
- Sorting
- Algorithm
- In-place Sorting and Not-in-place Sorting
- Stable and Not Stable
- Sorting
- Adaptive and Non-Adaptive Sorting Algorithm
- Important Terms
- Bubble Sort Algorithm
- How Bubble Sort Works?
- Bubble Sort Program in C
- Insertion Sort
- How Insertion Sort Works?
- Insertion Sort Program in C
- Selection
- Sort How Selection Sort Works?
- Selection Sort Program in C
- Merge Sort Algorithm
- How Merge Sort Works?
- Merge Sort Program in C
- Shell Sort
- How Shell Sort Works?
- Shell Sort Program in C
- Quick Sort
- Partition in Quick Sort
- Quick Sort Pivot Algorithm
- Quick Sort Pivot Pseudocode
- Quick Sort Algorithm
- Quick Sort
- Pseudocode
- Quick Sort Program in C
- GRAPH DATA STRUCTURE
- Graphs
- Graph Data Structure
- Basic Operations
- Depth First
- Traversal Depth First Traversal in C
- Breadth First
- Traversal Breadth First Traversal in C
- TREE DATA STRUCTURE
- Tree
- Important Terms
- Binary Search Tree Representation
- Tree Node
- BST Basic Operations
- Insert Operation
- Search Operation
- Tree Traversal in C
- Tree Traversal
- In-order Traversal
- Pre-order
- Traversal
- Post-order Traversal
- Tree Traversal in C
- Binary Search Tree
- Representation
- Basic Operations
- Node
- Search
- Operation
- Insert Operation
- AVL Trees
- AVL Rotations
- Spanning Tree
- General Properties of Spanning Tree
- Mathematical Properties of Spanning
- Tree
- Application of Spanning Tree
- Minimum Spanning Tree (MST)
- Minimum Spanning-Tree Algorithm
- Kruskal’s Spanning Tree
- Algorithm
- Prim’s Spanning Tree Algorithm
- Heaps Max Heap Construction Algorithm
- Max Heap Deletion Algorithm
- RECURSION vii
- Recursion ─
- Basics
- Properties
- Implementation
- Analysis of Recursion
- Time
- Complexity
- Space Complexity
- Tower of Hanoi
- Rules
- Algorithm
- Tower of Hanoi in C
- Fibonacci Series
- Fibonacci Iterative Algorithm
- Fibonacci Interactive Program in C
- Fibonacci Recursive Algorithm
