Data Structures and Algorithms with Object Oriented Design Pattern / Bruno R. Preiss
Material type:
- 9788126516438
- 23rd 005.73 PRE
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | Course reserves | |
---|---|---|---|---|---|---|---|---|---|
Text Book | VIT-AP General Stacks | Reference | 005.73 PRE (Browse shelf(Opens below)) | Not For Loan | CSE | 01908 | |||
Text Book | VIT-AP General Stacks | 005.73 PRE (Browse shelf(Opens below)) | Available | CSE | 01909 | ||||
Text Book | VIT-AP General Stacks | 005.73 PRE (Browse shelf(Opens below)) | In transit from VIT-AP to School of Computer Science Section since 2024-08-16 | CSE | 01910 | ||||
Text Book | VIT-AP General Stacks | 005.73 PRE (Browse shelf(Opens below)) | In transit from VIT-AP to School of Computer Science Section since 2024-08-16 | CSE | 01911 | ||||
Text Book | VIT-AP General Stacks | 005.73 PRE (Browse shelf(Opens below)) | In transit from VIT-AP to School of Computer Science Section since 2025-02-22 | CSE | 01912 |
It includes Appendix, Bibliography and Index Pages
Bruno Preiss presents readers with a modern, object-oriented perspective for looking at data structures and algorithms, clearly showing how to use polymorphism and inheritance, and including fragments from working and tested programs. The book uses a single class hierarchy as a framework to present all of the data structures. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively. · Algorithm Analysis · Asymptotic Notation · Foundational Data Structures · Data Types and Abstraction · Stacks, Queues and Deques · Ordered Lists and Sorted Lists · Hashing, Hash Tables and Scatter Tables · Trees · Search Trees · Heaps and Priority Queues · Sets, Multisets and Partitions · Dynamic Storage Allocation · Algorithmic Patterns and Problem Solvers · Sorting Algorithms and Sorters · Graphs and Graph Algorithms
There are no comments on this title.