close menu
Bookswagon-24x7 online bookstore
close menu
My Account
Home > Computing and Information Technology > Computer science > A Quick Reference to Data Structures and Computer Algorithms: An Insight on the Beauty of Blockchain
80%
A Quick Reference to Data Structures and Computer Algorithms: An Insight on the Beauty of Blockchain

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

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

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


Best Seller

| | See All


Product Details
  • ISBN-13: 9789388176583
  • Publisher: BPB Publications
  • Publisher Imprint: BPB Publications
  • Height: 229 mm
  • No of Pages: 320
  • Spine Width: 17 mm
  • Weight: 431 gr
  • ISBN-10: 9388176588
  • Publisher Date: 07 Jun 2019
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Sub Title: An Insight on the Beauty of Blockchain
  • Width: 152 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
A Quick Reference to Data Structures and Computer Algorithms: An Insight on the Beauty of Blockchain
BPB Publications -
A Quick Reference to Data Structures and Computer Algorithms: An Insight on the Beauty of Blockchain
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

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

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    | | See All


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA