G22.3520: Honors Analysis of Algorithms
Final Exam, Dec 15, 2008, 1:00-4:30pm
This is a three and a half hour exam.
There are six questions, worth 10 points each. Answer all questions.
Please print your name and SID on the front of the envelope only (n
ALGORITHMS EXAMINATION Department of Computer Science New York University December 18, 2006
This examination is a three hour exam. All questions carry the same weight. Answer all of the following six questions. Please be aware that to pass this exam you n
Written Qualifying Exam Analysis of Algorithms (Fall 2005)
This is a three hour exam. All six questions carry the same weight; however, to pass the exam, you need to provide good answers to several questions: it is not sucient to obtain partial credit on
ALGORITHMS EXAMINATION Department of Computer Science New York University December 17, 2007
This examination is a three hour exam. All questions carry the same weight. Answer all of the following six questions. Please be aware that to pass this exam you
Written Qualifying Exam Analysis of Algorithms
Fall 2004
This examination is a three hour exam. All questions carry the same weight. Answer all of the following six questions. Please be aware that to pass this exam you need to provide good answers to seve
Homework 1
Baochen Wang
#1.
(a) Assume f(n) does not belong to O(g(n), then o( g (n) O( g (n) .
But according the property, o( g (n) O( g (n) . This is contradiction.
So, f(n) belongs to O(g(n).
(b) f(n)=O(g(n), k 0n0n n0 | f (n) | g (n) |
If f (n) O( g (
Polytechnic School of Engineering, NYU
CS6033: Design&Analysis of Algs. IFall 2015
JAB474 Mondays 68:30pm
Prof. Boris Aronov (boris.aronov@nyu.edu)
Oce: 2MTC 10.008 (718) 260-3092
Oce hours: Mondays 35pm and by apt
Homework #1: Preliminaries.
Due Septembe
Polytechnic School of Engineering, NYU Prof. Boris Aronov (boris.aronov@nyu.edu)
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 35pm and by apt
Homework #2
Due September 28, 2015.
By s
Polytechnic School of Engineering, NYU Prof. Boris Aronov (boris.aronov@nyu.edu)
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 35pm and by apt
Homework 3: Mostly Searching.
Due Octobe
Polytechnic School of Engineering, NYU Prof. Boris Aronov (boris.aronov@nyu.edu)
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 35pm and by apt
Homework 4: Search trees.
Due October 13
Honors Algorithms/Written Qualifying Exam
Wednesday, Dec. 22, 2010
1
This is a 3 2 hour examination.
All questions carry the same weight.
Answer all six questions.
Please print your name on the sticky note attached to the outside envelope, and nowhere el
Problem Set 2-3
Solutions
G22.3250-001 Honors Analysis of Algorithms
Problem 1
Let G = (V, E ) be a connected graph and g, h be two edge-cost functions such that for all e, e E ,
h(e) h(e ) g (r) g (e ). Show there is a single tree which is an MST with re
Problem Set 1
Solutions
G22.3250-001 Honors Analysis of Algorithms
Problem 1
An O(n) algorithm that nds the k th integer in an array a = (a1 , . . . , an ) of n distinct integers.
Solution (sketch) :
Basic Idea Using a Pivot: Find an approximate median el
G22.3520: Honors Analysis of Algorithms
Final Exam, Dec 23, 2009, 12:30-4:00pm
This is a three and a half hour exam.
There are six questions, worth 10 points each. Answer all questions and all their subparts.
Your answer to a subpart of a question may
(VERSION WITH ANSWERS)
CORE EXAMINATION
Department of Computer Science
New York University
February 6, 2009
This is the common examination for the M.S. program in CS. It covers core computer science topics: Programming Languages (PL), Operating
Systems (O
(VERSION WITH ANSWERS)
CORE EXAMINATION
Department of Computer Science
New York University
February 6, 2009
This is the common examination for the M.S. program in CS. It covers core computer science topics:
Programming Languages (PL), Operating Systems (O
G22.3520: Honors Analysis of Algorithms
Problem Set 1
Due on Wed, Sept 30, after the class
Collaboration is allowed, but you must write your own solutions. Not all problems need divideand-conquer approach.
Problem 1
Design an O(n) time algorithm that give
G22.3520: Honors Analysis of Algorithms
Problem Set 2+3
Due on Wed, Oct 21, after the class
Collaboration is allowed, but you must write your own solutions.
Problem 1
Suppose G(V, E ) is a connected graph and h : E R is an assignment of costs to its edges
G22.3520: Honors Analysis of Algorithms
Problem Set 4+5
Due on Monday Nov 16, after the class
Collaboration is allowed, but you must write your own solutions.
Problem 1
1. Solve: [Kleinberg Tardos] Chapter 3, problem 2, page 107.
2. Solve: [Kleinberg Tard
G22.3520: Honors Analysis of Algorithms
Problem Set 6+7
Due on Mon Dec 14, after the class
Collaboration is allowed, but you must write your own solutions. Absolutely no extensions.
For all problems, the alphabet = cfw_0, 1.
Problem 1
Solve Problem 4 from
CORE EXAMINATION
(Algorithms Part)
Department of Computer Science
New York University
September 26, 2008
This is the common examination for the M.S. program in CS. It covers three core computer science
topics: Programming Languages, Operating Systems, and
(VERSION WITH ANSWERS)
CORE EXAMINATION
Department of Computer Science
New York University
September 26, 2008
This is the common examination for the M.S. program in CS. It covers three core computer science
topics: Programming Languages, Operating Systems
Polytechnic School of Engineering, NYU Prof. Boris Aronov (boris.aronov@nyu.edu)
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 35pm and by apt
Homework 5: Recurrences. Trees. Other st