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 scienc
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
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
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
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
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
Polytechnic School of Engineering, NYU
CS6033: Design&Analysis of Algs. IFall 2015
JAB474 Mondays 68:30pm
Prof. Boris Aronov ([email protected])
Oce: 2MTC 10.008 (718) 260-3092
Oce hours: Mondays 3
Polytechnic School of Engineering, NYU Prof. Boris Aronov ([email protected])
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 3
Polytechnic School of Engineering, NYU Prof. Boris Aronov ([email protected])
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 3
Polytechnic School of Engineering, NYU Prof. Boris Aronov ([email protected])
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 3
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 q
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
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 stick
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
(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 t
(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 t
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 appr
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 g
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] Ch
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,
(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 s
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) :
Polytechnic School of Engineering, NYU Prof. Boris Aronov ([email protected])
CS6033: Design&Analysis of Algs. IFall 2015
Oce: 2MTC 10.008 (718) 260-3092
JAB474 Mondays 68:30pm
Oce hours: Mondays 3