This user doesn't have any past courses.

UW / ECE105

3400

Switch calculator between degrees and rads Convert km to m Convert hours to s If the object accelerates in the negative direction, write sum of forces = -ma If F pushes down on object, take that into account when finding the normal force Use k static to see if object moves, and if it does use k kinetic When multiple blocks, start with F = (m1 + m2 + …) a Always include reaction forces on FBD (ex: when object is being acted upon by other block) If block has pulley attached to it, don’t forget to

UW / CS137

4600

Slides 1: Increment counter at the end of while loop Include stdio.h to use scanf or printf Big endian means most significant byte is at lowest memory address Small endian means least significant byte is at lowest memory address When using the table method to convert base 10 to binary, the first 0/1 is the least significant digit (read upwards to write left to right) To get negative number, flip all bits to the left of the first 1 Watch out for overflow when adding signed numbers Precedence: Mul

3100

Slide 1 Increment counter at the end of while loop Include stdio.h to use scanf or printf Big endian means most significant byte is at lowest memory address Small endian means least significant byte is at lowest memory address When using the table method to convert base 10 to binary, the first 0/1 is the least significant digit (read upwards to write left to right) To get negative number, flip all bits to the left of the first 1 Watch out for overflow when adding signed numbers Precedence Multip

2500

CS-137 Notes Every line ends with a semi-colon. To use standard input/output, #include <stdio.h> Run with gcc command in terminal Default output file is a.out \n creates a new line gcc -o (some file name for output) (file to run) printf stands for print formatted don’t forget to return 0 at the end of main if no other return value The Euclidean Algorithm: Look for the greatest common divisor: gcd(num1, num2) When introducing a variable, set an initial value Scanf() reads an integer from the stan

UW / MATH115

2100

When finding the modulus of a complex number z, do not forget the square root! Be explicit about using properties If argument of cos function is negative, drop the negative sign because the function is even When solving for real and imaginary part with a and b, don’t forget the zero complex number! Don’t cancel “a” or “b”, might miss a solution (ex: assign 1 #2) When finding the conjugate of a number with order bj + a, reverse the order first When finding complex roots, put theta and 2kpi on sam

UW / MATH135

8600

If x = 0 is a solution, make sure that 0 is included! (< vs <=) (see A1 #6 a) When negating a statement ion words, don’t forget to use DeMorgan’s law Always plug solutions back into equation to verify Try values of n when general solution is found to linear Diophantine equation Must include absolute value when using BBD Common mistakes: For inductive hypothesis, state the whole thing with k. Don’t just say that P(k) is true State binomial theorem 1 or 2 Don’t forget <= or >= when stating inducti

UW / MATH117

Flip sign of inequality when dividing by negative Cannot have ln of negative number When denominator of partial fraction is hard to factor, look at multiples of constant term and when you find a root, divide by (x – number found) Always factor the denominator as much as possible for partial fractions Polynomials must have positive powers of x, if not then it’s rational F(x) must be one-to-one (on a given domain) to have an inverse function When finding the inverse function and getting +-, use do