Data Structures and Other Objects Using C++ 2nd edition by Michael Main ISBN 8129705826 978-8129705822

Data Structures & Other Objects Using C++ 2nd edition by Michael Main – Ebook PDF Instant Download/Delivery.  8129705826 978-8129705822
Full download Data Structures & Other Objects Using C++ 2nd edition after payment

Product details:

ISBN 10: 8129705826
ISBN 13: 978-8129705822
Author: Michael Main

Data Structures & Other Objects Using C++ (2nd Edition) by Michael Main and Walter Savitch is a comprehensive guide to data structures and algorithms using the C++ programming language. The book introduces fundamental data structures such as arrays, lists, stacks, queues, trees, and graphs, alongside more advanced topics like hashing, heaps, and sorting algorithms. It integrates both theoretical concepts and practical implementation using C++, with a strong emphasis on object-oriented design and problem-solving techniques. This book is suitable for students and practitioners of computer science and software engineering.

Data Structures & Other Objects Using C++ 2nd  Table of contents:

---

Part 1: Introduction to Data Structures

Chapter 1: Introduction to C++ and Data Structures
1.1. Introduction to C++
1.2. Review of C++ Syntax
1.3. Problem Solving in C++
1.4. Introduction to Abstract Data Types (ADTs)
1.5. C++ Classes and Object-Oriented Programming
1.6. Overview of Data Structures

Chapter 2: Arrays and Strings
2.1. Introduction to Arrays
2.2. One-Dimensional Arrays
2.3. Two-Dimensional Arrays
2.4. Arrays of Objects
2.5. C++ Strings
2.6. Multi-Dimensional Arrays
2.7. Introduction to String Manipulation

---

Part 2: Lists and Linked Structures

Chapter 3: Linked Lists
3.1. Introduction to Linked Lists
3.2. Singly Linked Lists
3.3. Operations on Singly Linked Lists
3.4. Doubly Linked Lists
3.5. Circular Linked Lists
3.6. C++ Implementation of Linked Lists

Chapter 4: Stacks and Queues
4.1. Stack ADT
4.2. Stack Operations
4.3. Implementing Stacks with Arrays and Linked Lists
4.4. Queue ADT
4.5. Circular Queues
4.6. Implementing Queues
4.7. Priority Queues

---

Part 3: Trees

Chapter 5: Binary Trees
5.1. Introduction to Binary Trees
5.2. Binary Tree Traversal
5.3. Binary Tree Operations
5.4. Full, Complete, and Perfect Binary Trees
5.5. C++ Implementation of Binary Trees

Chapter 6: Binary Search Trees
6.1. Introduction to Binary Search Trees (BST)
6.2. Insertion and Deletion in BSTs
6.3. Searching in Binary Search Trees
6.4. C++ Implementation of Binary Search Trees
6.5. Balancing Binary Search Trees
6.6. AVL Trees

Chapter 7: Balanced Trees and Other Tree Structures
7.1. Introduction to Balanced Trees
7.2. AVL Tree Operations
7.3. Red-Black Trees
7.4. Splay Trees
7.5. B-Trees
7.6. Tree Implementations in C++

---

Part 4: Graphs

Chapter 8: Graphs
8.1. Introduction to Graphs
8.2. Graph Representations
8.3. Graph Traversals: Depth-First Search and Breadth-First Search
8.4. Minimum Spanning Trees
8.5. Shortest Path Algorithms
8.6. C++ Implementation of Graphs

Chapter 9: Advanced Graph Algorithms
9.1. Topological Sorting
9.2. Strongly Connected Components
9.3. Dijkstra’s Algorithm
9.4. Bellman-Ford Algorithm
9.5. Floyd-Warshall Algorithm

---

Part 5: Advanced Data Structures and Algorithm Design

Chapter 10: Hashing and Hash Tables
10.1. Introduction to Hashing
10.2. Hash Functions
10.3. Collision Resolution Strategies
10.4. Open Addressing
10.5. Chaining
10.6. Hash Table Operations
10.7. C++ Implementation of Hash Tables

Chapter 11: Heaps and Priority Queues
11.1. Introduction to Heaps
11.2. Binary Heaps
11.3. Priority Queues
11.4. Heapsort Algorithm
11.5. C++ Implementation of Heaps and Priority Queues

Chapter 12: Sorting Algorithms
12.1. Introduction to Sorting Algorithms
12.2. Bubble Sort
12.3. Insertion Sort
12.4. Merge Sort
12.5. Quick Sort
12.6. Heap Sort
12.7. Comparison of Sorting Algorithms
12.8. Sorting in C++

---

Part 6: Problem Solving and Application

Chapter 13: Problem Solving with Data Structures
13.1. Problem-Solving Strategy
13.2. Divide and Conquer
13.3. Dynamic Programming
13.4. Greedy Algorithms
13.5. Backtracking
13.6. Case Studies in Problem Solving

---

Appendices

• A. C++ Syntax Review

• B. Time Complexity and Asymptotic Analysis

• C. Answers to Selected Exercises

• D. Index

People also search for Data Structures & Other Objects Using C++ 2nd :

data structures and other objects using c++ 4th ed pdf

data structures and other objects using c++ fourth edition

what is data structure in c++ with example

types of data structure in c++

data structures and other objects using c++ 4th edition