Data Structures : A Pseudocode Approach with C / Richard F. Gilberg and Behrouz A. Forouzan
Material type:
- 9788131503140
- 23rd 005.72 GIL
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Reference Book | VIT-AP General Stacks | Reference | 005.72 GIL (Browse shelf(Opens below)) | Not For Loan (Restricted Access) | CSE | 019789 | ||
Text Book | VIT-AP General Stacks | 005.72 GIL (Browse shelf(Opens below)) | Checked out to ROHAN PRASANTH (24BCB7160) | CSE | 2025-05-21 | 019790 | ||
Text Book | VIT-AP General Stacks | 005.72 GIL (Browse shelf(Opens below)) | Checked out to G SRIHARI (23BCB7055) | CSE | 2024-03-19 | 019791 | ||
Text Book | VIT-AP General Stacks | 005.72 GIL (Browse shelf(Opens below)) | Checked out to AKSHITA SHARMA (24BCB7103) | CSE | 2025-05-17 | 019792 | ||
Text Book | VIT-AP General Stacks | 005.72 GIL (Browse shelf(Opens below)) | Checked out to S Sudhakar Llango S (70087) | CSE | 2024-03-12 | 019793 |
Features:
Simplifies learning the design of algorithms using pseudocode with this non-theoretical and practical approach to teaching * Eases into a solid working knowledge of data structures by deemphasizing the use of formal mathematical proofs * Enhances students? knowledge of the C programming language through building algorithms and trees. * Reinforces concepts learned with fully updated exercises and projects at the end of every chapter
Table of Contents:
* Part I: Introduction 1. Basic Concepts 2. Recursion * Part II: Linear Lists 3. Stacks 4. Queues 5. General Linear Lists * Part III: Non-Linear Lists 6. Introduction to Trees 7. Binary Search Trees 8. AVL Search Trees 9. Heaps 10. Multiway Trees 11. Graphs * Part IV: Sorting and Searching 12. Sorting 13. Searching * Appendices A: ASCII Tables B: Structure Charts C: Integer and Float Libraries D: Selected C Libraries E: Mathematical Series and Recursive Relations F: Array Implementations of Stacks and Queues
There are no comments on this title.