Contents

1. Basic Concept in Data Structure

1.1 Pointers – an introduction

1.2 Dynamic memory allocation

1.3 Algorithm analysis

1.4Abstract data type: An introduction

2. Arrays and Structure 

2.1 Array

2.2 Array – as an abstract data type

2.3 Introduction to searching

2.4Applications of array

2.5 Structure

3. Stack and Queue 

3.1 Stack

3.2 Representing stacks in C

3.3Infix, prefix, and postfix expressions

3.4 Queue

3.5 Priority queue

3.6 Circular queue

4. Sorting 

4.1 Introduction

4.2 Sorting techniques

5. Linked List 

5.1Introduction

5.2 Linked lists

5.3 Creating a list

5.4 Operations on the list

5.5 Circular linked list

5.6 Doubly – linked list

5.7 Stack as a linked list

5.8 Queue as a linked list

6. Tree

6.1 Introduction

6.2 Tree as graphs

6.3 Binary tree

6.4Insertion

6.5 Deletion

6.6 Traversing a binary tree

6.7 Iterative traversing

6.8Binary search

6.9 AVL trees

6.10 Heap

7. Hashing 

7.1Hashing an introduction

7.2 Hash table

7.3Hash function

7.4 Collisions

8. Graphs

8.1 Graphs

8.2Adjacency list implementation (Non-Directed Graph)

8.3 Adjacency list implementation (Directed Graph)

8.4 Shortest path problem

8.5 Spanning tree

8.6 Traversal of graphs

8.7 Depth – first search (DFS)

8.8 Breadth – first search (BFS)

Solved Question Papers – October 2010