MATH 1 Math, Philosophy, & the Real World
Homework 6
This document is a MS Word form and is for your preparation and records only.
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and saved by the in
MATH 1 Math, Philosophy, & the Real World
Homework 4
This document is a MS Word form and is for your preparation and records only.
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and saved by the in
MATH 1 Math, Philosophy, & the Real World
Homework 5
This document is a MS Word form and is for your preparation and records only.
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and saved by the in
MATH 1 Math, Philosophy, & the Real World
Homework 3
This document is a MS Word form and is for your preparation and records only.
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and saved by the in
MATH 1 Math, Philosophy, & the Real World
Biweekly Recap: Weeks # _
This document is a MS Word form and is for your preparation and records only.
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and
MATH 1 Math, Philosophy, & the Real World
Guest Lecture Report: Guest Lecturer _
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and saved by the instructor.
Some suggestions:
1. Please take the tim
MATH 1 Math, Philosophy, & the Real World
Homework 2
This document is a MS Word form and is for your preparation and records only.
Take as much space as you like. Your answers to the questions below, when submitted
online, will be read and saved by the in
Achraf Golli -1
Achraf Golli
Ms Siphiwe
African Studies I
November 7, 2016
District 9 Source Analysis
In this movie, Neil Blomkamp wanted to talk about humanity. And all the settings in his
movie are just an image from our real world. We, The humans, we c
History
Also known as Duplicating cube or the Delian
problem
Ancient time (Greek mythology)
Comparison to doubling a square or rectangle
Parallel Problems
Squaring a circle (unresolved)
Trisecting an angle (resolved)
Method of Computation
Using Orig
A N e w Look at Euclid's Second Proposition
Godfried Toussaint
There has been considerable interest during the past
2300 years in comparing different models of geometric
computation in terms of their computing power. One
of the most well-known results is
Models of Computation, Straight-Edge and
Compass Algorithms, and Correctness Proofs by
Case Analyses using Euclids Second Proposition as
a Case Study
Godfried Toussaint
New York University Abu Dhabi
Some Models of Computation in Ancient
Greek Geometry
1.
16 Polygon Triangulation
FIGURE 1.15 Cross product parallelogram.
6. Do noncomex polygons have mouths? (Pierre Beauchemin). Dene three consecutive vertices
a, b, c of a polygon to form a month if b is reex and the closed Aabc does not contain any
vertic
Algorithms:
What is this Course About?
Godfried Toussaint
General Description of this course
This Algorithms course concerns the study of precisely defined procedures
(rules) that guarantee finding the correct solution to a problem when they are
followe
Divide & Conquer: Merge Sorting
in O(n log n) Worst-Case Time
Godfried Toussaint
New York University Abu Dhabi
Divide & Conquer In General:
1. Divide a problem into smaller sub-problems.
2. Solve the smaller problems.
3. Combine (
Current State Curre bol Action
5.
m
3
go to the rightmost digit of x
end of x has been read; Right, state 2
sees the leftmost digit of y; Left, state 3
ooks for the rightmost digit of x
erases it; state 4
goes right looking for the leftmost digit of
erase
NYUAD Course CS-AD 105 Algorithms
Assignment-12 (due Monday March 28, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in the next quiz and Midterm-2 exam)
I will ask students at
NYUAD Course CS-AD 105 Algorithms
Assignment-11 (due Monday March 14, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in the next quiz and Midterm-2 exam)
I will ask students at
Haruna Alhassan (haa341)
PROPOSITION: Using a straight edge and a collapsing compass to displace a given line
segment [A, B] to a new location so that one end point, say A, lies on a pre-specified point
C in the plane, and also making sure that the new po
NYUAD Course CS-AD 105 Algorithms
Assignment-10 (due Monday March 7, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in the Midterm-1 exam)
I will ask students at random to prese
Lower Bound on the Complexity of Sorting
Godfried Toussaint
New York University Abu Dhabi
Fundamental Sorting Theorem
Any sorting algorithm that uses only comparisons
between the elements needs at least (n log n)
comparisons to sort
NYUAD Course CS-AD 105 Algorithms
Assignment-7 (due Wednesday February 24, 2016)
(The material in this reading assignment may appear in Quiz-2 on Feb. 24)
1. Reading and Studying:
1. Reference Book on NYU Classes: Computational Geometry in C by
NYUAD Course CS-AD-105 Algorithms Spring 2016
Assignment-2
(due Wednesday February 10, 2016)
(You may be tested on this material in Quiz-1)
1. Reading Assignment (Review of Induction)
2. Text: Introduction to Algorithms: A Creative Approach
NYUAD Course CS-AD 105 Spring 2016 Algorithms
A.
Instructor: Dr. Godfried Toussaint, Office: A2-185, E-mail: [email protected]
Class Hours: Mondays and Wednesdays, 9:15-10:30am
Location: Computational Research Building A
NYUAD Course CS-AD 105 Algorithms
Assignment-6 (due Monday February 22, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in Quiz-2 on Feb. 24)
On Wednesday February 22 I will p
NYUAD Course CS-AD 105 Algorithms
Assignment-14 (due Wednesday March 30, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in the next quiz and Midterm-2 exam)
I will ask studen
NYUAD Course CS-AD 105 Algorithms
Assignment-5 (due Wednesday February 17, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in Quiz-2)
On Wednesday February 17 I will pick a student at ra
NYUAD Course CS-AD 105 Algorithms
Assignment-8 (due Monday February 29, 2016)
(do NOT hand it in: it will NOT be marked you may be tested on this material, including
the reading assignment in the Midterm-1 exam)
I will ask students at random to