Data Structure and Algorithms Using C++

Book Details

Author

Language

Pages

Size

Format

Category

Data Structure and Algorithms Using C++

PDF Free Download | Data Structure and Algorithms Using C++ A Practical Implementation by Sachi Nandan Mohanty, Pabitra Kumar Tripathy

Contents of Data Structure and Algorithms Using C++

  • Introduction to Data Structure
  • Definition and Use of Data Structure
  • Types of Data Structure
  • Algorithm
  • Complexity of an Algorithm
  • Efficiency of an Algorithm
  • Asymptotic Notations
  • How to Determine Complexities
  • Questions
  • Review of Concepts of ‘C++’
  • Array
  • One-Dimensional Array
  • Multi-Dimensional Array
  • String Handling
  • Function
  • User Defined Functions
  • Construction of a Function
  • Actual Argument and Formal Argument
  • Call by Value and Call by Reference
  • Default Values for Parameters
  • Storage Class Specifiers
  • Pointer
  • Declaration of a Pointer
  • Initialization of a Pointer
  • Arithmetic With Pointer
  • Passing of a Pointer to Function
  • Returning of a Pointer by Function
  • C++ Null Pointer
  • Structure
  • The typedef Keyword
  • Questions
  • Sparse Matrix
  • What is Sparse Matrix
  • Sparse Matrix Representations
  • Algorithm to Represent the Sparse Matrix
  • Programs Related to Sparse Matrix
  • Why to Use Sparse Matrix Instead of Simple Matrix?
  • Drawbacks of Sparse Matrix
  • Sparse Matrix and Machine Learning
  • Questions
  • Concepts of Class
  • Introduction to CLASS
  • Access Specifiers in C++
  • Declaration of Class
  • Some Manipulator Used In C++
  • Defining the Member Functions Outside of the Class
  • Array of Objects
  • Pointer to Object
  • Inline Member Function
  • Friend Function
  • Simple Friend Function
  • Friend With Inline Substitution
  • Granting Friendship to Another Class
  • (Friend Class)
  • More Than One Class Having the Same
  • Friend Function
  • Static Data Member and Member Functions
  • Constructor and Destructor
  • Constructor
  • Empty Constructor
  • Default Constructor
  • Parameterized Constructors
  • Copy Constructor
  • Destructor
  • Dynamic Memory Allocation
  • This Pointer
  • Class Within Class
  • Questions
  • Stack
  • STACK
  • Operations Performed With STACK
  • ALGORITHMS
  • Applications of STACK
  • Programming Implementations of STACK
  • Questions
  • Queue
  • Queue
  • Types of Queue
  • Linear Queue
  • Circular Queue
  • Double Ended Queue
  • Priority Queue
  • Programs
  • Questions
  • Linked List
  • Why Use Linked List?
  • Types of Link List
  • Single Link List
  • Programs Related to Single Linked List
  • Conversion of a Tree From Inorder and Preorder
  • Types of Binary Tree
  • Expression Tree
  • Binary Search Tree
  • Height Balanced Tree (AVL Tree)
  • Threaded Binary Tree
  • Heap Tree
  • Huffman Tree
  • Decision Tree
  • B-Tree
  • B + Tree
  • General Tree
  • Red–Black Tree
  • Questions
  • Graph
  • Graph Terminologies
  • Representation of Graph
  • Traversal of Graph
  • Breadth First Search (BFS)
  • Depth First Search
  • Spanning Tree
  • Kruskal Algorithm
  • Prim’s Algorithm
  • Single Source Shortest Path
  • Bellman–Ford Algorithm
  • Dijkstra’s Algorithm
  • All Pair Shortest Path
  • Topological Sorting
  • Questions
  • Searching and Sorting
  • Linear Search
  • Binary Search
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Radix Sort
  • Heap Sort
  • Questions
  • Hashing
  • Hash Functions
  • Collisions
  • Collision Resolution Methods
  • Clustering
  • Questions

Related Books

What's the problem with this file?

There is a temporary issue with downloading files and we are working on.
In the meantime, we appreciate your patience.