Data Structures and Problem Solving Using Java
Pearson (Verlag)
978-0-201-54991-1 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Data Structures and Problem Solving Using Java teaches data structures and algorithms from the perspective of abstract thinking and problem solving. In this text, experienced author and educator Mark Allen Weiss takes a unique approach by clearly separating the specification and implementation of data structures. Dr. Weiss presents the interface and running time of data structures in Part II of the book. Then, he provides the opportunity for students to use the data structures in a variety of practical examples before introducing the implementations in Part IV. By first gaining a familiarity with the interfaces and uses of data structures, readers will be able to think more abstractly about the subject matter. Features *Contains extensive sample code using Java 1.1, which is available over the Internet and has been tested and reviewed by a professional programmer for accuracy. *Provides an introduction to Java in Part I and also covers Graphical User Interfaces (GUI's) in an appendix. *Includes pedagogical aids such as margin notes and comprehensive end-of-chapter material to help readers grasp challenging concepts.*
Offers flexibility in topic coverage by minimizing dependencies among the different chapters. 0201549913B04062001
Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley. 0201549913AB04062001
Part I: Tour of Java 1. Basic Java 2. Objects and Classes 3. Inheritance 4. Graphical User Interfaces Part II: Algorithms and Building Blocks 5. Algorithm Analysis 6. Data Structures 7. Recursion 8. Sorting Algorithms 9. Randomization Part III: Applications 10. Fun and Games 11. Stacks and Compilers 12. Utilities 13. Simulation 14. Graphs and Paths Part IV: Implementations 15. Stacks and Queues 16. Linked Lists 17. Trees 18. Binary Search Trees 19. Hash Tables 20. A Priority Queue: The Binary Heap Part V: Advanced Data Structures 21. Splay Trees 22. Merging Priority Queues 23. The Disjoint Set Class Appendices
| Erscheint lt. Verlag | 4.12.1997 |
|---|---|
| Sprache | englisch |
| Maße | 197 x 241 mm |
| Gewicht | 1410 g |
| Themenwelt | Informatik ► Programmiersprachen / -werkzeuge ► Java |
| Mathematik / Informatik ► Informatik ► Web / Internet | |
| ISBN-10 | 0-201-54991-3 / 0201549913 |
| ISBN-13 | 978-0-201-54991-1 / 9780201549911 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
