Problem Set 2
CSE 373 Fall 2015
Due October 9 2015
1
Notes on Grading.
You can write I dont know for any question and receive 25% credit. You can
take this option for any numbered problem, but not for part of a problem. For
example, you can answer 3.1 an
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 2 Solution Notes
(1). [45 points] Do 3 of the following 4 parts (a)-(d): Devadoss-ORourke: (a). Problem 2.13; (b). Problems
2.19 and 2.20; (c). Problem 2.23; (d). Problem 2.31
CSE373 Fall 2015 Midterm Exam
Name:
SID:
You may not use any reference materials during this exam.
Electronic devices, including calculators, cell phones, mp3 players, and laptops are all prohibited.
You may not use your own scratch paper. The exam has
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 1 Solution Notes
(1). [10 points] Problem 1.16, Devadoss-ORourke: For each polygon in Figure 1.8 (redrawn below),
nd the number of distinct triangulations.
(a). 32
(b). One wa
CSE373 Spring 2016 Midterm Exam Solution
Name:
SID:
You may not use any reference materials during this exam.
Electronic devices, including calculators, cell phones, mp3 players, and
laptops are all prohibited.
You may not use your own scratch paper. T
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 1 Solution Notes
(1). [10 points] Problem 1.16, Devadoss-ORourke: For each polygon in Figure 1.8 (redrawn below),
nd the number of distinct triangulations.
(a). 32
(b). One wa
AMS 345/CSE 355 (Spring, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 1
Due at the beginning of class on Thursday, September 15, 2011.
Required Reading: Devadoss-ORourke, Chapter 1 (sections 1.1-1.3); ORourke, Chapter 1 (sections
1.1-1.2).
Opt
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 2 Solution Notes
(1). [45 points] Do 3 of the following 4 parts (a)-(d): Devadoss-ORourke: (a). Problem 2.13; (b). Problems 2.19 and
2.20; (c). Problem 2.23; (d). Problem 2.31
Problem Set 2
CSE 373 Fall 2015
Due October 9 2015
1
Notes on Grading.
You can write I dont know for any question and receive 25% credit. You can
take this option for any numbered problem, but not for part of a problem. For
example, you can answer 3.1 an
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 3 Solution Notes
(1). [15 points] Assume that we execute Melkmans convex hull algorithm on the vertices of P in the order
v0 , v1 , v2 , v3 , etc. (In the gure, I label vi wit
CSE 373 Analysis of Algorithms
March 3, 2015
Solutions to Midterm 1
P ROBLEM 1
[1] The functions from lowest to highest order:
( 1 )n 6 log log n log n, ln n (log n)2 n1/3 + log n
3
n
log n
n
n n log n n2 , n2 + log n n3 n n3 + 7n5 ( 3 )n 2n n!
2
[2] f1 (
CSE 373 Spring 2010 HW #5
Chao Xu(106978083), Xiaodi Zheng(106718764)
1
The best alignment between the string pairs watch the movie raising Arizona? and watch the mets raze
Arizona? is MMMMMMDSSMMDSSSMMMDDDSSMMMMMMMMM, with a matching cost of 12.
The best
AMS 345 / CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY: Midterm Solution Notes
Statistics: n = 59, = 66.2, median 68, = 21.5; score range: 24-99.
(1). (a). The diagonals that are output when Triangulate is executed on P are given by: (1,3),
(1
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 2
Due at the beginning of class on Tuesday, September 27, 2011.
Required Reading: Devadoss-ORourke, Chapter 2 (sections 2.12.6), and the Appendix (on computational complexity)
CSE 114: Computer Science I
Quiz 11
Fall 2015
Name: _ ID #: _
Assume that a class Account for representing a bank account has these properties: account number,
balance, annual interest rate, and date created, and methods to deposit and withdraw funds. Cre
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 7
Due at the beginning of class on Tuesday, November 22, 2011.
Recommended Reading: ORourke, Chapter 6 (especially sections 6.1-6.5 and 6.7.6).
In all of the exercises, be sur
Answer Key for Homework 2
CSE 373
Analysis of Algorithms
Spring 2013
M. Hadi Kiapour and Dzejla Medjedovic
1
Problem 4-1
Use merge sort to sort the 2n players in O(2n log 2n) O(n log n) based on their talent from
minimum to maximum and put the rst n playe
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 4 Solution Notes
(1). [20 points] Give an example of a monotone simple polygon for which the set of directions with respect to which it is
monotone consists of at least two di
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 7 Solution Notes
(1). [20 points] For each of the following sign vectors, draw an arrangement of 5 distinct lines, cfw_1 , . . . , 5 , that has
a face (either a 2-face (cell),
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 3
Due at the beginning of class on Thursday, October 6, 2011.
Required Reading: Devadoss-ORourke, Chapter 1 (sections 1.11.2), Chapter 3 (section 3.1); ORourke,
Chapter 1 (sec
AMS 345/CSE 355 (Fall, 2011)
Joe Mitchell
COMPUTATIONAL GEOMETRY
Homework Set # 5 Solution Notes
(1). [15 points] (a). Exercise 6.16, Devadoss-ORourke: Verify Eulers formula for the polyhedron in
Figure 6.6.
If we count carefully, we nd F = 76, E = 146, a
CSE 373 Analysis of Algorithms
March 10, 2015
Solutions to HW 2
P ROBLEM 1
[41] Sort the n players by their values, which takes O(n log n). Then simply let the rst n
players to be Team A, the rest to be Team B.
[42]
(a) Simply nd the maximum element a and
CSE 101
Quiz 3, Spring, 2013
Answer all questions. Give informal (at least) proofs for all answers. Grading will be on completeness and
logical correctness, and if applicable, efficiency, as well as correctness. Out of 80 points.
Greedy algorithms For the
Computer Science 373 Analysis of Algorithms
Prof. Steven Skiena
Spring 2015
Homework 4 Combinatorial Search
Due Thursday, April 16, 2015
The real reason we study algorithms is to nd fast ways for solving problems. Analysis gives us a way
of seeing how wel
Lecture 4:
Elementary Data Structures
Steven Skiena
Department of Computer Science
State University of New York
Stony Brook, NY 117944400
http:/www.cs.stonybrook.edu/skiena
Problem of the Day
Find two functions f (n) and g(n) that satisfy the following
re
Lecture 10:
Graph Data Structures
Steven Skiena
Department of Computer Science
State University of New York
Stony Brook, NY 117944400
http:/www.cs.stonybrook.edu/skiena
Sort Yourselves
Sort yourselves in alphabetical order so I can return the
midterms eff
CSG713 Advanced Algorithms
Fall 2004
Dynamic Programming Example
September 27, 2004
Dynamic Programming Solution to the
Coin Changing Problem
(1) Characterize the Structure of an Optimal Solution. The Coin Changing problem exhibits optimal substructure in
Lecture 8:
Mergesort / Quicksort
Steven Skiena
Department of Computer Science
State University of New York
Stony Brook, NY 117944400
http:/www.cs.stonybrook.edu/skiena
Problem of the Day
Give an efficient algorithm to determine whether two sets (of
size m
CSE 373 Analysis of Algorithms
May 15, 2015
Solutions to HW 5
P ROBLEM 1
[Problem 1] (10pts)
Implementation of the edit distance algorithm. Some form of output was expected from the
students showing the edit distance and/or the best alignment between the
CSE 373 Analysis of Algorithms
Michael A. Bender
Name:
Final Exam
Thursday, May 7, 2002
ID #:
INSTRUCTIONS:
This is a closed book, closed notes exam.
You may use either pen or pencil.
Check to see that you have 12 exam pages including this cover.
Look
CSE 373 Analysis of Algorithms
Michael A. Bender
Midterm Exam
March 19, 2002
Name:
ID #:
INSTRUCTIONS
This is a closed book, closed notes exam.
YOU MUST USE PEN, NOT PENCIL.
Check to see that you have 10 pages including this cover and scratch pages.
L