CONTENTS

Preface

1.  FUNDAMENTALS OF DATA REPRESENTATION

1.1  Basic Concepts of Data Representation

1.2  Data Type

1.3  Data Abstraction and Abstract Data Types

1.4  System-defined Data Type

1.5  Primitive Data Structures and Their Representation

Exercises

2.  FUNDAMENTALS OF DATA STRUCTURES—BASIC CONCEPTS

2.1  Introduction to Data Structure

2.2  Algorithm for Data Structure

2.3  Notation for Algorithm

2.4  Modularisation to Algorithm Design

2.5  Analysis of Algorithms

2.6  Structured Programming

Exercises

3.  ARRAYS

3.1  Linear Arrays

3.2  Arrays in C

3.3  Initializing Arrays

3.4  Insertion and Deletion

3.5  Multidimensional Arrays

3.6  Row-major and Column-major Order

Exercises

4.  STRING PROCESSING AND PATTERN MATCHING

4.1  Introduction to String Processing

4.2  String Representation

4.3  String Manipulation

4.4  Pattern Matching

4.5  The Brute-Force Algorithm

4.6  Kunth-Morris-Pratt Algorithm

4.7  Boyer-Moore Algorithm

Exercises

5.  POINTERS

5.1  Introduction

5.2  Fundamentals and Defining Pointers

5.3  Type Specifiers and Scalars for Pointers

5.4  Operations Using Pointers

5.5  Passing Pointers to Functions

5.6  Pointers and Arrays, Pointer Arithmetic

5.7  Pointers and Two-dimensional Arrays

5.8  Array of Pointers

5.9  Pointers to Pointers

5.10  Pointers to Functions

5.11  Command the Arguments

Exercises

6.  STACKS AND QUEUES

6.1  Introduction to Stack

6.2  Array Implementation of Stacks

6.3  Application of Stack

6.4  Introduction to Queue

6.5  Queue Implementation Using Arrays

Exercises

7.  RECURSION

7.1  Basic Concepts of Recursion

7.2  Recursion Implementation

7.3  The Tower of Hanoi

7.4  Time and Space Requirements

7.5  Recursion vs Iteration

7.6  Examples

7.7  Cost of Recursion

Exercises

8. LISTS

8.1  Sequential Lists

8.2  Linked Lists

8.3  List Implementations

8.4  Application of Linked List (Array Based Implementation)

8.5  Pointer Based Implementation of Linked Lists

8.6  Application of Linked List (Pointer Based Implementation)

Exercises

9.  LINKED LISTS—VARIANTS

9.1  Linked Stacks

9.2  Linked Queues

9.3  Variants of Linked Lists

9.4  Applications of Linked Lists

Exercises

10.  SORTING

10.1  Introduction

10.2  Sorting Techniques

10.3  Sorting on Multiple Keys

Exercises

11.  SEARCHING

11.1  Introduction

11.2  Sequential Search

11.3  Binary Search

11.4  Indexed Sequential Search

11.5  Hashing Schemes

Exercises

12.  TREES

12.1  Fundamental Terminologies

12.2  Binary Trees

12.3  Traversals of Binary Tree

12.4  Threaded Binary Tree

12.5  Binary Search Trees

12.6  AVL Trees

12.7  B-Trees

Exercises

13.  GRAPHS

13.1  Introduction

13.2  Graph Fundamentals

13.3  Graph Representation

13.4  Graph Traversal

Exercises

      INDEX