Fundamentals of OOP and Data Structures in Java presents the fundamentals of Object-Oriented Programming (OOP) and Graphical User Interface (GUI) programming with Java as the example language. Wiener and Pinson introduce each of the major data structures with supporting, GUI-based laboratory programs designed to reinforce the basic concepts and principles. These laboratories allow the reader to explore and experiment with the properties of each data structure. All source code for the laboratories is available on the Web. By integrating the principles of OOP and GUI programming, this unique book presents the fundamental issues of data structures within the context of paradigms that are essential to today's professional software developer. The text assumes only an elementary understanding of Java and no experience with OOP.Read more
- Presents and utilizes OOP principles throughout
- All examples employ graphical user interfaces using the latest version of Java
- Comprehensive GUI-based labs allow the reader to experiment with and explore the properties of data structures
Reviews & endorsements
"...a very good approach to introducing the concepts of object-oriented programming...I recommend this book for professionals who want a deeper look at the design of data structures in Java." Computing Reviews
27th May 2015 by KatRollo
Concepts remain relevant nearly 15 years after its first publication. Main points are summarized after each chapter followed by exercises.
Review was not posted due to profanity×
- Date Published: June 2000
- format: Hardback
- isbn: 9780521662208
- length: 482 pages
- dimensions: 261 x 184 x 28 mm
- weight: 1kg
- contains: 140 b/w illus. 9 tables 125 exercises
- availability: Available
Table of Contents
Part I. Foundations:
1. Cornerstones of OO
3. Class construction
4. Relationships between classes
5. GUIs - basic concepts
6. Implementing simple GUIs in Java
7. Errors and exceptions
Part II. Data Structures:
9. Abstract data types
10. Containers as abstract data types
11. Stack and queue
12. Application of stack
14. Trees, heaps and priority queues
15. Search trees
16. Hashing and sets
17. Association and dictionary
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×