U NIVERSITY OF WASHINGTON , TACOMA , I NSTITUTE OF T ECHNOLOGY
Advanced Algorithms Homework 1
Sina Khankhajeh
October 14, 2015
1 QUESTION 1
Now using telescopic method we have:
T (n) = 2T (n/2) + nl g
Page 1 of 5
Name (Last, First): _
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Donald Chinn
January 29, 2013
MIDTERM 1
This test is CLOSED book and CLOSED notes. This is a 60 minute
11/22/17
Midterm 2
Median = 14.5
Mean = 14.2
Graded out of 18
1
TCSS 543
Advanced Algorithms
Ka Yee Yeung
[email protected]
Institute of Technology, UW-Tacoma
11/22/2017
2
Network Flow: Empirical Stud
Page 1 of 6
Name (Last, First): _
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Donald Chinn
February 23, 2015
MIDTERM 2 SAMPLE SOLUTIONS
This test is CLOSED book and CLOSED notes. Th
Page 1 of 5
Name (Last, First): _
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Donald Chinn
February 26, 2013
MIDTERM 2
This test is CLOSED book and CLOSED notes. This is a 65 minute
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Donald Chinn
January 30, 2015
MIDTERM 1 BONUS
Due: Wednesday, February 4, at 4:15pm.
The following question is a midterm bonus question.
Nested Loop Analysis Exercises
For each code fragment below, what is its running time (big-Oh)? Explain your answer.
a.
k 0
for i 1 to 100 do
for j 1 to n do
k k + 1
b.
k 0
for i 1 to 2000 do
for j i
Page 1 of 7
Last Name: _ First Name:_
University of Washington, Tacoma
TCSS 343: Design and Analysis of Algorithms
Donald Chinn
December 8, 2014
FINAL EXAM
This test is 125 minutes long. Closed book,
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Homework #1
Due date: Monday, January 12, 2015, 4:15pm
Winter 2015
January 5, 2015
Regular problems (to be turned in):
1. Take the follow
Page 1 of 6
Name (Last, First): _
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Donald Chinn
January 26, 2015
MIDTERM 1 SAMPLE SOLUTIONS
This test is CLOSED book and CLOSED notes. Thi
11/15/17
Midterm 2, 11/20 (Mon)
On paper.
Closed book. Closed notes.
One cheat sheet allowed.
A4 sized. Double-sided ok.
MUST be hand-written.
No calculators. No computers. No phones. No
tablet
Worksheet Basics of Algorithm Analysis
TCSS543
Exercises on the use of big-oh notation and the limit test
1. The definition-based algorithm for multiplication of two n-by-n matrices requires M1 (n) =
10/7/17
Ch. 5 Divide-and-Conquer
Divide-and-conquer.
Break up problem into several parts.
Solve each part recursively.
Combine solutions to sub-problems into overall solution.
Most common usage.
11/29/17
TCSS 543
Clustering
Ka Yee Yeung
[email protected]
Institute of Technology, UW-Tacoma
11/27/2017
1
Overview
What is clustering?
Applications.
Definition of pairwise similarity.
Algorithmic appro
11/9/17
TCSS543
NP and Computa2onal Intractability
(8.1) Polynomial-Time Reduc9ons
(8.2) Reduc9ons via Gadgets: The Sa9sability
Problem
(8.3) Ecient Cer9ca9on and the Deni9on of NP
computationa
10/14/17
Midterm 1, 10/23 (Monday)
Will be proctored by Nick McKinney
On paper.
Closed book. Closed notes.
One cheat sheet allowed.
A4 sized. Double-sided ok.
MUST be hand-written.
No calculators.
11/29/17
TCSS 543
Sequence Alignment
An example of dynamic programming
Ka Yee Yeung
[email protected]
Institute of Technology, UW-Tacoma
11/29/2017
1
How does my genome look like?
2
Background: what is
11/5/17
Application of Max Flow
(Ch. 7.5) Maximum Bipartite
Matching
1
Bipartite Graphs
A graph V is bipartite if V can be partitioned into V1,
V2 such that all edges go between V1 and V2
An undir
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Homework #2
Due: Tuesday, January 22, 2013, 1:30pm
Winter 2013
January 15, 2013
Written homework is due at the beginning of class on the
Average-case analysis of binary search
Donald Chinn
Algorithm BinarySearch (data, key):
Input: a sorted array of integers (data) and a key (key)
Output: the position of the key in the array (-1 if not
Master Theorem
Case 1:
f (n) O(n logb a ) for some 0.
logb n 1
Then
a f
j
n
bj
j 0
c
logb n 1
aj
j 0
n logb a
bj
for some constants c, n0 , for all n n0
Now we compute the value of the summation :
A Short Guide to Algorithm Analysis and Big-Oh
Donald Chinn
September 27, 2007
One of the concepts computer science majors have difficulty understanding is that of bigOh notation. It is important for
TCSS 543: Advanced Algorithms
Fall 2015, Homework #3
Due: Monday, November 9
Submit the solution via canvas. Both word documents and pdf les will be accepted. Total 10
points (+ 3 points from bonus pr
10/18/15
Midterm 1, 10/28 (Wed)
On paper.
Closed book. Closed notes.
No calculators. No computers. No phones. No
tablets.
Time allowed: 1:30 - 3:35pm.
We will have 2 types of questions: short Q
University of Washington, Tacoma
TCSS 543B: Advanced Algorithms
Course Organization
Fall 2015
September 28, 2015
Instructor:
Ka Yee Yeung
CP 232
[email protected]
Course web site: canvas.uw.edu
Class time