🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →

Verified Documents at University of Washington

Computer Programming I
University of Washington
Verified Notes

Browse the full collection of course materials, past exams, study guides and class notes for CSE 142 - Computer Programming I at University of Washington verified by our community.

PROFESSORS

All Professors

Brett Wortzman

Verified Documents for Brett Wortzman

Class Notes

Taken by our most diligent verified note takers in class covering the entire semester.

CSE 142 Lecture 1: CSE 142 Lecture 1 Notes

CSE 142 Lecture 1: 1. Introduction to CSE 142

Week 1 class 1 (cid:1005) introduction to cse (cid:1005)4(cid:1006) *jgrasp has good debugging features, which is why it is recommended. **download in

CSE 142 Lecture 2: CSE Lecture 2 Notes

CSE 142 Lecture 2: 2 Introduction to CSE 142

Week 1 class 2 (cid:1006) introduction to cse (cid:1005)4(cid:1006) I(cid:374) refere(cid:374)(cid:272)e to the (cid:862)helloworld(cid:863) program, p

CSE 142 Lecture Notes - Lecture 3: Semicolon

1 public class helloworld { public static void main(string[] args) { - - - jgrasp exec: java helloworld. ** every java code in this class will begin wi

CSE 142 Lecture 3: 3 Expressions

Interactions (cid:862)i(cid:374)tera(cid:272)tio(cid:374)s(cid:863) i(cid:374) jgrasp allo(cid:449) (cid:455)ou to tr(cid:455) out differe(cid:374)t st

CSE 142 Lecture Notes - Lecture 3: Internet Forum, Turnitin

The last time assignment is submitted is considered the time of submission: academic integrity and collaboration, refe(cid:396) to (cid:862)a(cid:272)a

CSE 142 Lecture Notes - Lecture 4: Redundant Code

Therefore, when changing the value of y, the value of x does not change, y = 5; x. Redundant code public class mirror{ public static void main(string[]

CSE 142 Lecture 4: Expressions and For Loops

Interactions:1:1:1:2: cannot find symbol: variabe uy in current context. In java, when everything is an integer, the answer will also be an integer. **

CSE 142 Lecture Notes - Lecture 5: Ascii Art

CSE 142 Lecture Notes - Lecture 6: Redundant Code

1 // before you can run the code that starts in line 5, 2 // you must import this program which allows you to use various graphics. 5 // similar to dra

CSE 142 Lecture 6: Drawing in Java - Basics

Close the file and no(cid:437) you can run your code. 6 public static drawingpanel panel = new drawingpanel(400, 200); Dra(cid:363)ing in ja(cid:362)a

CSE 142 Lecture 7: Drawing in Java with Parameters and For Loops

Close the file and no(cid:437) you can run your code. For loops to create multiple duplicates i(cid:290) dra(cid:363)i(cid:290)g. ja(cid:362)a. // inse

CSE 142 Lecture 8: Animations, Math.max, and Calculations

13 for ( int i = 0; i < 50; i++) { 17 // if you wanna make it slower, make change the 10. Math. max(7, 10, 99) interactions:1:5:1:5: cannot find sym

CSE 142 Lecture Notes - Lecture 9: Prime Number

1 // a program to calculate a student"s overall grade in a course. 3 // notice the use of parameters and return values to capture the. 4 // structure o

CSE 142 Lecture Notes - Lecture 10: Prime Number

October (cid:799)(cid:805)th, (cid:800)(cid:798)(cid:799)(cid:806) - if-else state(cid:289)e(cid:290)ts, & su(cid:289)(cid:289)atio(cid:290) 4 // s

CSE 142 Lecture 11: Information Systems

1 // a program to read in the number of votes each of two candidates received. 4 // this is a bad version of the program that has lots of redundancy an

CSE 142 Lecture Notes - Lecture 12: Gold Base

October (cid:800)(cid:800)nd, (cid:800)(cid:798)(cid:799)8 - string and char, while loops, fencepost loops, & // if you count the letters in washin

CSE 142 Lecture 13: Random

CSE 142 Lecture Notes - Lecture 14: Dont

For ( int i = 0; i < 5; i++) { 1 // this program demonstrates some basic usage of booleans types. Notice the use of good "boolean zen" and the. 3 //

CSE 142 Lecture Notes - Lecture 15: Abracadabra

October (cid:800)(cid:807)th, (cid:800)(cid:798)(cid:799)(cid:806) - more boolea(cid:290)s, assertio(cid:290)s, & midter(cid:289) re(cid:362)ie(cid

CSE 142 Lecture 16: Token Based File Input

CSE 142 Lecture 17: Line-Based File input output files

Nove(cid:289)ber (cid:800)(cid:290)d, (cid:800)(cid:798)(cid:799)8 - toke(cid:290)-based file i(cid:290)put co(cid:290)ti(cid:290)ued & li(cid:290)

CSE 142 Lecture 19: Arrays

1 // this short program calculates the average temperature for a sequence. 2 // of days and reports how many days were above average. 4 // note the use

CSE 142 Lecture 20: Arrays as parameters/return values, Array traversal, & Array tallying

Nove(cid:289)ber (cid:807)th, (cid:800)(cid:798)(cid:799)(cid:806) - arrays as para(cid:289)eters/retur(cid:290) values, array traversal, & 1 // this p

CSE 142 Lecture 22: Reference Semantics, Array Mystery, & Array Tallying

Nove(cid:289)ber (cid:799)4th, (cid:800)(cid:798)(cid:799)8 - refere(cid:290)ce se(cid:289)a(cid:290)tics, array mystery, & array tallyi(cid:290)g.

CSE 142 Lecture Notes - Lecture 23: Imperative Programming, Procedural Programming

November 16th, 2018 - class and objects & instance methods. 7 return math. sqrt(x * x + y * y); 11 return math. sqrt((p. x - x) * (p. x - x) + (p.

CSE 142 Lecture 24: Constructors & Encapsulation

1 // a client program of the point class written in lecture. 2 // this version uses the fully encapsulated and abstracted version. 5 // notice the use

CSE 142 Lecture Notes - Lecture 27: Ratatouille

CSE 142 Lecture Notes - Lecture 28: Cyan

5 // - display as the number of times the sloth. 7 // - move west every third move, staying in the center. 15 // return the color the sloth should appe

CSE 142 Lecture 29: Polymorphism

CSE 142 Lecture Notes - Lecture 30: Infinite Loop

7 // string s = arr[i]; ==> string s = list. get(i); 8 // arr[i] = s; ==> list. set(i, s); 11 // list. add(s) - adds a new element to the end of