Data Structure and Algorithms Using C++ A Practical Implementation.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Mohanty, Sachi Nandan
Otros Autores: Tripathy, Pabitra Kumar
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Newark : John Wiley & Sons, Incorporated, 2021.
Edición:2nd ed.
Temas:
Data structures (Computer science)
Structures de données (Informatique)
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Cover
  • Half-Title Page
  • Series Page
  • Title Page
  • Copyright Page
  • Contents
  • Preface
  • 1 Introduction to Data Structure
  • 1.1 Definition and Use of Data Structure
  • 1.2 Types of Data Structure
  • Linear Data Structures
  • Non-Linear Data Structure
  • Operations Performed in Data Structure
  • 1.3 Algorithm
  • Steps Required to Develop an Algorithm
  • Mathematical Notations and Functions
  • Algorithemic Notations
  • 1.4 Complexity of an Algorithm
  • Space Complexity
  • Time Complexity
  • Best Case
  • Worst Case
  • Average Case
  • 1.5 Efficiency of an Algorithm
  • 1.6 Asymptotic Notations
  • Big Oh (O) Notation
  • Omega Notation (W)
  • Theta Notation (q)
  • Little Oh Notation (o)
  • Introduction
  • 1.7 How to Determine Complexities
  • Examples
  • Answer: The first loop is O(N) and the second loop is O(M). Since you
  • Answer: The first set of nested loops is O(N2) and the second loop is
  • Answer: When i is 0 the inner loop executes N times. When i is 1 the
  • Answer: a. Each call to f(j) is O(1). The loop executes N times so it is N x
  • 1.8 Questions
  • 2 Review of Concepts of 'C++'
  • 2.1 Array
  • 2.1.1 One-Dimensional Array Declaration:
  • 2.1.2 Multi-Dimensional Array
  • 2.1.3 String Handling
  • 2.2 Function
  • 2.2.1 User Defined Functions
  • 2.2.2 Construction of a Function
  • 2.2.3 Actual Argument and Formal Argument
  • 2.2.4 Call by Value and Call by Reference
  • 2.2.5 Default Values for Parameters
  • 2.2.6 Storage Class Specifiers
  • 2.3 Pointer
  • 2.3.1 Declaration of a Pointer
  • 2.3.2 Initialization of a Pointer
  • 2.3.3 Arithmetic With Pointer
  • 2.3.4 Passing of a Pointer to Function
  • 2.3.5 Returning of a Pointer by Function
  • 2.3.6 C++ Null Pointer
  • 2.4 Structure
  • 2.4.1 The typedef Keyword
  • 2.5 Questions
  • 3 Sparse Matrix
  • 3.1 What is Sparse Matrix
  • 3.2 Sparse Matrix Representations
  • 3.3 Algorithm to Represent the Sparse Matrix
  • 3.4 Programs Related to Sparse Matrix
  • 3.5 Why to Use Sparse Matrix Instead of Simple Matrix?
  • 3.6 Drawbacks of Sparse Matrix
  • 3.7 Sparse Matrix and Machine Learning
  • 3.8 Questions
  • 4 Concepts of Class
  • 4.1 Introduction to CLASS
  • 4.2 Access Specifiers in C++
  • 4.3 Declaration of Class
  • 4.4 Some Manipulator Used In C++
  • 4.5 Defining the Member Functions Outside of the Class
  • 4.6 Array of Objects
  • 4.7 Pointer to Object
  • 4.8 Inline Member Function
  • 4.9 Friend Function
  • 4.9.1 Simple Friend Function
  • 4.9.2 Friend With Inline Substitution
  • 4.9.3 Granting Friendship to Another Class (Friend Class)
  • 4.9.4 More Than One Class Having the Same Friend Function
  • 4.10 Static Data Member and Member Functions
  • 4.11 Constructor and Destructor
  • 4.11.1 Constructor
  • 4.11.2 Destructor
  • 4.12 Dynamic Memory Allocation
  • 4.13 This Pointer
  • 4.14 Class Within Class
  • 4.15 Questions
  • 5 Stack
  • 5.1 STACK
  • 5.2 Operations Performed With STACK
  • 5.3 ALGORITHMS
  • 5.4 Applications of STACK

Ejemplares similares