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). Probl
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 fo
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
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
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
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 (sectio
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). Probl
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 orde
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
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 fo
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 MMMMMMDSSMMDSSS
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
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
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 secti
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 resp
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
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.
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
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
Figu
P1: OSO/OVY
das23402 Ch05
P2: OSO/OVY
QC: OSO/OVY
T1: OSO
GTBL020-Dasgupta-v10
July 28, 2006
Chapter 5
Greedy algorithms
A game like chess can be won only by thinking ahead: a player who is focused
en
Divide-and-Conquer Method, Searching and Sorting
1
Introduction
Divide-and-conquer In divide-and-conquer method, a problem is divided into one or more subproblems,
each subproblem is solved recursivel
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 h
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
Lecture 1:
Introduction to Algorithms
Steven Skiena
Department of Computer Science
State University of New York
Stony Brook, NY 117944400
http:/www.cs.stonybrook.edu/skiena
Syllabus / Course Mechanics
Lecture 14:
Shortest Paths
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
Suppose we are give
Lecture 19:
Introduction to NP-Completeness
Steven Skiena
Department of Computer Science
State University of New York
Stony Brook, NY 117944400
http:/www.cs.stonybrook.edu/skiena
Reporting to the Boss
Lecture 2:
Asymptotic Notation
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
The knapsack pr
Lecture 3:
Program Analysis
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
For each of the fo
SUNY at Stony Brook
CSE 373 Analysis of Algorithms
Midterm 1
October 4, 2016
Midterm Exam
Name:
ID #:
Signature:
Circle one: GRAD / UNDERGRAD
INSTRUCTIONS:
This is a closed book, closed mouth exam.
CS663: Computational Geometry
Matrix-Searching and its Applications
Lecturer: Prof. Asish Mukhopadhyay
Scribe: Sudipta Sengupta (93280)
1
Introduction
The farthest pairs problem was discussed in the c