DATA STRUCTURE AND ALGORITHM

Authors Name Rajesh S. Yemul , Vijay T. Patil
ISBN 13 9789389533842
Publisher
Edition First
Pages 290
Language English
Publishing Year Nov-19

Email on info@pragationline.com if e-book is not found.

SKU: N5306 Categories: , ,
Print version 290 261
10% OFF
  • Print Version: The estimated delivery date of the print version is approximately 3 to 5 working days from the date of placing the order

  • For any queries write to info@pragationline.com

Add to Cart Go to Library Add to Cart Buy Now
download-app-scan
download-app
Description

1. Introduction to Data Structure

1.1 Fundamentals of Data Structure
1.2 Operations of Data Structure

1.2.1 Traversing

1.2.2 Searching (Linear and Binary Search)

1.2.3 Sorting (Bubble, Insertion, Selection, Quick and Merge sort)

1.2.4 Inserting and Deleting

1.3 Arrays as Data Structure
1.4 Storage Representation of Arrays
1.5 Polynomial Representation of Arrays

1.5.1 Addition of Two Polynomial

1.5.2 Addition of Sparse Matrix

2. Stacks

2.1 Introduction and Definition
2.2 Representation of Stacks
2.3 Operations on Stacks
2.4 Applications of Stacks
2.5 Representation of Arithmetic Expressions

2.5.1 Infix
2.5.2 Postfix
2.5.3 Prefix

3. Queues

3.1 Introduction and Definition
3.2 Representation of Queues
3.3 Operation on Queues
3.4 Applications of Queues
3.5 Dequeue
3.6 Circular Queue
3.7 Priority Queue

4. Linked List

4.1 Definition of Linked List
4.2 Dynamic Memory Management
4.3 Representation of Linked List
4.4 Operations on Linked List

4.4.1 Inserting
4.4.2 Removing
4.4.3 Searching
4.4.4 Sorting
4.4.5 Merging Nodes

4.5 Double Linked List

5. Trees

5.1 Definition of Tree
5.2 Binary Tree and their types
5.3 Representation of Binary Tree
5.4 Operations on Binary Tree
5.5 Binary Search Tree (BST)
5.6 Traversal of Binary Tree

5.6.1 Pre-order Traversal
5.6.2 In-order Traversal
5.6.3 Post-order Traversal

5.7 Threaded Binary Tree
5.8 AVL Tree
5.9 B-Tree
5.10 Operations on B-Tree

6. Graphs

6.1 Definition of Graph
6.2 Basic Concepts of Graph
6.3 Representation of Graph

6.3.1 Adjacency Matrix
6.3.2 Adjacency List

6.4 Single Source shortest path algorithm-Dijkstra’s
algorithm.
6.5 Spanning Tree
6.6 Minimum Spanning Tree

6.6.1 Kruskal’s Algorithm
6.6.2 PRIM’s Algorithm

6.7 Graph Traversal

6.7.1 Breadth First Search (BFS)
6.7.2 Depth First Search (DFS)

Additional information
Weight 410 g
Dimensions 25 × 18 × 3 cm
Reviews (0)

Reviews

There are no reviews yet.

Be the first to review “DATA STRUCTURE AND ALGORITHM”

0
    0
    Your Cart
    Your cart is emptyReturn to Shop
      Calculate Shipping
      Apply Coupon
      MCA Sem 2 Textbook
      DATA STRUCTURE AND ALGORITHM