Advanced Data Structures

Price: 450.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:

9780199487172

Publication date:

12/11/2017

Paperback

Price: 450.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:

9780199487172

Publication date:

12/11/2017

Paperback

First Edition

Advanced Data Structures is designed to serve as a textbook for the advanced course in data structures offered to undergraduate as well as postgraduate students of computer science engineering and information technology. The book aims to introduce the complex and advanced concepts of data structures and illustrate their use in problem solving. It provides a comprehensive introduction to the design and analysis of advanced algorithms and data structures.

Rights:  World Rights

First Edition

Description

Advanced Data Structures is designed to serve as a textbook for the advanced course in data structures offered to undergraduate as well as postgraduate students of computer science engineering and information technology. The book aims to introduce the complex and advanced concepts of data structures and illustrate their use in problem solving. It provides a comprehensive introduction to the design and analysis of advanced algorithms and data structures.

The book first deals with the concepts of sorting and hashing followed by an introduction to binary trees. It then discusses the priority queues, advanced binary search trees, multi-way search trees, and digital search tress. A chapter on graphs is also included at the end of the book.

First Edition

Table of contents

  1. External Sorting
  2. Hashing
  3. Trees
  4. Priority Queues (Heaps)
  5. Efficient Binary Search Trees
  6. Multi-way Search Trees
  7. Digital Search Structures
  8. Graphs

First Edition

Features

  • Provides comprehensive coverage for k-way merge sort, hashing techniques, heaps, AVL trees, red-black trees, B-trees, B+ trees, Patricia, digital search trees, multi-way tries, and graphs.
  • Includes algorithms along with examples for each operation on the various data structures.
  • Provides numerous solved examples and programs using C++ language to illustrate the application and implementation of concepts.
  • Includes plenty of chapter-end exercises such as review questions, multiple-choice questions, fill in the blanks, and true or false questions (with answers) to help readers practise the concepts learnt.
  • Provides two solved model question papers to help students prepare for their university’s examination.


ONLINE RESOURCES
For Faculty:>br/>
  • Chapter-wise PPTs
  • Solutions to select chapter-end exercises

For Students:
  • Projects
  • Quizzes
  • Additional programs

First Edition

First Edition

Description

Advanced Data Structures is designed to serve as a textbook for the advanced course in data structures offered to undergraduate as well as postgraduate students of computer science engineering and information technology. The book aims to introduce the complex and advanced concepts of data structures and illustrate their use in problem solving. It provides a comprehensive introduction to the design and analysis of advanced algorithms and data structures.

The book first deals with the concepts of sorting and hashing followed by an introduction to binary trees. It then discusses the priority queues, advanced binary search trees, multi-way search trees, and digital search tress. A chapter on graphs is also included at the end of the book.

Table of contents

  1. External Sorting
  2. Hashing
  3. Trees
  4. Priority Queues (Heaps)
  5. Efficient Binary Search Trees
  6. Multi-way Search Trees
  7. Digital Search Structures
  8. Graphs