Data Structures with C Programming
Published on 30. January 2019
334 pages
978-1-77361-658-2 (ISBN)
Description
Data structures with C Programming examines various concepts related to structuringof data giving brief overview about them. It starts with explanation data structures thatare utilized to store data in a computer in an organized form. It includes different typesof data structure using C language. It provides the reader with insights into the datastructuring and C programming to enable efficient access and modification of data.
More details
Content
- Cover
- Half Title Page
- Title Page
- Copyright Page
- About the Authors
- Table of Contents
- List of Figures
- Preface
- Chapter 1 Data Structures
- 1.1. Introduction
- 1.2. Data Structure Basic Terminology
- 1.3. Data Structure
- 1.4. Introduction To Algorithm
- 1.5. Basic Concept of Function
- 1.6. Basic Concept of Pointers
- 1.7. Introduction To Structure
- 1.8. Dynamic Memory Allocation In Data Structure
- Chapter 2 Array
- 2.1. Introduction
- 2.2. Application of Array
- 2.3. Definition of Array
- 2.4. Representation of Array
- 2.5. Ordered List
- 2.6. Sparse Matrices
- 2.7. Garbage Collection
- Chapter 3 Recursion
- 3.1. Introduction
- 3.2. Recursion
- 3.3. Tower of Hanoi
- 3.4. Backtracking
- Chapter 4 Stack
- 4.1. Introduction
- 4.2. Definition of Stack
- 4.3. Operations on Stack
- 4.4. Disadvantages of Stack
- 4.5. Applications of Stack
- 4.6. Expressions (Polish Notation)
- 4.7. Evaluation of Postfix Expression
- 4.8. Decimal To Binary Conversion
- 4.9. Reversing The String
- Chapter 5 Queue
- 5.1. Introduction
- 5.2. Definition And Structure of Queue
- 5.3. Operations on Queue
- 5.4. Circular Queue
- 5.5. D-Queue (Double Ended Queue)
- 5.6. Priority Queues
- 5.7. Application of Queue
- Chapter 6 Linked List
- 6.1. Introduction
- 6.2. Definition And Structure of Linked List
- 6.3. Characteristics of Linked List
- 6.4. Types of Linked List
- 6.5 Polynomial Representation of Linked List
- Chapter 7 Tree
- 7.1. Introduction
- 7.2. Definition of Trees
- 7.3. Binary Tree
- 7.4. Binary Tree Representation
- 7.5. Binary Tree Traversal
- 7.6. Binary Search Tree (BST)
- 7.7. Height Balanced (AVL) Tree
- Chapter 8 Graph
- 8.1. Introduction
- 8.2. Definition of Graph
- 8.3. Representation of Graphs
- 8.4. Graph Traversal
- 8.5. Spanning Tree
- 8.6. Shortest Path Problem
- 8.7. Application Of Graph
- Chapter 9 Sorting
- 9.1. Introduction
- 9.2. Types of Sorting
- 9.3. Basic Terms of Sorting
- 9.4. Sorting Techniques
- Chapter 10 Searching and Hashing
- 10.1. Introduction
- 10.2. Searching
- 10.3. Hashing
- 10.4. Collision
- 10.5. Collision Handling Method
- 10.6. Rehashing
- 10.7. Application of Hashing
- Index
