Introduction to Programming in Java An Interdisciplinary Approach

by ;
  • ISBN13:


  • ISBN10:


  • Edition: 1st
  • Format: Paperback
  • Copyright: 2007-07-17
  • Publisher: Pearson
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $104.80 Save up to $56.12
  • Buy Used
    Add to Cart Free Shipping


Supplemental Materials

What is included with this book?

  • The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


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 Programmingtakes an interdisciplinary approach to teaching programming in Javatrade;. Basic Elements of Programming:Your First Program; Built-in Types of Data; Conditionals and Loops; Arrays; Input and Output.Functions:Static Methods; Libraries and Clients; Recursion.Object-Oriented Programming: Data Types; Implementing Classes; Encapsulation; Inheritance.Algorithms and Data Structures:Performance; Sorting and Searching; Stacks and Queues; Symbol Tables. For all readers interested in introductory programming courses using Javatrade;.

Author Biography

Robert Sedgewick teaches in the Department of Computer Science at Princeton University. His primary areas of research are analytic combinatorics and the design, analysis, and implementation of algorithms. He is the author of a widely-used series on algorithms published by Addison-Wesley Professional. Sedgewick is on the Board of Directors for Adobe Systems Incorporated.

Kevin Wayne also teaches in the Department of Computer Science at Princeton University. His research focuses on theoretical computer science, especially optimization and the design, analysis, and implementation of computer algorithms. Wayne received his PhD from Cornell University.

Table of Contents

Elements of Programming
Your First Program Programming in Java Input and Output
Built-in Types of Data Definitions Characters and Strings Integers Floating-point numbers Booleans Comparisons Library methods and APIs Type conversion
Conditionals and Loops If statements While loops For loops Nesting Applications Infinite loops
Arrays Arrays in Java Coupon collector Sieve of Eratosthenes Two-dimensional arrays Example: self-avoiding random walks
Input and Output Birds-eye view Standard output Standard input Redirection and piping Standard drawing Standard audio
Case Study: Random Web Surfer Input format Transition matrix Simulation Mixing a Markov chain
Functions and Modules
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
Libraries and Clients Using static methods in other programs Libraries Random numbers Input and output for arrays Iterated function systems Standard statistics Modular programming
Recursion Your first recursive program Mathematical induction Euclids algorithm Towers of Hanoi Function call trees Exponential time Gray codes Recursive graphics Brownian bridge Pitfalls of recursion
Case Study: Percolation Percolation Basic scaffolding Vertical percolation Testing Estimating probabilities Recursive solution for percolation Adaptive plot
Object-Oriented Programming
Data Types Basic definitions Color Digital image processing String processing String-processing application: genomics Input and output revisited Properties of reference types
Creating Data Types Basic elements of a data type Mutable types Complex numbers Mandelbrot set Commercial data processing Classical OOP example
Designing Data Types Designing APIs Encapsulation Immutability Spatial vectors Data mining Design-by-contract
Case Study: N-body Simulation Body data type Universe data type N-body simulation
Algorithms and Data Structures
Performance Observations Hypotheses Order of growth classifications Predictions Caveats Performance guarantees Memory
Sorting and Searching Binary search Insertion sort Mergesort Application: frequency counts Application: longest repeated substring
Stacks and Queues Pushdown stacks Array implementation Linked lists Array doubling Parameterized data types Stack applications FIFO queues Queue applications Iterable collections Resource allocation
Symbol Tables API Symbol table clients Binary search trees Performance characteristics of BSTs Traversing a BST Extended symbol table operations Set data type
Case Study: Small World Phenomenon Graphs Graph data type Graph client example Shortest paths in graphs Small-world graphs
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review