TCSS 543: Advanced Algorithms
Fall 2015, Homework #1
Due: Wednesday, October 7
Submit the solution via canvas. Both word documents and pdf les will be accepted. Total 10
points.
For each problem, make sure you have acknowledged all persons with whom you w

University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Empirical Study Project
Due: Monday, March 9, 2015, 4:15pm
Due: Wednesday, March 11, 2015, 4:15pm
Winter 2015
February 11, 2015
Overview
In this project, you will be conducting an empirical st

Additional Problems for Reviewing Fundamental
Algorithm Design and Analysis Techniques
Divide and Conquer
1. Use the method of repeated substitution to solve the recurrence equations that correspond to
the large integer multiplication algorithm and Strass

TCSS 343
Mathematics Review: Exponents, Logarithms, and Summations
Exponents
XA XB = XA+B
XA / XB = XA-B
(XA)B = XAB
XN + XN = 2XN
2N + 2N = 2N+1
Logarithms
Definition: XA = B if and only if logX B = A.
If the base of the logarithm is not specified, then

Page 1 of 7
Name (Last, First): _
University of Washington, Tacoma
TCSS 543: Advanced Algorithms
Donald Chinn
March 19, 2013
FINAL EXAM
This test is 125 minutes long. Closed book, no calculators. You may use one sheet
(8.5 x 11, both sides) of notes for r

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 day specified. Any
homework turned in after the deadlin

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 following list of functions of n and arrange them in ascendin

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, no calculators. You may use one sheet
(8.5 x 11, both s

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 to 50 do
k k + 1
c.
k 0
for i 1 to n do
for j 1 to i2 d

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 exam.
The blank space left for your answers is roughly

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.
You are expected to work alone on this problem. No disc

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 exam.
The blank space left for your answers is roughly

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. This is a 60 minute exam.
The blank space left for your a

Algorithms and Pseudocode: Tips and Exercises
Donald Chinn (April 27, 2008)
This document provides some tips and exercises for students to express algorithms in
pseudocode. Pseudocode is the language of algorithms (not C, C+, Java, or any other
real progr

Notes on NP and Efficient Certifiers
TCSS 543, February 26, 2015
Donald Chinn
Here are some notes that summarize what was discussed in lecture regarding the class of
problems NP.
First, some key definitions:
A computational problem consists of a descripti

Shortest Path Algorithms
Given a graph G = (V, E) and a
distinguished vertex s, find the
shortest weighted path from s to
every other vertex in G.
weighted path length of v1, v2,
, vN:
N1
c
i ,i 1
i
1
, where ci,j is the cost
of edge (vi, vj)
applicat

TCSS 543: Advanced Algorithms
Fall 2015, Homework #2
Due: Wednesday, October 21
Submit the solution via canvas. Both word documents and pdf les will be accepted. Total 10
points.
For each problem, make sure you have acknowledged all persons with whom you

NAME:
University of Washington Tacoma
TCSS 543: Design and Analysis of Algorithms
Martine De Cock
Midterm #1, Thu Oct 29, 2009
This test is closed book and closed notes. You do not need a calculator.
Double-check that your exam copy consists of 5 pages

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 (n/2)
= 4T (n/4) + nl g (n/2) + 2(n/2)l g (n/4)
= 8T (

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 computer science students to understand this fundamenta

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 and place: MW 1:30-3:35 CP 108.
Office hours: noon 1:00

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 Qs and
long Qs. We will have 2 long Qs.
Covers the foll

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 problem).
For each problem, make sure you have acknowledg

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 computer science students to understand this fundamenta

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 :
n
logb a
logb n 1
j 0
n logb a
ab
logb a
b
j
k

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 found)
low 0
high data.length - 1
while low <= high do

Merge Two Sorted Arrays
merge operation:
Given two sorted arrays, merge
produces a sorted array with all
the elements of the two arrays.
A
4
13 18 21
B
C
6
4
8
9
6
8
9
13 18 20 21
20
Running time of merge: O(N), where N
is the number of elements in the