Data Structure Using C

Anil K Ahlawat

ISBN 10: 9386768380 / ISBN 13: 9789386768384

Published by IK International, 2019

About this Item

Contents: 1. Introduction. 2. Array. 3. Linked list. 4. Stack and recursion. 5. Queue. 6. Tree. 7. Binary search tree. 8. Graph. 9. Sorting. 10. Searching and hashing. 11. File. Interview Question with Answers. Important Question. Index. 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.

Seller Inventory # 132316

Bibliographic Details

• Title: Data Structure Using C
• Publisher: IK International
• Publication Date: 2019
• Language: English
• ISBN 10: 9386768380
• ISBN 13: 9789386768384
• Binding: Soft cover
• Edition: 1st Edition
• Condition: New

About this title

Synopsis

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.