Java Foundations : Introduction to Program Design and Data Structures

by Lewis, John; DePasquale, Peter; Chase, Joseph

• ISBN13: 9780321429728
• ISBN10: 0321429729
• Edition: 1st
• Format: Paperback w/CD
• Copyright: 2008-01-01
• Publisher: Addison Wesley

Summary

KEY MESSAGE: Inspired by the success their best-selling introductory programming text,Java Software Solutions,authors Lewis, DePasquale, and Chase now releaseJava Foundations.Their newest text is a comprehensive resource for instructors who want a two-semester introduction to programming textbook that includes data structures topics.Java Foundationsintroduces a Software Methodology early on and revisits it throughout to ensure students develop sound program development skills from the beginning.MARKET: For all readers interested in introductory programming using the Javatrade; programming language.

Table of Contents

Introduction

The Java Programming Language

Program Development

Problem Solving

Software Development Activities

Object-Oriented Programming

Data and Expressions

Character Strings

Variables and Assignment

Primitive Data Types

Expressions

Data Conversion

Reading Input Data

Using Classes and Objects

Creating Objects

The String Class

Packages

The Random Class

The Math Class

Formatting Ouput

Enumberated Types

Wrapper Classes

Conditionals and Loops

Boolean Expressions

The if Statement

Comparing Data

The switch Statement

The while Statement

Iterators

The do Statement

The for Statement

Writing Classes

Classes and Objects Revisited

Anatomy of a Class

Encapsulation

Anatomy of a Method

Static Class Members

Class Relationships

Method Design

Method Overloading

Graphical User Interfaces

GUI Elements

More Components

Layout Managers

Mouse and Key Events

Dialog Boxes

Some Important Details

GUI Design

Arrays

Array Elements

Declaring and Using Arrays

Arrays of Objects

Command-line Arguments

Variable-Length Parameter Lists

Two-Dimensional Arrays

Inheritance

Creating Subclasses

Overriding Methods

Class Hierarchies

Visibility

Designing for Inheritance

Polymorphism

Late Binding

Polymorphism via Inheritance

Interfaces

Polymorphism via Interfaces

Exceptions

Exception Handling

Uncaught Exceptions

The try-catch Statement

Exception Propagation

The Exception Class Hierarchy

I/O Exceptions

Building, Testing, and Debugging

Building Larger Applications: JFMail

Packages

Building Java Projects

Testing

Debugging

Recursion

Recursive Thinking

Recursive Programming

Using Recursion

Searching and Sorting

Searching

Sorting

Analysis of Algorithms

Analyzing Searching and Sorting Algorithms

Collections and Linked Lists

Introduction to Collections

A Bag Collection

An Array Implementation of a Bag

Linked Lists

A Linked Implementation of a Bag

Stacks and Queues

Stacks

Evaluating Postfix Expressions

Implementing Stacks with Arrays

Implementing Stacks with Links

The java.util.Stack Class

Queues

Radix Sort

Implementing Queues with Arrays

Implementing Queues with Circular Arrays

Implementing Queues with Links

Analysis of Stack and Queue Implementations

Trees

Tree Terminology

Tree Traversals

Strategies for Implementing Trees

A Binary Tree Implementation

Decision Trees

Search Trees and Heaps

Binary Search Trees

Binary Search Tree Implementation

Balance Binary Search Trees

Heaps

Heap Implementation

Heap Sort

Graphs

Undirected Graphs

Directed Graphs

Weighted Graphs

Common Graph Algorithms

Strategies for Implementing Graphs

Appendixes

Glossary

Number Systems

The Unicode Character Set

Java Operators

Java Modifiers

Java Graphics

Jav

Table of Contents provided by Publisher. All Rights Reserved.