Introduction to Programming in Java:An Interdisciplinary Approach: United States EditionDescription |
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™ programming language. Interesting applications in these fields foster a foundation of computer science concepts and programming skills that students can use in later courses while demonstrating that computation is an integral part of the modern world.
Ten years in development, this book thoroughly covers the field and is ideal for traditional introductory programming courses. It can also be used as a supplement or a main text for courses that integrate programming with mathematics, science, or engineering.
 |
|
Features |
- Students learn basic computer science concepts in the context of familiar applications from their college preparatory mathematics and science background, creating an appreciation that computer programming is often at the heart of other scientific genres and research.
- The book takes an “objects in the middle” approach where students learn basic control structures and functions, then how to use, create, and design classes.
- The book features a full programming model that includes standard libraries for input, graphics, sound, and image processing that students can apply and use from the beginning.
- An integrated Companion Website features extensive Java™ coding examples, additional exercises, and links to associated Web materials.
|
|
|
Table of Contents |
Chapter 1 Elements of Programming
1.1 Your First Program
1.2 Built-in Types of Data
1.3 Conditionals and Loops
1.4 Arrays
1.5 Input and Output
1.6 Case Study: Random Web Surfer
Chapter 2 Functions and Modules
2.1 Static Methods
2.2 Libraries and Clients
2.3 Recursion
2.4 Case Study: Percolation
Chapter 3 Object-Oriented Programming
3.1 Data Types
3.2 Creating Data Types
3.3 Designing Data Types
3.4 Case Study: N-body Simulation
Chapter 4 Algorithms and Data Structures
4.1 Performance
4.2 Sorting and Searching
4.3 Stacks and Queues
4.4 Symbol Tables
4.5 Case Study: Small World
Context
Index
|
|
|
Author |
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.
|
|
|