Quick Reference to DATA STRUCTURES and COMPUTER ALGORITHMS

Nair Raji Ramakrishnan

Description

For beginners to level up Core Programming SkillsKey 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 forThis 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 contents1. Algorithm and Arrays2. Linked Lists3. Stacks and queues4. Trees and Graphs5. Searching and Sorting6. Greedy Method7. Beauty of Blockchain About the authorRaji 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.Her 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.

Sujets

• Sciences formelles
• Algorithmes
• Computer science
• Informatique

Informations

• Publié par: BPB Publications
• Date de parution: 20 septembre 2019
• Nombre de lectures: 4
• EAN13: 9789389328103
• Langue: English
• Poids de l'ouvrage: 2 Mo

Extrait

A Quick Reference to Data Structures and Computer Algorithms
By Raji Ramakrishnan Nair Divya Joseph Alen Joseph
FIRST EDITION 2019
Copyright © BPB Publications, INDIA
ISBN: 978-93-88176-58-3
All Rights Reserved. No part of this publication can be stored in a retrieval system or reproduced in any form or by any means without the prior written permission of the publishers
LIMITS OF LIABILITY AND DISCLAIMER OF WARRANTY
The Author and Publisher of this book have tried their best to ensure that the programmes, procedures and functions described in the book are correct. However, the author and the publishers make no warranty of any kind, expressed or implied, with regard to these programmes or the documentation contained in the book. The author and publisher shall not be liable in any event of any damages, incidental or consequential, in connection with, or arising out of the furnishing, performance or use of these programmes, procedures and functions. Product name mentioned are used for identification purposes only and may be trademarks of their respective companies.
All trademarks referred to in the book are acknowledged as properties of their respective owners.
Distributors:
BPB PUBLICATIONS 20, Ansari Road, Darya Ganj New Delhi-110002 Ph: 23254990/23254991
 
MICRO MEDIA Shop No. 5, Mahendra Chambers, 150 DN Rd. Next to Capital Cinema, V.T. (C.S.T.) Station, MUMBAI-400 001 Ph: 22078296/22078297
 
BPB BOOK CENTRE 376 Old Lajpat Rai Market, Delhi-110006 Ph: 23861747
 
DECCAN AGENCIES 4-3-329, Bank Street, Hyderabad-500195 Ph: 24756967/24756400
 
 
Published by Manish Jain for BPB Publications, 20, Ansari Road, Darya Ganj, New Delhi-110002 and Printed by Repro India Pvt Ltd, Mumbai
 
 
Dedicated to
 
My Students… My Strength and My Weakness
 
