A Practical Introduction to Data Structures and Algorithm Analysis (3rd Edition)

http://pictures.abebooks.com/isbn/9780136609117-us-300.jpg

File Size: 2.10 Mb

Description
We study data structures so that we can learn to write more efficient programs. But why must programs be efficient when new computers are faster every year? The reason is that our ambitions grow with our capabilities. Instead of rendering efficiency needs obsolete, the modern revolution in computing power and storage capability merely raises the efficiency stakes as we computerize more complex tasks.

The quest for program efficiency need not and should not conflict with sound design and clear coding. Creating efficient programs has little to do with “programming tricks” but rather is based on good organization of information and good algorithms. A programmer who has not mastered the basic principles of clear design is not likely to write efficient programs. Conversely, “software engineering” cannot be used as an excuse to justify inefficient performance. Generality in design can and should be achieved without sacrificing performance, but this can only be done if the designer understands how to measure performance and does so as an integral part of the design and implementation process. Most computer science curricula recognize that good programming skills begin with a strong emphasis on fundamental software engineering principles. Then, once a programmer has learned the principles of clear program design and implementation, the next step is to study the effects of data organization and algorithms on program efficiency.

Content:-
Preface
I: Preliminaries
1. Data Structures and Algorithms
2. Mathematical Preliminaries
3. Algorithm Analysis
II: Fundamental Data Structures 4. Lists, Stacks, and Queues
5. Binary Trees
6. Non-Binary Trees
III: Sorting and Searching 7. Internal Sorting
8. File Processing and External Sorting
9. Searching
10. Indexing
IV: Advanced Data Structures 11. Graphs
12. Lists and Arrays Revisited
13. Advanced Tree Structures
V: Theory of Algorithms 14. Analysis Techniques
15. Lower Bounds
16. Patterns of Algorithms
17. Limits to Computation
Bibliography
Index 

Author Details
"Clifford A. Shaffer"




Download Drive-1

You May Also Like These E-Books:-

No comments:

Post a Comment