Ship-Ship-Hooray! Free Shipping on $25+ Details >

Cover type: Paperback

Edition: 08

Copyright: 2008

Publisher: Addison-Wesley Longman, Inc.

Published: 2008

International: No

Edition: 08

Copyright: 2008

Publisher: Addison-Wesley Longman, Inc.

Published: 2008

International: No

List price: $105.00

Happy you, happy us. You get 24-hour turnaround. Free shipping on $25+, and dedicated customer service. Cue the smiley faces.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships Today!

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns

Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

List price: $105.00

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships Today!

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns
Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

You Save $73.56 (70%)

$31.44

Condition: Very Good
**100% Satisfaction Guarantee**

We hand-inspect every one of our used books.

We hand-inspect every one of our used books.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Also available in the Marketplace starting at $12.29

Price | Condition | Seller | Comments |
---|

KEY MESSAGE: By emphasizing the application of computer programming not only in success stories in the software industry but also in familiar scenarios in physical and biological science, engineering, and applied mathematics, Introduction to Programming in Java takes an interdisciplinary approach to teaching programming with the Java(TM) programming language. Elements of Programming: Your First Program; Built-in Types of Data; Conditionals and Loops; Arrays; Input and Output. Functions and Modules: Static Methods; Libraries and Clients; Recursion. Object-Oriented Programming Data Types; Creating Data Types; Designing Data Types. Algorithms and Data Structures: Performance; Sorting and Searching; Stacks and Queues; Symbol Tables. For all readers interested in introductory programming courses using the Java programming language.

Chapter 1 Elements of Programming 1.1 Your First Program Programming in Java Input and Output 1.2 Built-in Types of Data Definitions Characters and Strings Integers Floating-point numbers Booleans Comparisons Library methods and APIs Type conversion 1.3 Conditionals and Loops If statements While loops For loops Nesting Applications Infinite loops 1.4 Arrays Arrays in Java Coupon collector Sieve of Eratosthenes Two-dimensional arrays Example: self-avoiding random walks 1.5 Input and Output Birdrsquo;s-eye view Standard output Standard input Redirection and piping Standard drawing Standard audio 1.6 Case Study: Random Web Surfer Input format Transition matrix Simulation Mixing a Markov chain

Chapter 2 Functions and Modules 2.1 Static Methods Using and defining static methods Properties of static methods Implementing mathematical functions Using static methods to organize code Implementing static methods for arrays Example: superposition of sound waves 2.2 Libraries and Clients Using static methods in other programs Libraries Random numbers Input and output for arrays Iterated function systems Standard statistics Modular programming 2.3 Recursion Your first recursive program Mathematical induction Euclidrsquo;s algorithm Towers of Hanoi Function call trees Exponential time Gray codes Recursive graphics Brownian bridge Pitfalls of recursion 2.4 Case Study: Percolation Percolation Basic scaffolding Vertical percolation Testing Estimating probabilities Recursive solution for percolation Adaptive plot

Chapter 3 Object-Oriented Programming 3.1 Data Types Basic definitions Color Digital image processing String processing String-processing application: genomics Input and output revisited Properties of reference types 3.2 Creating Data Types Basic elements of a data type Mutable types Complex numbers Mandelbrot set Commercial data processing Classical OOP example 3.3 Designing Data Types Designing APIs Encapsulation Immutability Spatial vectors Data mining Design-by-contract 3.4 Case Study: N-body Simulation Body data type Universe data type N-body simulation

Chapter 4 Algorithms and Data Structures 4.1 Performance Observations Hypotheses Order of growth classifications Predictions Caveats Performance guarantees Memory 4.2 Sorting and Searching Binary search Insertion sort Mergesort Application: frequency counts Application: longest repeated substring 4.3 Stacks and Queues Pushdown stacks Array implementation Linked lists Array doubling Parameterized data types Stack applications FIFO queues Queue applications Iterable collections Resource allocation 4.4 Symbol Tables API Symbol table clients Binary search trees Performance characteristics of BSTs Traversing a BST Extended symbol table operations Set data type 4.5 Case Study: Small World Phenomenon Graphs Graph data type Graph client example Shortest paths in graphs Small-world graphs

shop us with confidence

Summary

KEY MESSAGE: By emphasizing the application of computer programming not only in success stories in the software industry but also in familiar scenarios in physical and biological science, engineering, and applied mathematics, Introduction to Programming in Java takes an interdisciplinary approach to teaching programming with the Java(TM) programming language. Elements of Programming: Your First Program; Built-in Types of Data; Conditionals and Loops; Arrays; Input and Output. Functions and Modules: Static Methods; Libraries and Clients; Recursion. Object-Oriented Programming Data Types; Creating Data Types; Designing Data Types. Algorithms and Data Structures: Performance; Sorting and Searching; Stacks and Queues; Symbol Tables. For all readers interested in introductory programming courses using the Java programming language.

