Theme Options

NEWSLETTER

Data Structure Using C

BI 1164

New

According to New Revised Syllabus w.e.f. 2009 PUNE, Maharashtra (INDIA)


Text Book of Data Structures using C

BCA (Pune) Sem-III

Author : Mohite, Sattikar and Pawar

Book ID : 1164

More details

Rs.189

Rs.210

-10%

Contents

1. Basic Concept in Data Structure

1.1Pointers- An Introduction1
1.2Dynamic Memory Allocation4
1.3Algorithm Analysis12
1.4Abstract Data Type: An Introduction14
24
21
ARRAYS AND STRUCTURE1
2.1Array1
2.2Array – As an Abstract Data Type8
2.3Introduction to Searching10
2.4 Applications of Array17
2.5Structure19
24
31
STACK AND QUEUE1
3.1STACK1
3.2Representing Stacks in C3
3.3Infix, Prefix, and Postfix Expressions8
3.4 Queue12
3.5 Priority queue19
3.6Circular Queue21
10
41
SORTING1
4.1 Introduction1
4.2 Sorting Techniques2
22
51
LINKED LIST1
5.1Introduction1
5.2Linked Lists3
5.3Creating a list4
5.4 Operations on the list6
5.5 Circular Linked list11
5.6Doubly-Linked list13
5.7 Stack as a Linked List16
5.8 Queue as a Linked List18
22
61
TREE1
6.1INTRODUCTION1
6.2 Tree as graphs1
6.3 Binary Tree1
6.4 Insertion5
6.5Deletion7
6.6Traversing a Binary Tree10
6.7Iterative traversing13
6.8 Binary Search15
6.9AVL Trees19
6.10 HEAP20
6
71
HASHING1
7.1HASHING AN Introduction1
7.2 HASH Table2
7.3HASH Function2
7.4 Collisions3
12
81
graphs1
8.1graphs1
8.2Adjacency List Implementation (non-directed graph)5
8.3 Adjacency List Implementation (directed graph)5
8.4Shortest Path problem6
8.5Spanning tree7
8.6Traversal of graphs8
8.7 Depth-first search (DFS)8
8.8breadth-first search (BFS)10

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

No customer comments for the moment.

Write a review

Write a review

20 other products

20 other products in the same category:

Customers who bought this product also bought: