Quick Reference to Data Structures and Computer Algorithms, A
US$ 19.95
The publisher has enabled DRM protection, which means that you need to use the BookFusion iOS, Android or Web app to read this eBook. This eBook cannot be used outside of the BookFusion platform.
Description
Contents
Reviews
Language
English
ISBN
9789388176583
Cover
A Quick Reference to Data Structures and Computer Algorithms
Copyright
Preface
Acknowledgment
About the Author
Table of Contents
MODULE I: Algorithms and Arrays
1. Algorithm
1.1 Introduction
1.2 Basic Concepts – Data Structures and Types of Data Structure
1.2.1 Data Type
1.3 Performance Analysis of an Algorithm
1.3.1 Space Complexity
1.3.2 Time Complexity
1.4 Polynomials
1.4.1 Introduction
1.4.2 Uses of Polynomials
1.4.3 Polynomial Addition
1.4. Structure Polynomial
1.5 Array Implementation of Polynomial Addition
1.6 Sparse Matrices
1.7 Transpose
1.8 Program
Exercises
MODULE II: Linked Lists
2. Linked Lists
2.1 Introduction
2.1 2.1Single Linked List
2.2.1 Representation of a Linked List in Memory
2.2. Operations on a Single Linked List
2.3 Some important procedures
2.4 Doubly Linked List
2.4.1 Operations on a Doubly Linked List
2.5 Polynomial Addition Using Linked List
2.6 Linked list Implementation of Procedure POLYADD (X, Y, Z)
2.7 Program
Exercises
MODULE III: Stacks and Queues
3. Stacks and Queues
3.1 Definition and Concepts
3.2 Stack
3.3 Representation of a Stack in Memory
3.3.1 Representation of a Stack using an Array
3.3. Linked List Representation of Stacks
3.4 Operations on Stacks
3.5 Applications of Stack
3.6 Queues
3.6.1 Representation of Queues
3.7 Circular Queue
3.8 Dequeue
3.9 Priority Queue
3.10 Application of Queues
3.11 Program
Exercises
MODULE IV: Trees and Graphs
4. Trees and Graphs
4.1 Introduction
4.2 Basic Terminologies
4.3 Tree
4.4 Binary Trees
4.4.1 Strictly Binary Tree
4.4. Complete Binary Tree
4.4. Extended Binary Tree
4.5 Binary Tree Representation
4.6 Binary Tree Traversal
4.7 More on Binary Trees
4.8 Threaded Binary Trees
4.9 Binary Tree Representation of Trees
4.10 Binary Search Tree
4.11 Procedure for deleting from a binary search tree
4.12 Weighted Path Length
4.13 B Tree
4.13.1 Insertion in B tree
4.14 B + tree
4.15 AVL Tree (Height Balanced Binary Trees)
4.15.1 Insertion in AVL tree
4.16 Graphs
4.17 Graph Representation
4.18 Graph Traversals
Exercises
MODULE V: Searching and Sorting
5. Searching and Sorting
5.1 Searching
5.1.1 Procedure SEQSRCH (R, n, i, K)
5.1. Procedure BINSRCH (F, n, i, K)
5.2 Fibonacci Search
5.2.1 Procedure FIBSEARCH (G, n, i, x)
5.3 Sorting
Exercises
MODULE VI: Greedy Method
6. Greedy Method
6.1 The Greedy Method: Basic Concepts
6.2 Minimum – Cost Spanning Trees
6.2.1 Prim’s Algorithm
6.2. Kruskal’s Algorithm
Exercises
MODULE VII: Beauty of Blockchain
7. Beauty of Blockchain
7.1 Origin of Blockchain
7.2 Philosophy of Blockchain (Difference between Normal Ecosystem and Blockchain Ecosystem)
7.2.1 Normal Ecosystem
7.2. Blockchain Ecosystem
7.3 Distributed Ledgers
7.4 The Principle of the Blockchain
7.5 The Blockchain Data Structure and its Working (Case Study: Bitcoin)
7.6 Consensus Algorithm
7.7 Proof of Work
7.8 Proof of Stake (PoS)
7.9 Delegated Proof of Stake
7.10 Smart Contacts
7.11 Types of Blockchain
7.12 Advantage of Blockchain
7.13 Disadvantage of Blockchain
7.14 Future of Blockchain
The book hasn't received reviews yet.