Table of Contents

Chapter 1 Elements of Programming 1.1 Your First Program Programming in Java Input and Output 1.2 Built-in Types of Data Definitions Characters and Strings Integers Floating-point numbers Booleans Comparisons Library methods and APIs Type conversion 1.3 Conditionals and Loops If statements While loops For loops Nesting Applications Infinite loops 1.4 Arrays Arrays in Java Coupon collector Sieve of Eratosthenes Two-dimensional arrays Example: self-avoiding random walks 1.5 Input and Output Birdrsquo;s-eye view Standard output Standard input Redirection and piping Standard drawing Standard audio 1.6 Case Study: Random Web Surfer Input format Transition matrix Simulation Mixing a Markov chain

Chapter 2 Functions and Modules 2.1 Static Methods Using and defining static methods Properties of static methods Implementing mathematical functions Using static methods to organize code Implementing static methods for arrays Example: superposition of sound waves 2.2 Libraries and Clients Using static methods in other programs Libraries Random numbers Input and output for arrays Iterated function systems Standard statistics Modular programming 2.3 Recursion Your first recursive program Mathematical induction Euclidrsquo;s algorithm Towers of Hanoi Function call trees Exponential time Gray codes Recursive graphics Brownian bridge Pitfalls of recursion 2.4 Case Study: Percolation Percolation Basic scaffolding Vertical percolation Testing Estimating probabilities Recursive solution for percolation Adaptive plot

Chapter 3 Object-Oriented Programming 3.1 Data Types Basic definitions Color Digital image processing String processing String-processing application: genomics Input and output revisited Properties of reference types 3.2 Creating Data Types Basic elements of a data type Mutable types Complex numbers Mandelbrot set Commercial data processing Classical OOP example 3.3 Designing Data Types Designing APIs Encapsulation Immutability Spatial vectors Data mining Design-by-contract 3.4 Case Study: N-body Simulation Body data type Universe data type N-body simulation

Chapter 4 Algorithms and Data Structures 4.1 Performance Observations Hypotheses Order of growth classifications Predictions Caveats Performance guarantees Memory 4.2 Sorting and Searching Binary search Insertion sort Mergesort Application: frequency counts Application: longest repeated substring 4.3 Stacks and Queues Pushdown stacks Array implementation Linked lists Array doubling Parameterized data types Stack applications FIFO queues Queue applications Iterable collections Resource allocation 4.4 Symbol Tables API Symbol table clients Binary search trees Performance characteristics of BSTs Traversing a BST Extended symbol table operations Set data type 4.5 Case Study: Small World Phenomenon Graphs Graph data type Graph client example Shortest paths in graphs Small-world graphs

Publisher Info

Publisher: Addison-Wesley Longman, Inc.

Published: 2008

International: No

Published: 2008

International: No

Chapter 2 Functions and Modules 2.1 Static Methods Using and defining static methods Properties of static methods Implementing mathematical functions Using static methods to organize code Implementing static methods for arrays Example: superposition of sound waves 2.2 Libraries and Clients Using static methods in other programs Libraries Random numbers Input and output for arrays Iterated function systems Standard statistics Modular programming 2.3 Recursion Your first recursive program Mathematical induction Euclidrsquo;s algorithm Towers of Hanoi Function call trees Exponential time Gray codes Recursive graphics Brownian bridge Pitfalls of recursion 2.4 Case Study: Percolation Percolation Basic scaffolding Vertical percolation Testing Estimating probabilities Recursive solution for percolation Adaptive plot

Chapter 3 Object-Oriented Programming 3.1 Data Types Basic definitions Color Digital image processing String processing String-processing application: genomics Input and output revisited Properties of reference types 3.2 Creating Data Types Basic elements of a data type Mutable types Complex numbers Mandelbrot set Commercial data processing Classical OOP example 3.3 Designing Data Types Designing APIs Encapsulation Immutability Spatial vectors Data mining Design-by-contract 3.4 Case Study: N-body Simulation Body data type Universe data type N-body simulation

Chapter 4 Algorithms and Data Structures 4.1 Performance Observations Hypotheses Order of growth classifications Predictions Caveats Performance guarantees Memory 4.2 Sorting and Searching Binary search Insertion sort Mergesort Application: frequency counts Application: longest repeated substring 4.3 Stacks and Queues Pushdown stacks Array implementation Linked lists Array doubling Parameterized data types Stack applications FIFO queues Queue applications Iterable collections Resource allocation 4.4 Symbol Tables API Symbol table clients Binary search trees Performance characteristics of BSTs Traversing a BST Extended symbol table operations Set data type 4.5 Case Study: Small World Phenomenon Graphs Graph data type Graph client example Shortest paths in graphs Small-world graphs