Practical Approach to Data Structure and Algorithm with Programming in C

Name: Practical Approach to Data Structure and Algorithm with Programming in C
Brand: Arcler Press
Price: 213.99 EUR
Availability: OnlineOnly

Kumar Srivastava Akhilesh(Autor*in)

Arcler Press

Erschienen am 30. Dezember 2019

512 Seiten

E-Book

PDF mit Adobe-DRM

Systemvoraussetzungen

978-1-77407-429-9 (ISBN)

213,99 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Adobe-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Inhalt

Cover
Title Page
Copyright
ABOUT THE AUTHOR
TABLE OF CONTENTS
List of Abbreviations
Acknowledgment
Preface
Chapter 1 Introduction to Data Structures
1.1. Types Of Data Structures
1.2. Categorization Of Data Structures
Exercises
Chapter 2 Algorithm Writing
2.1. Algorithm
2.2. Pseudo Code Writing: Industry Pattern
Exercises
Chapter 3 Complexity Of Algorithm
3.1. What Is Complexity
3.2. Space Complexity Of Recursive Algorithm
3.3. Notations For Representing Complexity
Exercises
Chapter 4 Array
4.1. Definition And Types Of Array
4.2. Primitive Operations On Array
4.3. Application Problems Related To Array
4.4. Index Formula
Exercises
Chapter 5 Searching Algorithms
5.1. What Is Searching?
5.2. Sequential Search (Linear Search)
5.3. Binary Search
5.4. Comparison Of Linear And Binary Search
5.5. Indexed Sequential Search
Exercises
Chapter 6 Sorting Algorithms
6.1. Bubble Sort
6.2. Insertion Sort
6.3. Selection Sort
6.4. Quick Sort
6.5. Merge Sort
6.6. Set Operations Using Array
6.7. Counting Sort
6.8. Radix Sort
Exercises
Chapter 7 Heap & Heap Sort
7.1. Heap
7.2. Insertion In Heap
7.3. Deletion In Heap
7.4. Heap As Priority Queue
7.5. Heap Sort
Exercises
Chapter 8 Matrix Operations
8.1. Matrix Transposition
8.2. Printing Matrix In Spiral Form
8.3. Matrix Addition
8.4. Matrix Multiplication
Exercise
Chapter 9 Strings
9.1. Application Problems Related To Strings
Exercises
Chapter 10 Stack
10.1. Stack Basics
10.2. Primitive Operations On Stack
10.3. Applications Of Stack
Exercises
Chapter 11 Recursion
11.1. Concept Of Recursion
11.2. Application Problems Related To Recursion
11.3. Towers Of Hanoi
Exercises
Chapter 12 Queue
12.1. Queue Basics
12.2. Linear Queue
12.3. Circular Queue
12.4. Priority Queues
Exercises
Chapter 13 Linked List
13.1. Linked List Basics
13.2. Linear Linked List
13.3. Related Functions
13.4. Set Operations Using Linked List
13.5. Polynomial Representation And Polynomial Addition
13.6. Long Numbers Arithmetic
13.7. Linked List Implementation Of Queue
13.8. Linked List Implementation Of Stack
13.9. Linked List Implementation Of Priority Queue
13.10. Circular Linked List
13.11. Doubly Linked List
13.12. Circular Doubly Linked List
Exercises
Chapter 14 Binary Tree
14.1. Binary Tree Basics
14.2. Implementation Of Binary Tree
14.3. Primitive Operations In Binary Tree
14.4. Building Binary Tree From Given Traversals
14.5. Level Order Traversal In Binary Tree
14.6. Application Problems Related To Binary Tree
14.7. Expression Tree
14.8. Huffman Coding
Exercises
Chapter 15 Binary Search Tree
15.1. Binary Search Tree (Bst) Basics
15.2. Primitive Operations On Binary Search Tree (Bst)
15.3. Height Balanced Search Tree: Avl Tree
Exercises
Chapter 16 B-Tree & B+-Tree
16.1. B-Tree
16.2. B+Tree
Exercises
Chapter 17 Graph
17.1. Graph Basics
17.2. Applications Of Graphs
17.3. Representing Graphs
17.4. Graph Traversal
17.5. Shortest Path
17.6. Transitive Closure
17.7. Spanning Tree
17.8. Topological Sort
Exercises
Chapter 18 Sparse Matrices
18.1. Sparse Matrix Basics
18.2. Types Of Sparse Matrix
18.3. Addition Of Two Sparse Matrices
Exercises
Chapter 19 Hashing
19.1. Direct Address Table
19.2. Hash Tables
19.3. Collision Resolution In Hash Table
Exercises
Index
Back Cover

Systemvoraussetzungen

Als PDF speichern Als Link merken