“A book is a dream that you hold in your hand.”
— Neil Gaiman
Preface
“ A quick reference to Data Structures and Computer Algorithms ” is written in a very simple and understandable manner. The theory is described well with step by step examples. The book gives full understanding of each 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. The book contains lot of figures and this 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.
We have designed this book out of necessity. Right now, references that are available in market in this field, focusses on specific area only. For studying a specific topic, we have to refer minimum of 3 textbooks. That was really hectic and time consuming. Some textbooks focus on programming part, some focusses on algorithms and some focusses on its illustration using figures. Because of all these limitations, we thought to write a book which will satisfy the students in every way. Our book can be a handbook for some, a quick reference for competitive examinations and it can be surely a textbook in any University that offers Computer Science in their curriculum.
This book is useful for all the students of B. Tech, B.E., MCA, BCA, B.Sc. (Computer Science), etc. A student 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.
Our book contains seven chapters, focussing from basics of an algorithm to different design strategies. This book also includes different searching and sorting methods.
Chapter 1: Algorithms and Arrays : This chapter describes the algorithm and the performance analysis of an algorithm – Space Complexity and Time Complexity. Explains polynomials and its importance in day to day life. Explains polynomial addition in detail. Gives information related to sparse matrix and its representation in memory. C programs help to understand the implementation easily. Question bank is also provided at the end of the chapter.
Chapter 2: Linked Lists: Here focus is given on the linked list implementations. Different types of linked lists have been discussed with its various operations. Diagrammatic representation of each operation helps to understand the working concept effectively. Static and dynamic representation of single linked list is well explained here. Doubly linked lists with its operations are well explained here. Programmes are given for different linked list operations. Question bank at the end of chapter helps to practice the concept well for future references.
Chapter 3: Stacks and Queues: This chapter deals with the data structure used for specific situations, i.e., when we want to have insertion and deletion operation at only one place or when we want to perform insertion operation at one end and deletion operation at another end. Here we are focussing on the different memory representations of stacks and queues. Different operations of stacks are discussed well here. Applications of stack are well explained in this chapter. C programmes included help to understand the concept effectively. Different types of queues are also explained here. Question bank is provided at the end of the chapter help to refer in future.
Chapter 4: Trees and Graphs: This chapter includes basic concepts related to trees. It focusses on different types of trees, especially binary tree concepts. Helps to understand the representation of binary tree in memory. Explains the different types of traversals available. Explains the different operations on binary trees. Other than this, introduces the concept of B and B+ trees. Explains the height balanced trees well. Also helps to understand the concept of graphs, with its various ways of representation in memory. Gives a good idea on graph traversals with proper explanation. Question bank is also provided at the end of each chapter.
Chapter 5: Searching and Sorting: This chapter deals with the Divide and Conquer strategy. Mainly focusses on the different searching and sorting methods available. Many of the methods have been explained well with suitable examples. Question bank is also provided at the end of each chapter.
Chapter 6: The Greedy Method: Here the concept of greedy method is well explained. Two algorithms are effectively explained and they are the Kruskal’s algorithm and the Prim’s algorithm. Question bank is provided at the end of the chapter.
Chapter 7: Beauty of Blockchain: This chapter goes through Blockchain a real application of data structure; we are trying to bring curiosity to students about the disruptor technology which they are going to get hands-on experience in the near future. It is the difficult topic but we have tried to make it easier. First of all, we explained the origin of the Blockchain, clarify the dilution regarding Blockchain and cryptocurrency. Then the elements and jargons of Blockchain are discussed. We jump deeper explaining Blockchain terminology with use cases. After that, we go into different types of Blockchain, how to implement them and their different use cases. We concluded by explaining the advantages and disadvantages of Blockchain along with its future.
Data Structures and Computer Algorithms are counted under the difficult topics in the field of Computer Applications. We have tried to make this subject a bit lighter for our students. Hope it will work out in the best way possible for our new generation students, because of the salient features of this book.
Acknowledgment
Writing a book is harder than I thought and more interesting and rewarding than I could have ever imagined. None of this would have been possible without my dear friend Kochumol Abraham . She was the one who gave me first, a thought of converting my hand-written notebook to a real textbook.
I am indebted to numerous peoples for their help. And, I am forever indebted to my dear and loving students, past and present, who gave me immense help in bringing this book project to completion. My sincere thanks go out to all my students, especially Jayakrishnan M. Without him, it would have been near impossible to translate the dream of my visualisation of technical concepts into pictorial representations. Special thanks to Anandhu Anil, Jojo Joseph, Gautham Prakash , Nancy George and Akash S Panickar.
My sincere thanks also go to my dear Principal, Fr. Roy Abraham , Marian College Kuttikkanam (Autonomous) and Dr. Jose James , who were a constant source of inspiration in the journey of my book completion.
Many of my colleagues at work have been extremely supportive of this effort. At the top of the list is Dr. Brijesh George John , Associate Professor & Head – Corporate Relations, Marian College Kuttikkanam, Chairman – Placement Officers Kerala Consortium. I would like to express the deepest appreciation to him, who has the attitude and the substance of a genius. Without his guidance and persistent help, my dream of completing a book would not have been possible. My heartfelt gratitude to my dear friends Mr. Krishnaraj S. (CEO – Synergy Thoughts, Master Trainer – ICT Academy of Kerala) and Ms. Minu Sivan ( Assistant Professor, Economics Department, Marian College Kuttikkanam)
I came across many motivators in this journey especially Prof. Vijayakumar M. ( MCMS Director - Marian College Kuttikkanam (Autonomous)), Naseef Ahammed , Fr. Chackochi M