CSE 241 Algorithms and Data Structures
Homework 2
Assigned: 09/18/2013
Due Date: 10/02/2013
You must read and sign the following statement to get credit for this assignment:
I have read and understood the CSE 241 collaboration policy posted on the course
CSE 241 Algorithms and Data Structures
September 9, 2013
Master Method Cheat Sheet
1
Master Method  Formal Version
The Master method applies to many recurrences of the form
n
+ f (n),
b
T (n) = aT
with constants a 1 and b > 1. We assume that there exists
CSE 241 Algorithms and Data Structures
August 26, 2013
Commonly Used Formulae
Series
1.
n
k=
k=1
n(n + 1)
2
2. Sum of squares
n
k2 =
k=1
n(n + 1)(2n + 1)
6
3. Sum of cubes
n
k3 =
k=1
n2 (n + 1)2
4
4. Geometric series
n
xk =
k=0
xn+1 1
x1
5. Geometric seri

1~
(])
I
K ~l+oL+16
l IisY 0f to f:C:;
f\.
;(jOk~o,\
I
I
Ii
 CS" 2. 'i (
Lo 1'1 P vt~
 As
I/j M
!
o+
ptfJ
S;'V;
+~
lA+ro~ot.

SClf/Ave)
+ i(,
15
~() ~+l6J\
I 1\
la.f'JG.
~
kb.b
S'G
lA~.M
U
'
r
P
'I ~Acfw_/L'
II
II (I)
~U"J
kS'1MOhH
CSE 241
Recitation
Probability
TA: Jordan Krage
Date: February 17, 2012
Basic Probability
Sample space of events:
S = cfw_<elementary events>
S is the certain event. Any other event is a subset of S.
Ex: Two coins ipped
S = cfw_HT, T H, HH, T T
Possible
CSE 241 Algorithms and Data Structures
Practice Midterm Solutions
Assigned: October 12, 2013
Problem 1. Solving Recurrences(3 parts) [12 points]
Solve the following recurrences by giving tight notations. For all of them, you may assume
a suitable base cas
CSE 241 Algorithms and Data Structures
Practice Midterm
Assigned: October 12, 2013
Do not open this quiz booklet until you are directed to do so. Read all the instructions on this
page. This quiz is closed book. You may use one handwritten A4 or 8 1 11 c
CSE 241 Algorithms and Data Structures
Practice Exam Solutions
Assigned: November 21, 2013
Here is a collection of problems to help you get some practice for the nal exam. This is not
the correct length of the exam. The format and the length will be simil
CSE 241 Algorithms and Data Structures
Practice Problems for the Final Exam
Assigned: November 17, 2013
Here is a collection of problems to help you get some practice for the nal exam. This is not
the correct length of the exam. The format and the length
CSE 241 Algorithms and Data Structures
Homework 5
Assigned: 11/04/2013
Due Date: 11/25/2013
You must read and sign the following statement to get credit for this assignment:
I have read and understood the CSE 241 collaboration policy posted on the course
CSE 241 Algorithms and Data Structures
Homework 4
Assigned: 10/16/2013
Due Date: 11/04/2013
You must read and sign the following statement to get credit for this assignment:
I have read and understood the CSE 241 collaboration policy posted on the course
CSE 241 Algorithms and Data Structures
Homework 3
Assigned: 10/02/2013
Due Date: 10/16/2013
You must read and sign the following statement to get credit for this assignment:
I have read and understood the CSE 241 collaboration policy posted on the course
CSE 241 Algorithms and Data Structures
Homework 1
Assigned: 09/04/2013
Due Date: 09/18/2013
You must read and sign the following statement to get credit for this assignment:
I have read and understood the CSE 241 collaboration policy posted on the course
CSE 241 Algorithms and Data Structures
September 9, 2013
Recurrences Practice
Recurrences
Use the Master Theorem to asymptotically solve each of the following recurrences for T (n), or state why
the Master Theorem does not apply. In all these problems, as