Techniques and Applications
Rs.325
Rs.276
15%
Rs.48
(15%)
Out Of Stock
Description
Intended for a course on Data Structures at the UG level, this title details concepts, techniques, and applications pertaining to the subject in a lucid style. Independent of any programming language, the text discusses several illustrative problems to reinforce the understanding of the theory. It offers a plethora of programming assignments and problems to aid implementation of Data Structures.Key Features :
Lucid Language: Language used is easy to comprehend and the text steers clear of complicated formalisms, case in point being the coverage of Trees.
Exhaustive coverage: Separate chapters for Binary Search Trees and AVL Trees, B-Trees and Tries, and Red Black Trees and Splay Trees.
Example driven approach: After a brief introduction to the topic, the text applies these concepts using solved examples and algorithms. Eg. Infix, Prefix, and PostFix Expressions.
Use of Pseudocodes: Will provide students with flexibility in terms of language of implementation.
Unique Feature: ADT for each Data Structure has been discussed in a separate section at the end of every chapter.
Breakup of Examples and Problems
Solved Examples: 124
Review Questions: 215
Illustrative Problems: 133
Programming Assignments: 74
Illustrations: 369
The table of contents has been organized in a manner that it sits in agreement with a typical course on Data Structures
Features separate section on Abstract Data Types for all important Data Structures
Pseudocode approach gives students algorithms for implementing data structures which are equally applicable for any language (C/C++/Java)
Exhaustive Online Learning Center as against none provided by Tenenbaum's or Sahni's titles
Easy language at use
Table of Content :
Preface
Chapter 1. Introduction
Chapter 2. Analysis Of Algorithms
PART I: SEQUENTIAL LINEAR DATA STRUCTURES
Chapter 3. Arrays
Chapter 4. Stacks
Chapter 5. Queues
PART II: LINKED LINEAR DATA STRUCTURES
Chapter 6. Linked Lists
Chapter 7. Linked Stacks And Linked Queues
PART III: NON LINEAR DATA STRUCTURES
Chapter 8. Trees And Binary Trees
Chapter 9. Graphs
PART IV: ADVANCED DATA STRUCTURES
Chapter 10. Binary Search Trees And Avl Trees
Chapter 11. B Trees And Tries
Chapter 12. Red Black Trees And Splay Trees
Chapter 13. Hash Tables
Chapter 14. File Organizations
PART V: SEARCHING AND SORTING
Chapter 15. Searching
Chapter 16. Internal Sorting
Chapter 17. External Sorting
Index
Features
- : Techniques and Applications
- : Tata Mcgraw Hill
- : 0070667268
- : 9780070667266
- : Paperback
You may also be interested in
Look for Similar Items by Category
Disclaimer
Shipped by Infibeam.comThe following policies apply for the above product which would be shipped by Infibeam.com
1. Infibeam accept returns if the item shipped is defective or damaged
2. In case of damaged or defective product, the customer is required to raise a concern and ship the product back to us within 15 days from delivery
3. Return shipping costs will be borne by Infibeam.com
4. Infibeam will send a replacement unit as soon as the return package is received
5. Infibeam does not offer any cash refunds
Contact Us |
Others |
My Account |
Help |
Payment Options
 |
Powered by infibeam