Theme Options

NEWSLETTER

Data Structures

BI 1402

New

Data Structures

According to New Revised 'E' Scheme

DOWNLOAD FREE SAMPLE CHAPTER

More details

Rs.171

Rs.190

-10%

Contents

1. Introduction to data structure

1.1 Introduction

1.2 Need for Data Structures

1.3 Data Representation

1.4 Data Types

1.5 Operations on Data Structures

2. Principles of programming and analysis of Algorithm

2.1 Algorithm

2.2 Characteristics of an Algorithm

2.3 Algorithm Design Tools

2.4 Different Approaches for Designing on algorithm

2.5 Performance Analysis

2.6 BIG ‘O’ Notation-Asymptotic Notation

3. Searching and Sorting

3.1 Introduction

3.2 Sorting

3.3 Sorting Techniques

3.4 Searching

4. Stack

4.1 Introduction

4.2 Implementation of Stack

4.3 Applications of Stack

4.4 Expression Evaluation and Conversion

4.5 Recursion using implicit Stack

4.6 Reversing a String

5. Queues

5.1 Introduction

5.2 Operations on a Queue

5.3 Queue as ADT

5.4 Types of Queues

5.5 Applications of Queue

6. Linked List

6.1 Introduction

6.2 Concept of Linked List

6.3 Linked List implementation

6.4 TYPES OF Linked Lists

6.5 Operations on a Linked List

6.6 Dynamic Implementation of a singly linked list

6.7 Doubly Linked List

6.8 Circular List

6.9 Applications of Linked List

6.10 Stack using linked list

6.11 Queue using a Linked List

7. Trees

7.1 Introduction

7.2 Tree Terminology

7.3 Representation of Binary Trees

7.4 Creating a Binary Search Tree

7.5 Tree Traversals

7.6 Operations on Trees

7.7 Applications of Tree

7.8 Height Balanced Trees

8. Graphs

8.1 Introduction

8.2 Graph Representation

8.3 Traversal of Graphs

8.4 Spanning Trees

8.5 Shortest Path Algorithm for Graph

8.6 Applications of graphs

9. Hashing

9.1 Introduction

9.2 Concept Of Hashing

9.3 Hashing Terminology

9.4 Hashing Function

9.5 Collision Resolution Techniques

No customer comments for the moment.

Write a review

Write a review

30 other products

30 other products in the same category:

Customers who bought this product also bought: