|
|
||
![]() |
||
| HELP | ||
|
$114.50
New Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN:Introduction to Programming in Java: An Interdisciplinary Approachby Robert Sedgewick
Synopses & ReviewsPublisher Comments: 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. 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. About the AuthorRobert 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 ContentsChapter 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 What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Related Aisles | |||||||||
|
| ||||||||||
|
|
||||||||||