CISC621 Algorithm Design and Analysis, Spring 2016
Homework set II, due Thursday, March 17, 7:00pm
Check the homework sheet from the syllabus for general homework details. In particular, each homework solution is on an entirely separate (set of) sheet(s)

Algorithms Prelim 2008 B3
Yifan Peng
B3. Algorithms (25 points)
Do all four parts.
1. (10 points) For each of the following algorithms, describe the main idea/ideas,
and state the running time, if it is not given.
i) Heapsort
Answer. See Algorithms Prelim

Algorithms Prelim 2008 B4
Yifan Peng
B4. Algorithms (25 points)
a) (6 points) Select any 2 of the following 3 items. For each tree that you select
you should describe: the structure of the tree; the order associated with
the items stored in the tree; and

Algorithms Prelim 2008 B1
Yifan Peng
B1. Algorithms (25 points)
Do any 3 of 4 parts. If you answer all 4 parts, only the first 3 will be graded.
Be sure to address all issues raised in each question.
1. First, explain the main idea behind Strassens algori

Solutions to Homework 4
Debasish Das
EECS Department, Northwestern University
ddasnorthwestern.edu
1 Problem 2.23
Denition 1 Majority element of an array A[1 n]: An array is said to have a majority element if more
than half of its entries are the same.
A

Introduction to Algorithms
Massachusetts Institute of Technology
Singapore-MIT Alliance
Professors Erik Demaine, Lee Wee Sun, and Charles E. Leiserson
October 8, 2001
6.046J/18.410J
SMA5503
Handout 18
Problem Set 4 Solutions
MIT students: This problem set

Solution sketches for
CISC621 Algorithm Design and Analysis, Fall 2015
Homework set 2, due Wednesday, October 14, 5:30pm
5. [Individual Problem] We saw that in divide and conquer sorting algorithms, such as
merge sort and quick sort, it pays to shift to i

x <- RandomizedSelect(A,n,i) [deterministic Select(A,n,i)]
Input: Array A of length n, desired rank i in 1.n.
Output: Element x of rank i in A (rank is position the element would have if A were sorted)
cfw_
if (n = 1) return A[1]; / And i must be 1 also.

CISC621 Algorithm Design and Analysis, Spring 2016
Homework set IV, problems 10, 11, 12,13, due Tuesday, May 3, 8:00am
Check the homework sheet from the syllabus for general homework details. In particular, each homework solution is on an entirely separat

CISC621 Algorithm Design and Analysis, Spring 2016
Homework set V, problems 14, 15, 16,17, due Thursday, May 19, 4pm
Check the homework sheet from the syllabus for general homework details. In particular, each homework solution is on an entirely separate

CISC621 Algorithm Design and Analysis, Spring 2016
Homework set I, due Thursday, February 25, 7:00pm
Check the homework rules from the syllabus, including in the homework sheet, for
general homework details. Submit in 201 Smith Hall directly to Fanchao Me

CISC621 Algorithm Design and Analysis, Spring 2016
Homework set III, problems 7,8,9, due Thursday, April 14, 7:00pm
Check the homework sheet from the syllabus for general homework details. In particular, each homework solution is on an entirely separate (

Algorithms Prelim 2008 B2
Yifan Peng
B2. Algorithms (25 points)
Do all three parts.
1. [5 points] Suppose that Dr. Einstein develops a polynomial time algorithm for the problem 3SAT. Carefully explain why this would also mean
that there is a polynomial ti