
Data Structure Using C
Anil K. Ahlawat(Author)
I K International Publishing House Pvt. Ltd
Published on 30. November 2019
Book
Paperback/Softback
400 pages
978-93-86768-38-4 (ISBN)
Description
Data Structure has the importance not only in Computer Science but for any discipline of Engineering and Technology where there is a requirement of appropriate data structures in program development.
Before solving a problem, a major decision is taken about which data structure will be used to represent the data. In this book, multiple stacks and multiple queues are added to represent more complex data structures.
This book broadly deals with: - data structure, the basic operations and types of data structure
- single and multidimensional arrays and sparse matrices
- concepts, types, and implementation of linked list
- concepts of stacks, recursion and queue, their operations and applications and types
- circular, priority and double ended queues
- concepts of tree and binary search tree
- basic as well as advanced topics of tree
- basic terminology and representation of graph, shortest path algorithm
- sorting and searching algorithms and complexity of these algorithms
- file organization and different types of files
Salient Features: - Concise presentation of data structures with solved and programming problems
- How to write an algorithm and its implementation in C++
- A set of questions with answers are for interviews.
- Sufficient number of problems and questions.
Before solving a problem, a major decision is taken about which data structure will be used to represent the data. In this book, multiple stacks and multiple queues are added to represent more complex data structures.
This book broadly deals with: - data structure, the basic operations and types of data structure
- single and multidimensional arrays and sparse matrices
- concepts, types, and implementation of linked list
- concepts of stacks, recursion and queue, their operations and applications and types
- circular, priority and double ended queues
- concepts of tree and binary search tree
- basic as well as advanced topics of tree
- basic terminology and representation of graph, shortest path algorithm
- sorting and searching algorithms and complexity of these algorithms
- file organization and different types of files
Salient Features: - Concise presentation of data structures with solved and programming problems
- How to write an algorithm and its implementation in C++
- A set of questions with answers are for interviews.
- Sufficient number of problems and questions.
More details
Language
English
Place of publication
New Delhi
India
Publishing group
TechSar Pvt. Ltd
Target group
Professional and scholarly
Dimensions
Height: 240 mm
Width: 160 mm
ISBN-13
978-93-86768-38-4 (9789386768384)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Anil K Ahlawat is currently working with KIET Group of Institutions as Professor & Dean Academics. He is a Gold Medallist in M.Phil from IIT Roorkee, M.Tech in Computer Science & Engineering from Kurukshetra University and Ph.D. from Guru Gobind Singh Indraprastha University, New Delhi in 2009. He has guided 7 Ph.D., 16 M.Tech students and a number of U.G. projects. Currently, he is supervising 8 PhD students. He has more than 20 years of working experience in which he has been delivered his services to AKGEC, BPIT, Amity University, ASET Delhi. He has also been working in a corporate sector as a Software Engineer. He has delivered several lectures for students and faculty in faculty development programmes, seminars, national and international conferences conducted by various institutions/universities. He is a member of IEEE, IETE, IAENG, CSTA, IACSIT, various International Conference Committee of India, France and U.K, IJCSIS, IJCA, IJIEE, IJCTE, ITHEA Bulgaria, etc. He has published four books and more than 80 research papers in international and national journals/conferences. He has performed various roles and responsibilities successfully as a Coordinator (IQAC, NAAC, NBA, Virtual Lab, NMEICT workshop, NPTEL) Chairman of Research council, Centre Superintendent, Head Examiner, HOD, Chief Editor, Subject coordinator, expert member in selection committees and Flying Squad Member. He is honored PRSG member of Virtual lab (IIT Delhi) by MHRD. His present research interests include Machine Learning, Artificial Neural Networks, Artificial Intelligence and Algorithm Design.
Content
- 1. Introduction 8. Graph
- 2. Array 9. Sorting
- 3. Linked List 10. Searching and Hashing
- 4. Stack and Recursion 11. File
- 5. Queue Interview Question with Answers
- 6. Tree Important Question
- 7. Binary Search Tree Index
- 2. Array 9. Sorting
- 3. Linked List 10. Searching and Hashing
- 4. Stack and Recursion 11. File
- 5. Queue Interview Question with Answers
- 6. Tree Important Question
- 7. Binary Search Tree Index