- Shopping Bag ( 0 items )
This second edition expands upon the solid, practical foundation established in the first edition of the text. A new four-part organizational structure increases the flexibility of the text, and all material is presented in a straightforward manner accompanied by an array of examples and visual diagrams.
Part 1: Introduction 1. Basic Concepts 2. Recursion Part 2: Linear Lists 3. Stacks 4. Queues 5. General Linear Lists Part 3: Non-Linear Lists 6. Introduction to Trees 7. Binary Search Trees 8. AVL Search Trees 9. Heaps 10. Multiway Trees 11. Graphs Part 4: 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
Posted November 11, 2009
Author is good understandable in reading the beginners mind set. It is really appreciative thing that he reached learners needs through clear representation of concept with templets . Most of the universities are prescribing this book as prescribed for their syllabus.
As a teaching profession i would like to suggest that one thing that the terminology used by the other is for specific countries where as if use global terms to describe the concept and also need simplicity to elevate the target problem and solution for corresponding.
I have read the book for the reference while teaching C-programming for the JNTU Hyderabad,India syllabus.