For beginners to level up Core Programming Skills

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.

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.

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.
We think our book is one of a kind. We are trying to connect the past and the present here. The last module of our book is focussing on BLOCKCHAIN. It explains the concepts of blockchain through a different dimension, that is, explaining the data structure aspect of blockchain.

Table of Contents

1. Algorithm and Arrays
2. Linked Lists
3. Stacks and queues
4. Trees and Graphs
5. Searching and Sorting
6. Greedy Method
7. Beauty of Blockchain

About the Author
Raji Ramakrishnan Nair, has done BCA, MCA and M. Tech (IT) and currently working as an Assistant Professor at the P. G. Department of Computer Applications of Marian College Kuttikkanam (Autonomous). She has 14 years of teaching experience and believes that teaching is all about being friend, philosopher and guide to her students. This book is inspired by her passion to simplify complex subjects for easy understanding; the real contribution of a great teacher. She is a philanthropist as well, actively involved in many social causes, which made her students to engage in relief works in Kerala mega flood and resulted in two houses being built for flood victims.

LinkedIn Profile: linkedin.com/in/raji-ramakrishnan-nair-8820b1171

Divya Joseph, is a Teacher by passion and profession. She has done MTech (CSE) and BTech (IT) from Amal Jyothi College of Engineering, Kanjirapally. Presently, she is working as an Assistant Professor in the P.G. Department of Computer Applications, Marian College Kuttikkanam (Autonomous).

Alen Joseph, is an Associate Software Developer at UST Global Trivandrum. His great passion for teaching and research motivated him to write this book. He has done MCA from Marian College Kuttikkanam (Autonomous). He is a passionate tech enthusiast and his dream is to become a full-time researcher.

 

Osoby które kupowały "Quick Reference to Data Structures and Computer Algorithms, A", wybierały także:

• Cisco CCNA 200-301. Kurs video. Administrowanie bezpieczeÅ„stwem sieci. Część 3 665,00 zÅ‚, (39,90 zÅ‚ -94%)
• Cisco CCNA 200-301. Kurs video. Administrowanie urzÄ…dzeniami Cisco. Część 2 665,00 zÅ‚, (39,90 zÅ‚ -94%)
• Cisco CCNA 200-301. Kurs video. Podstawy sieci komputerowych i konfiguracji. Część 1 665,00 zÅ‚, (39,90 zÅ‚ -94%)
• Impact of P2P and Free Distribution on Book Sales 427,14 zÅ‚, (29,90 zÅ‚ -93%)
• Cisco CCNP Enterprise 350-401 ENCOR. Kurs video. Programowanie i automatyzacja sieci 443,33 zÅ‚, (39,90 zÅ‚ -91%)

• 
• 
• 
• 
• 

Spis treści

Quick Reference to Data Structures and Computer Algorithms, A eBook -- spis treści

• 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 (
• 5.1. Procedure BINSRCH (
• 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 Prims Algorithm
• 6.2. Kruskals 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