A Quick Reference to Data Structures and Computer Algorithms: An Insight on the Beauty of Blockchain

Description
The book gives full understanding of theoretical topic and easy implementation in programming. The book is going to help students in self-learning of data structures and in understanding how these concepts are implemented in programs. It contains lot of figures, which will help students to visualize the concept effectively. Diagrams help students to understand how the programs involving data structure concepts are implemented within the computer system.
Algorithms are included to clear the concept of data structure. Each algorithm is explained with figures to make student clearer about the concept. Sample data set is taken and step by step execution of algorithm is provided in the book to ensure the in - depth knowledge of students about the concept discussed.

Key Features
● Simple and easy to understand.
● Useful for any level of students including B.E., BTech, MCA, BCA, B.Sc. (Computer Science), etc.
● Algorithms used in the book are well explained and illustrated step by step.
● Help students in understanding how data structures are implemented in programs.
● Each module contains question bank which includes questions for competitive examinations like UGC-NET, placement drives, and so on.

What will you learn
● New features and essential of Algorithms and Arrays.
● Linked List, its type and implementation.
● Stacks and Queues
● Trees and Graphs
● Searching and Sorting
● Greedy method
● Beauty of Blockchain

Who this book is for
This book is useful for all the students of B. Tech, B.E., MCA, BCA, B.Sc. (Computer Science), and so on. Person with basic knowledge in this field can understand the concept from the beginning of the book itself.

Table of Content
MODULE I: Algorithms and Arrays
-Algorithm
-Basic Concepts - Data Structures and Types of Data Structure
-Performance Analysis of an Algorithm
-Array Implementation of Polynomial Addition
-Sparse Matrices
-Transpose

MODULE II: Linked Lists
-Linked Lists
-Single Linked List
-Representation of a Linked List in Memory
-Operations on a Single Linked List
-Doubly Linked List
-Operations on a Doubly Linked List
-Polynomial Addition Using Linked List
-Linked list Implementation of Procedure

MODULE III: Stacks and Queues
-Stacks and Queues
-Representation of a Stack in Memory and array
-Linked List Representation of Stacks
-Operations on Stacks
-Applications of Stack
-Queues
-Representation of Queues
-Circular Queue
-Dequeue
-Priority Queue
-Application of Queues

MODULE IV: Trees and Graphs
-Trees and Graphs
-Basic Terminologies
-Binary Trees
-Strictly Binary Tree
-Complete Binary Tree
-Extended Binary Tree
-Binary Tree Representation
-Binary Search Tree
-Weighted Path Length
-B Tree
-Insertion in B tree
-B + tree
-AVL Tree (Height Balanced Binary Trees)
-Insertion in AVL tree
-Graphs
-Graph Representation
-Graph Traversals

MODULE V: Searching and Sorting
-Searching and Sorting
-Searching
-Procedure BINSRCH (F, n, i, K)
-Fibonacci Search
-Procedure FIBSEARCH (G, n, i, x)
-Sorting

MODULE VI: Greedy Method
-Greedy Method
-The Greedy Method: Basic Concepts
-Minimum - Cost Spanning Trees
-Prim's Algorithm
-Kruskal's Algorithm

MODULE VII: Beauty of Blockchain
-Beauty and orign of Blockchain
-Philosophy of Blockchain
-Normal Ecosystem
-Blockchain Ecosystem
-Distributed Ledgers
-The Principle of the Blockchain
-The Blockchain Data Structure and its Working
-Consensus Algorithm
-Proof of Work