=
HW6 P1 (Total: 25 points)
=
(pick one)
0 Incorrect Proof
10 Not specifying the edge that we want to take instead of e (can't just pick any one from the cycle)
15 Almost correct proof
25 Correct
=
HW6 P2 (Total: 25 points)
=
(partial points available)
10
Homework #1
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, February 4rd, 5pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessmen
Problem Points
1 (13 pts)
Breakdown
13 Full Correctness Proof
* Cannot have lower th
-1 Assumed QuickSort Partition is O(1)
-3 O(log_cfw_3/2 n )!= O(log_cfw_4/3 n )
-6 Does not consider asymptotic case, only specific cases
-8 Incomplete Proof (did not pro
Problem 1
1.1, 1.5 pts each
0.5 correct answer
1.0 correct argument
1.2, 10.0 pts
5.0 correctly proved big O
5.0 correctly proved big Omega
Problem 2
2.1, 10.0 pts
2.0 base case of induction
8.0 the rest of the induction
2.2, 15.0 pts
1, 3.0
Homework #7
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Apr 4th, 11:59pm Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessment
Please ty
Homework #7 Solutions
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Apr 4th, 11:59pm Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessment
Homework #3
Sanghyun Choi (schoi60)
February 18th, 2016
1
Problem 1 (13 points)
Lets say that a pivot provides x|n x separation if x elements in an array are
smaller than the pivot, and n x elements are larger than the pivot.
Suppose Bob knows a secret wa
Homework #3
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, Feb 18th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessmen
Homework #2
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, February 11th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student asse
Homework #2
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, February 11th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student asse
Homework #6
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, March 24th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessm
Homework #6
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, March 24th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessm
Homework #3
Solutions
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, Feb 18th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student
Solutions
Homework #1
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, February 4rd, 5pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student
Homework #5
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, March 3rd, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessme
Homework #9
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Friday, Apr 29, 11:59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessment
Pl
Quiz #2
Introduction to Algorithms/Algorithms 1
600.363/463
Tuesday, April 2nd, 9-10.15am
Ethics Statement
I agree to complete this exam without unauthorized assistance from any person, materials, or device.
Name
Signature
Date
1
Problem 1 (20 points)
In
Homework #8
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, March 24th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessm
Solutions
Homework #4
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, Feb 25th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student
Homework #6
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, March 24th, 11.59pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under student assessm
Solutions
Homework #2
Introduction to Algorithms/Algorithms 1
600.363/463
Spring 2016
Due on: Thursday, February 11th, 5pm
Late submissions: will NOT be accepted
Format: Please start each problem on a new page.
Where to submit: On blackboard, under studen
Quiz #2
Introduction to Algorithms/Algorithms 1
600.363/463
April 7th, 9:00-10:15am
Ethics Statement
I agree to complete this exam without unauthorized assistance from any person, materials, or device.
Signature
Date
1
Problem 1 (20 points)
Define a stron
15-451/651: Design & Analysis of Algorithms
Lecture #7: Hashing
September 15, 2016
last changed: September 15, 2016
Hashing is a great practical tool, with an interesting and subtle theory too. In addition to its use as
a dictionary data structure, hashin
600.463 Introduction to Algorithms / Algorithms I
Topic: Dynamic Programming I
11.1
Lecturer: Michael Dinitz
Date: 10/6/16
Introduction
Dynamic programming can be very confusing until youve used it a bunch of times, so the best way
to learn it is to simpl
600.463 Introduction to Algorithms / Algorithms I
Topic: Probabilistic Analysis, randomized quicksort
3.1
Lecturer: Zeyu Zhang
Date: 9/8/16
Introduction
As we discussed the first lecture, one issue with trying to do an average-case analysis of an
algorith
600.463 Introduction to Algorithms / Algorithms I
Topic: Sorting lower bound and Linear-time sorting
5.1
Lecturer: Michael Dinitz
Date: 9/15/16
Introduction
You should all know a few ways of sorting in O(n log n) time, most notably mergesort and heapsort
600.463 Introduction to Algorithms / Algorithms I
Topic: Basic Graph Algorithms
13.1
Lecturer: Michael Dinitz
Date: 10/13/16
Introduction
Graphs are an incredibly important abstraction in computer science, so there has been a huge
amount of work on algori
600.463 Introduction to Algorithms / Algorithms I
Topic: Linear time selection/median
4.1
Lecturer: Michael Dinitz
Date: 9/13/16
Announcements
1. First homework due right now.
2. Second homework released today, due in a week.
4.2
Introduction and Problem
600.463 Introduction to Algorithms / Algorithms I
Topic: Asymptotic Analysis, recurrences
2.1
Lecturer: Zeyu Zhang
Date: 9/6/16
Notes
Homework 1 will be released today, and is due a week from today by the beginning of class.
Submit online via Gradescope.