Synopses & Reviews
Inspired by the success of their best-selling introductory programming text, Java Software Solutions, authors Lewis, DePasquale, and Chase now release Java Foundations, Second Edition. This text is a comprehensive resource for instructors who want a two-or three-semester introduction to programming textbook that includes detail on data structures topics. Java Foundations introduces a Software Methodology early on and revisits it throughout to ensure students develop sound program development skills from the beginning. Control structures are covered before writing classes, providing a solid foundation of fundamental concepts and sophisticated topics.
Synopsis
CourseSmart Save money. Lighten your backpack. Access your textbooks anytime, from anywhere.
This title is available as an eTextbook from CourseSmart. Purchase your assigned textbook as a CourseSmart eTextbook, and stop lugging books around campus! You can also access CourseSmart eTextbooks from your iPhone.
Instructors, request your exam copies online and get instant access. Learn more at coursesmart.com.
Synopsis
This package contains the following components:
-0321304276: Addison-Wesley's Java Backpack Reference Guide
-0132128810: Java Foundations: Introduction to Program Design and Data Structures
About the Author
John Lewis is the co-author of the best-selling introductory Java programming book
Java Software Solutions , as well as
Java Software Structures ,
Programming with Alice and Java , and books for AP computer science. He teaches courses at both Virginia Tech and Radford University. He received his Ph.D. degree from Virginia Tech.
Peter DePasquale is an assistant professor of computer science at the College of New Jersey (TCNJ). He is the author of Addison-Wesley’s Java Backpack Reference Guide and Addison-Wesley’s C++ Backpack Reference Guide as well as Programming with Alice and Java.
Joe Chase is an associate professor of computer science at Radford University. He is the co-author of Java Software Structures and Java Software Structures for AP* Computer Science AB .
Table of Contents
1. Introduction
2. Data and Expressions
3. Using Classes and Objects
4. Conditionals and Loops
5. Writing Classes
6. Graphical User Interfaces
7. Arrays
8. Inheritance
9. Polymorphism
10. Exceptions
11. Recursion
12. Analysis of Algorithms
13. Searching and Sorting
14. Stacks
15. Queues
16. Trees
17. Binary Search Trees
18. Heaps and Priority Queues
19. Graphs
20. Hashing
21. Databases