Escape sequences

Java (programming language)

Functional Decomposition

Control Structures

Data Abstraction

Documentation and Readability

Static methods

Types

`print` statements

Scanners

Conditional (computer programming)

While loop

Array (data structure)

Object-Oriented Programming (OOP)

ArrayList

Java

Expressions

Scope

Parameters

`Math` class

Information flow

Pseudorandomness

Line-based file input

reference semantics

Constructors

Polymorphism (computer science)

`for` loops

Class constants

Return values

Chaining

Sentinel loops

Token-based file input

Array Traversals

Inheritance (object-oriented programming)

Fields

`println`

Variable (computer_science)

Nested `for` loops

String (computer science)

Cumulative algorithm

Fencepost problems

Boolean

File output

Array Shifting

Instance Methods

Critters

CSE 142 Computer Programming I University of Washington Summer 2022 This introductory course teaches programming using Java. Students learn computational problem-solving techniques, functional decomposition, control structures, data abstraction, and code documentation. No prior programming experience is required. This course provides an introduction to programming using the Java programming language. We will explore common computational problem-solving techniques useful to computer scientists, but also to anyone who has large data sets, repetitive processes or other needs for computation. No prior programming experience is assumed, although students should know the basics of using a computer (e.g., using a web browser and a text editor) and should be comfortable with math through Algebra 1. Students with significant prior programming experience should consider skipping CSE 142 and taking [CSE 143](https://cs.washington.edu/143). CSE 142 is organized around five key learning objectives. At the end of the course, students will be able to do the following:

1. Functionality/Behavior: Write functionally correct Java programs that meet a provided specification and/or solve a specified problem
1. Functional Decomposition: Break down problems into subproblems that are modular and reusable, and define methods to represent those subproblems
1. Control Structures: Select and apply control structures (e.g. methods, loops, conditionals) to manage the flow of control and information in programs
1. Data Abstraction: Select and apply basic data abstractions (e.g. variables, parameters, arrays, classes) to manage and manipulate data in programs
1. Documentation and Readability: Define programs that are well-written, readable, maintainable, and conform to established standards  Recommended textbook: [*Building Java Programs* by Reges and Stepp (5th edition)](https://courses.cs.washington.edu/courses/cse142/22su/textbook.html)

CSE 142 Computer Programming I

Computer Programming

Escape sequence

Escape sequences

1 courses cover this concept

CSE 142 Computer Programming I