Java Foundations with Additional Information on Ethics /
Contributors' John Lewis, Peter j . DePasquale and Joseph Chase
- Custom edition
- Boston: Pearson Custom Publishing, c2008
- xvi, 872 p. : col. ill ; 23 cm.
CHAPTER 1: Introduction 1.1The Java Programming Language 1.2 Program Development 1.3 Problem Solving 1.4 Software Development Activities 1.5 Object-Oriented Programming
CHAPTER 2: Data and Expressions 2.1 Character Strings 2.2 Variables and Assignments 2.3 Primitive Data Types 2.4 Expressions 2.5 Data Conversion Etc.
CHAPTER 3: Using Classes and Objects 3.1 Creating Objects 3.2 The String Class 3.3 Packages 3.4 The Random Class 3.5 The Math Class Etc.
CHAPTER 4: Conditionals and Loops 4.1 Boolean Expressions 4.2 The If Statement 4.3 Comparing Data 4.4 The Switch Statement 4.5 The While Statement Etc.
CHAPTER 5: Writing Classes 5.1 Classes and Objects Revisited 5.2 Anatomy of a Class 5.3 Encapsulation 5.4 Anatomy of a Method Etc.
CHAPTER 6: Graphical User Interfaces 6.1 GUI Elements 6.2 More Components 6.3 Layout Managers 6.4 Mouse and Key Events 6.5 Dialog Boxes Etc.
CHAPTER 7: Arrays 7.1 Array Elements 7.2 Declaring and Using Arrays 7.3 Arrays of Objects 7.4 Command-Line Arguments 7.5 Variable-Length Parameter Lists Etc.
CHAPTER 8: Inheritance 8.1 Creating Sub classes 8.2 Overriding Methods 8.3 Class Hierarchies 8.4 Visibility 8.5 Designing for Inheritances Etc.
CHAPTER 9: Polymorphism 9.1 Late Binding 9.2 Polymorphism Via Inheritance 9.3 Interfaces 9.4 Polymorphism Via Interfaces
CHAPTER 10: Exceptions 10.1 Exception Handling 10.2 Uncaught Exceptions 10.3 The Try-Catch Statement 10.4 Exception Propagation 10.5 The Exception Class Hierarchy
CHAPTER 11: Building, Testing, and Debugging 11.1 Building Larger Applications: JF Mail 11.2 Packages 11.3 Building Java Projects 11.4 Testing 11.5 Debugging
CHAPTER 13: Searching and Sorting 13.1 Searching 13.2 Sorting 13.3 Analysis of Algorithms 13.4 Analyzing Searching and Sorting Algorithm
CHAPTER 14: Collections and Linked Lists 14.1 Introduction to Collections 14.2 A Bag Collection 14.3 An Array Implementation of a Bag 14.4 Linked Lists 14.5 A Linked Implementation of a Bag
CHAPTER 15: Stacks and Queues 15.1 Stacks 15.2 Evaluating Postfix Expressions 15.3 Implementing Stacks with Arrays 15.4 Implementing Stacks with Links 15.5 The Java. util. stack Class Etc.
CHAPTER 16:Trees 16.1 Tree Terminology 16.2 Tree Traversals 16.3 Strategies foe Implementing Trees 16.4 A Binary Tree Implementation 16.5 Decision Trees
CHAPTER 17: Search Trees and Heaps 17.1 Binary Search Trees 17.2 Binary Search Tree Implementation 17.3 Balanced Binary Search Trees 17.4 Heaps 17.5 Heap Implementation 17.6 Heap Sort