The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
Problem # 2 in the attached document.
Let me know if you need anything else.
CS 577 – Sections 1 and 2Fall 2016Homework #1Due at beginning of class 9/21 and 9/22Rules for Homework.i.) Everyone must do his or her own work. Any sources beyond your class notes andtextbook must be cited. In any case, there must be signifcant “value added” byyour work.ii.) Grading is based on correctness and clarity. In particular, computations andresults need to be explained.1.Considernpoints arranged on a circle, connected by all possible line segments. As-sume they are ingeneral position, which means that no point inside the circle is on morethan two oF the segments. LetR(n) denote the number oF regions (inside the circle) thusFormed.a) ±indR(n) Forn= 0,1,2,3,4,5. You should see a pattern.b) Looks can be deceiving! Show thatR(n+ 1)≤R(n) +O(n3).(1)c) Explain, using induction and the defnition oFO-notation, why your recurrenceimplies thatR(n) =O(n4).Hints: Suppose the frstnpoints are arranged along the upper semicircle. Put the (n+1)-st point near the bottom oF the circle, and connect it to thei-th “old” point. ±ind aFormula For the number oF lines crossed (it should involvenandi), and thereby determinethe number oF new regions created when this line is added. Proving thatR(n) =O(n4)will be aided iF you frst replace theO(n3) in (1) by an explicit Function oFn.
Attachments:
-----------