Data Structures Using C++
Price: 900.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:
9780198066231
Publication date:
06/02/2012
Paperback
820 pages
243.0x187.0mm
Price: 900.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:
9780198066231
Publication date:
06/02/2012
Paperback
820 pages
243.0x187.0mm
Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications. The book aims to provide a comprehensive coverage of all the topics related to data structures
Suitable for: Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications.
Rights: World Rights
Description
Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications. The book aims to provide a comprehensive coverage of all the topics related to data structures.
The book begins with a discussion on the fundamentals of data structures and algorithms, and moves on to the concepts of linear data structures, stacks, recursion, queues, and searching and sorting. All the elements of data structures, such as linked lists, trees, graphs, hashing, heaps, and indexing, are covered in separate chapters in detail. The chapter on files explains file management and organization using C++ and the chapter on the standard template library provides detailed coverage of entities such as containers and iterators.
Written in a simple manner with strong pedagogy including numerous multiple choice and review questions, the book also provides programming problems at the end of every chapter.
Table of contents
Chapter 1. Fundamental Concepts
Chapter 2. Linear Data Structure Using Arrays
Chapter 3. Stacks
Chapter 4. Recursion
Chapter 5. Queues
Chapter 6. Linked Lists
Chapter 7. Trees
Chapter 8. Graphs
Chapter 9. Searching and Sorting
Chapter 10. Search Trees
Chapter 11. Hashing
Chapter 12. Heaps
Chapter 13. Indexing and Multiway Trees
Chapter 14. Files
Chapter 15. Standard Template Library
Chapter 16. Algorithm Analysis and Design
Features
- Provides a thorough overview of the fundamental concepts
- Includes numerous algorithms and program codes in C++ to illustrate the topics discussed
- Provides several illustrations and flowcharts to help understand the subject effectively
- Contains glossary and summary at the end of every chapter for a quick recapitulation
Description
Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications. The book aims to provide a comprehensive coverage of all the topics related to data structures.
The book begins with a discussion on the fundamentals of data structures and algorithms, and moves on to the concepts of linear data structures, stacks, recursion, queues, and searching and sorting. All the elements of data structures, such as linked lists, trees, graphs, hashing, heaps, and indexing, are covered in separate chapters in detail. The chapter on files explains file management and organization using C++ and the chapter on the standard template library provides detailed coverage of entities such as containers and iterators.
Written in a simple manner with strong pedagogy including numerous multiple choice and review questions, the book also provides programming problems at the end of every chapter.
Read MoreTable of contents
Chapter 1. Fundamental Concepts
Chapter 2. Linear Data Structure Using Arrays
Chapter 3. Stacks
Chapter 4. Recursion
Chapter 5. Queues
Chapter 6. Linked Lists
Chapter 7. Trees
Chapter 8. Graphs
Chapter 9. Searching and Sorting
Chapter 10. Search Trees
Chapter 11. Hashing
Chapter 12. Heaps
Chapter 13. Indexing and Multiway Trees
Chapter 14. Files
Chapter 15. Standard Template Library
Chapter 16. Algorithm Analysis and Design
