Introduction to Programming in Java · Computer Science Intro to Programming 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: PageRank 2. Functions 2.1 Static Methods 2.2 Libraries and Clients 2.3 Recursion 2.4 Case Study: Percolation 3. OOP 3.1 Using Data Types 3.2 Creating Data Types 3.3 Designing Data Types 3.4 Case Study: N-Body 4. 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 Computer Science 5. Theory of Computing 5.1 Formal Languages 5.2 Turing Machines 5.3 Universality 5.4 Computability 5.5 Intractability 9.9 Cryptography 6. A Computing Machine 6.1 Representing Info 6.2 TOY Machine 6.3 TOY Programming 6.4 TOY Virtual Machine 7. Building a Computer 7.1 Boolean Logic 7.2 Basic Circuit Model 7.3 Combinational Circuits 7.4 Sequential Circuits 7.5 Digital Devices Beyond 8. Systems 8.1 Library Programming 8.2 Compilers 8.3 Operating Systems 8.4 Networking 8.5 Applications Systems 9. Scientific Computation 9.1 Floating Point 9.2 Symbolic Methods 9.3 Numerical Integration 9.4 Differential Equations 9.5 Linear Algebra 9.6 Optimization 9.7 Data Analysis 9.8 Simulation Related Booksites Web Resources FAQ Data Code Errata Lectures Appendices A. Operator Precedence B. Writing Clear Code C. Glossary D. TOY Cheatsheet E. Matlab Online Course Java Cheatsheet Programming Assignments Programming in Java · Computer Science · An Interdisciplinary Approach textbooks for a first course in computer science for the next generation of scientists and engineers Online content. This booksite contains tens of thousands of files, fully coordinated with our textbook and also useful as a standalone resource. It consists of the following elements: Execepts. A condensed version of the text narrative, for reference while online. Lectures. Curated studio-produced online videos, suitable for remote instruction. Java code. Hundreds of easily downloadable Java programs and our I/O libraries for processing text, graphics, and sound. Data. Real-world data sets for testing code (ours and yours). Exercises. Selected exercises from the book and “web exercises” developed since its publication, along with solutions to selected exercises. Programming assignments. Creative programming assignments that we have used at Princeton. You can explore these resources via the sidebar at left. Introduction to Programming in Java. Our textbook Introduction to Programming in Java [ Amazon · Pearson · InformIT ] is an interdisciplinary approach to the traditional CS1 curriculum with Java. We teach the classic elements of programming, using an “objects-in-the-middle” approach that emphasizes data abstraction. We motivate each concept by examining its impact on specific applications, taken from fields ranging from materials science to genomics to astrophysics to internet commerce. The book is organized around four stages of learning to program: Chapter 1: Elements of Programming introduces variables; assignment statements; built-in types of data; conditionals and loops; arrays; and input/output, including graphics and sound. Chapter 2: Functions highlights the idea of dividing a program into components that can be independently debugged, maintained, and reused. Chapter 3: Object-Oriented Programming emphasizes the concept of a data type and its implementation, using Java's class mechanism. Chapter 4: Algorithms and Data Structures discusses classical algorithms for sorting and searching, and fundamental data structures, including stacks, queues, and symbol tables. Computer Science. Our textbook Computer Science [ Amazon · Pearson · InformIT ] contains Introduction to Programming in Java as its first four chapters. The second half of the book explores core ideas of Turing, von Neumann, Shannon, and others that ignited the digital age. Chapter 5: Theory of Computing surveys the fundamental concepts of universality, computability, and intractability, which raise questions about the role of computation in understanding the natural world. Chapter 6: A Computing Machine describes a simple imaginary machine that has many of the characteristics of real processors at the heart of the computational devices that surround us. Chapter 7: Building a Computer considers the design of a processor, including Boolean logic, combinational circuits, and sequential circuits. Reading a book and surfing the web are two different activities: This booksite is intended for your use while online (for example, while programming and while browsing the web); the textbook is for your use when initially learning new material and when reinforcing your understanding of that material (for example, when reviewing for an exam). For teachers: This online content. Everything on these pages is freely available. We ask only that you adhere to normal academic traditions of attribution if you adapt this content in your own course. One best practice is to just provide links to our pages. To use the lecture videos. Please go to the Lectures tab at left for links to all the online videos and suggestions on how to use them. To adopt the textbook. You can request an examination copy or email the authors for more information. ACM/IEEE cites COS 126 as a course exemplar. Lecture slides (in Keynote format) are available by request for instructors who adopt the textbook. For students: This online content. Whether your course uses our book or not, you can reinforce your understanding of many topics related to the study of algorithms by browsing the excerpts, code, and exercises here, watching the lecture videos, and/or using our book as a reference. Java code. Please go to the Code tab at left for instructions on setting up a Java programming environment, installing our standard libraries, and downloading all of our code. Lecture videos. Please go to the Lectures tab at left for links to all the online videos and suggestions on how to use them. Online course. You can take our free Coursera MOOCs Computer Science: Programming with a Purpose and Computer Science: Algorithms, Theory, and Machines. Python. We also have a Python version of Chapters 1–4 of our textbook. Last modified on September 04, 2020. Copyright © 2000–2019 Robert Sedgewick and Kevin Wayne. All rights reserved.
