Data Structures Using C
Price: 715.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198099307
Publication date:
11/06/2014
Paperback
548 pages
241.0x184.0mm
Price: 715.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198099307
Publication date:
11/06/2014
Paperback
548 pages
241.0x184.0mm
This second edition of Data Structures Using C is designed to serve as a textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications. It provides a comprehensive coverage of the concepts of data structures and their implementation using C language.
Suitable for: A textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications.
Rights: World Rights
Description
This second edition of Data Structures Using C is designed to serve as a textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications. It provides a comprehensive coverage of the concepts of data structures and their implementation using C language. Beginning with an overview of the concepts of C programming the book provides an introduction to different data structures and methods to analyse the complexity of different algorithms. It goes onto connect these concepts and apply them to the study of various data structures such as arrays, strings, linked lists, stacks, queues, trees, heaps, and graphs. In addition, the book includes detailed description of searching and sorting techniques and hashing, and an exclusive chapter on the attributes and organization of files.
Table of contents
chapter 1. Introduction to C
chapter 2. Introduction to Data Structures and Algorithms
chapter 3. Arrays
chapter 4. Strings
chapter 5. Structures and Unions
chapter 6. Linked Lists
chapter 7. Stacks
chapter 8. Queues
chapter 9. Trees
chapter 10. Efficient Binary Trees
chapter 11. Multi-way Search Trees
chapter 12. Heaps
chapter 13. Graphs
chapter 14. Searching and Sorting
chapter 15. Hashing and Collision
chapter 16. Files and Their Organization
Features
- Sections on omega and theta notations, multi-linked lists, forests, 2-3 trees, binary heap implementation of priority queues, interpolation search, jump search, tree sort, bucket hashing, cylinder surface indexing
- Programs on header linked lists, parentheses checking, evaluation of prefix expressions, priority queues, multiple queues, tree sort, file handling , address calculation sort
- Appendices on dynamic memory allocation, garbage collection, backtracking, Johnson's problem
- Key features
- Provides a brush-up of C basics before delving into the analysis of data structures
- Integrates theoretical aspects of data structures with practical implementation of algorithms using tested C programs
- Provides analysis of all major algorithms in terms of their running times
- Makes use of numerous algorithms, programs, and illustrations to explain the concepts
- Provides numerous end-chapter exercises varying widely in type and difficulty
- ONLINE RESOURCES
- For Faculty
- PowerPoint slides
- Projects
- For Students
- Projects
- Additional C programs
- Interview and quiz questions
Description
This second edition of Data Structures Using C is designed to serve as a textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications. It provides a comprehensive coverage of the concepts of data structures and their implementation using C language. Beginning with an overview of the concepts of C programming the book provides an introduction to different data structures and methods to analyse the complexity of different algorithms. It goes onto connect these concepts and apply them to the study of various data structures such as arrays, strings, linked lists, stacks, queues, trees, heaps, and graphs. In addition, the book includes detailed description of searching and sorting techniques and hashing, and an exclusive chapter on the attributes and organization of files.
Read MoreTable of contents
chapter 1. Introduction to C
chapter 2. Introduction to Data Structures and Algorithms
chapter 3. Arrays
chapter 4. Strings
chapter 5. Structures and Unions
chapter 6. Linked Lists
chapter 7. Stacks
chapter 8. Queues
chapter 9. Trees
chapter 10. Efficient Binary Trees
chapter 11. Multi-way Search Trees
chapter 12. Heaps
chapter 13. Graphs
chapter 14. Searching and Sorting
chapter 15. Hashing and Collision
chapter 16. Files and Their Organization
