Mathematics Masters Examination
|
|
- Douglas Hampton
- 6 years ago
- Views:
Transcription
1 Mathematics Masters Examination OPTION 4 March 30, 2004 COMPUTER SCIENCE 2 5 PM NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each of the fourteen numbered questions is worth 20 points. All questions will be graded, but your score for the examination will be the sum of your scores on your eight best questions. Please observe the following: DO NOT answer two or more questions on the same sheet (not even on both sides of the same sheet). DO NOT write your name on any of your answer sheets. You will be given separate instructions on the use of these answer sheets. When you have completed a question, place it in the large envelope provided. Spring 04 CS 1/4
2 1. Computer Algorithms Given an array A of n elements, we wish to find the k largest in sorted order using the following 3 algorithms. Find their (worst-case) running-times in terms of n and k. (a) MergeSort A and list k largest. (b) Build a max-heap and call EXTRACT-MAX k times (c) SELECT the k largest number, partition around that number and sort the k largest numbers. Let G =(V,E) be a directed graph with V = n and E = m. Suppose that each vertex u V is labelled with a unique integer L(u) from the set {1, 2,...,n}. For each u V, let R(u) ={v V : u v} be the set of the vertices that can be reached by a directed path starting from u. Define min(u) to be the vertex in R(u) whole label is minimum. Give an O(n + m)-time algorithm that computes min(u) for all vertices u V. Programming Language Design C++ uses pointers to elements of type (say) E as a common alternative to indexes when accessing elements of arrays. Give at least one reason in favor of this scheme and one reason against it (observe that the scheme has been abandoned in Java). C++ (at least most versions) does not guard against a pointer going out of bounds of an array it is indexing. Why not? Could such a check be put into the language as a modification? What would be the cost of doing so? Combinatorics Consider a rectangular box with distinct dimensions. Color the 12 edges B, W, or R. Find the number of inequivalent colorings with 4B, 4W, and 4R edges. Colorings are equivalent with respect to rotations of the box. (Note that since the dimensions are distinct, the rotation must use an angle of 180 degrees and the axis must join the middle of opposite faces.) Find the number of permutations of 1, 2,...,6 in which 1 and 2 are in positions 3,4,5,6; 3 and 4 are in positions 1,2,5,6; and 5 and 6 are in positions 1,2,3,4. Graph Theory All graphs are simple and undirected. Let H be a subgraph of K n,n with more than (k 1)n edges. Prove that H has a matching of size k. Spring 04 CS 2/4
3 7. Theory of Computation Let Σ = {0, 1}. Construct a DFA for the following language: L = {w w does not contain the substring 00, and w is even}. 8. Explain and justify your construction. Notes: w is the length of w, and substring means a sequence of consecutive symbols. Let Σ = {0, 1, #}. Construct a CF grammar generating the following language: L = {w # x#w R w, x {0, 1} } Explain and justify your construction. Symbolic Computation Explain the difference between Int and int in Maple. Give an example to illustrate why we need a command like Int. Numerical Analysis Consider the matrix A = with inverse A 1 = E E E E E E E E E E E E E E E E E E Estimate the condition number of A using. 1 (the maximum column sum) as norm. 2. For this given matrix A, we now consider the linear system Ax = b, for any general right-hand side vector b, and we forget about the inverse A 1. What is the relation between the relative error on the solution x to Ax = b and the relative error on A? Use cond(a) in your answer. If we want to know the first eight decimal places of x, how accurately must we know A? Justify your answer. Spring 04 CS 3/4
4 11. Suppose we want to approximate the first derivative f (x 0 ) of some function f(x) at the point x Show that the forward-difference approximation using step h>0 is only a first-order approximation in h for f (x 0 ). 2. Develop extrapolation formulas to compute a third-order approximation in h for f (x 0 ), cutting the step h in half each time Computational Geometry A Star-shaped polygon (SSP) is a simple polygon all of whose interior is visible from at least one point in the polygon s interior. We shall call such a point a point of total visibility (PTV). It is clear that a star-shaped polygon need not be convex. The Kernel of a SSP is a region of its interior containing all of its PTV s. Observe that if the SSP happens to be convex, its kernel will span the entire interior of the SSP. Outline a proof sketch that the kernel of a SSP is a convex polygon inside the SSP. (Hint: Start with a 4-sided polygon with vertex angles 3 of which are convex, turning to the right in a clockwise traversal of the polygon (just like a convex polygon) and 1 of which is reflex (turning to the left). Draw the kernel of this polygon. Now consider how the kernel is constrained when there are several reflex angles. For instance, draw the kernel when there are two reflex angles.) Error-Correcting Codes and Cryptography A binary code C is described by its parity-check matrix H = (a) How would you encode the messages m 1 = 0000 and m 2 = 1101? (b) How would you decode the received vectors v 1 = and v 2 = ? (c) Find the parameters n, k, and d for C. 14. In a public-key cryptosystem using RSA, you intercept the cryptogram C = 10 sent to a receiver whose public key is e = 5 and n = 35. Find the integer M that was sent. Spring 04 CS 4/4
5 Solutions to the Mathematics Masters Examination OPTION 4 March 30, 2004 COMPUTER SCIENCE 2 5 PM NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each of the fourteen numbered questions is worth 20 points. All questions will be graded, but your score for the examination will be the sum of your scores on your eight best questions. Please observe the following: DO NOT answer two or more questions on the same sheet (not even on both sides of the same sheet). DO NOT write your name on any of your answer sheets. You will be given separate instructions on the use of these answer sheets. When you have completed a question, place it in the large envelope provided. Spring 04 CS 1/9
6 1. Computer Algorithms Given an array A of n elements, we wish to find the k largest in sorted order using the following 3 algorithms. Find their (worst-case) running-times in terms of n and k. (a) MergeSort A and list k largest. (b) Build a max-heap and call EXTRACT-MAX k times. (c) SELECT the k largest number, partition around that number and sort the k largest numbers. Solution: (a) Sorting costs n log n and listing costs k. Total O(n log n). (b) Building a max-heap cost n and extracting k times costs k log n. Total O(n + k log n). (c) Selecting and partitioning costs n and sorting costs k log k. Total is O(n + k log k). 2. Let G =(V,E) be a directed graph with V = n and E = m. Suppose that each vertex u V is labelled with a unique integer L(u) from the set {1, 2,...,n}. For each u V, let R(u) ={v V : u v} be the set of the vertices that can be reached by a directed path starting from u. Define min(u) to be the vertex in R(u) whole label is minimum. Give an O(n + m)-time algorithm that computes min(u) for all vertices u V. Solution: Compute G T in the usual way, so that G T is G with its edges reversed. Then do a depth-first search on G T, but in the main loop of DFS, consider the vertices in order of increasing values of L(v). If vertex u is in the depth-first tree with root v, then min(u) =v. Clearly, this algorithm takes O(V + E) time. Spring 04 CS 2/9
7 3. Programming Language Design C++ uses pointers to elements of type (say) E as a common alternative to indexes when accessing elements of arrays. Give at least one reason in favor of this scheme and one reason against it (observe that the scheme has been abandoned in Java). C++ (at least most versions) does not guard against a pointer going out of bounds of an array it is indexing. Why not? Could such a check be put into the language as a modification? What would be the cost of doing so? Solution: The indexing can be done, at the target level, with no checking and no conversion of an integer index when the elements of the array occupy other than 1 word. It is thus extremely efficient. There is no conversion from an integer to an index, as would be the case for an integer used as an index on an array whose elements are types occupying more than one word. It is easy to implement in the compiler the generation of target code that will check each pointer applied to an array as an index, in order to ensure that the pointer is in bounds. This requires a run-time check each time the pointer is used as an index on an array, and obliges the use of a separate pointer for each array accessed, which is annoying when (say) two arrays of identical size are being accessed by the same index value. The result is a classic trade-off between efficiency and security. With today s fast processors, the right way is almost always to opt for security, unless every extra cycle needs to be squeezed from the computer. Spring 04 CS 3/9
8 Combinatorics Consider a rectangular box with distinct dimensions. Color the 12 edges B, W, or R. Find the number of inequivalent colorings with 4B, 4W, and 4R edges. Colorings are equivalent with respect to rotations of the box. (Note that since the dimensions are distinct, the rotation must use an angle of 180 degrees and the axis must join the middle of opposite faces.) Solution: P 6 = 1 4 (z z6 2 ), with z 1 = B + W + R and z 2 = B 2 + W 2 + R 2. The coefficient of B 4 W 4 R 4 in 1 4 ((B + W + R)12 +3(B 2 + W 2 + R 2 ) 6 ) is 1 4 (( 12 4, 4, 4 ) ( , 2, 2 )) = Find the number of permutations of 1, 2,...,6 in which 1 and 2 are in positions 3,4,5,6; 3 and 4 are in positions 1,2,5,6; and 5 and 6 are in positions 1,2,3,4. Solution: (1+4z +2z 2 ) 3 =1+12z +54z z z 4 +48z 5 +8z 6. Then the answer is 6! 12 5! ! 112 3! ! 48 1! + 8 0! = 80. Graph Theory All graphs are simple and undirected. Let H be a subgraph of K n,n with more than (k 1)n edges. Prove that H has a matching of size k. Solution: Each vertex covers at most n edges, hence the minimum number of vertices needed to cover all the edges of H is at least k. By the König-Egerváry theorem, the maximum size of a matching in H is equal to the minimum size of a vertex cover. From this the result follows. Spring 04 CS 4/9
9 7. Theory of Computation Let Σ = {0, 1}. Construct a DFA for the following language: L = {w w does not contain the substring 00, and w is even}. Explain and justify your construction. Notes: w is the length of w, and substring means a sequence of consecutive symbols. Solution: ,1 0, Let Σ = {0, 1, #}. Construct a CF grammar generating the following language: L = {w # x#w R w, x {0, 1} }. 9. Explain and justify your construction. Solution: S 0 S 0 1 S 1 S S # A # A A 0 A 1 ɛ Symbolic Computation Explain the difference between Int and int in Maple. Give an example to illustrate why we need a command like Int. Solution: 1. Int is the inert Maple command: it just displays the integral, but does not attempt to evaluate the integral, this is done by int. 2. Quite often, a symbolic antiderivative does not exist, and then we must resort to numerical approximation. The command evalf(int(f(x),x=a..b)) immediately computes such a numerical approximation, without first trying to compute a symbolic antiderivative. Spring 04 CS 5/9
10 10. Numerical Analysis Consider the matrix A = with inverse A 1 = E E E E E E E E E E E E E E E E E E Estimate the condition number of A using. 1 (the maximum column sum) as norm. 2. For this given matrix A, we now consider the linear system Ax = b, for any general right-hand side vector b, and we forget about the inverse A 1. What is the relation between the relative error on the solution x to Ax = b and the relative error on A? Use cond(a) in your answer. If we want to know the first eight decimal places of x, how accurately must we know A? Justify your answer. Solution: Condition number of A: 1. cond(a) = A 1 A 1 1. Since A 1 1 and A , cond(a) Let x be the system Āx = b, where Ā is the given A, known with limited precision. Then the relative error on x is estimated by x x x cond(a) A Ā. A For x x to be less than 10 8, A Ā must be less than 10 18, because the condition x A number amplifies errors on A with a factor of Thus we must know A with at least 18 decimal places accurately to be sure of the first eight decimal places in x. Spring 04 CS 6/9
11 11. Suppose we want to approximate the first derivative f (x 0 ) of some function f(x) at the point x Show that the forward-difference approximation using step h>0 is only a first-order approximation in h for f (x 0 ). 2. Develop extrapolation formulas to compute a third-order approximation in h for f (x 0 ), cutting the step h in half each time. Solution: Approximation of f (x 0 ) with forward differences: 1. Using f(x 0 + h) =f(x 0 )+f (x 0 )h + f (x 0 ) 2! h 2 + O(h 3 ), we find the error for the forward difference difference approximation f(x 0,h)as f(x 0,h)= f(x 0 + h) f(x 0 ) h = f (x 0 )+ f (x 0 ) h + O(h 2 ), 2! which shows f(x 0,h) is a first-order approximation in h for f (x 0 ). 2. Cutting h in half each time, we derive f(x 0,h) = f (x 0 )+C 1 h + C 2 h 2 + O(h 3 ) f(x 0,h/2) = f (x 0 )+C 1 h/2+c 2 h 2 /4+O(h 3 ) f(x 0,h/4) = f (x 0 )+C 1 h/4+c 2 h 2 /16 + O(h 3 ) for some constants C 1 and C 2. Elimination of C 1 (or equivalently, the term in h) leads to a second-order approximation: f(x 0, h, h/2) = 2 f(x 0,h/2) f(x 0,h) 2 1 = f (x 0 ) C 2 h 2 /2+O(h 3 ) f(x 0,h/2,h/4) = 2 f(x 0,h/4) f(x 0,h/2) 2 1 = f (x 0 ) C 2 h 2 /8+O(h 3 ) We now see that 4 f(x 0,h/2,h/4) f(x 0,h,h/2) eliminates the term in h 2 and gives us the 4 1 desired third-order approximation for f (x 0 ). Spring 04 CS 7/9
12 12. Computational Geometry A Star-shaped polygon (SSP) is a simple polygon all of whose interior is visible from at least one point in the polygon s interior. We shall call such a point a point of total visibility (PTV). It is clear that a star-shaped polygon need not be convex. The Kernel of a SSP is a region of its interior containing all of its PTV s. Observe that if the SSP happens to be convex, its kernel will span the entire interior of the SSP. Outline a proof sketch that the kernel of a SSP is a convex polygon inside the SSP. (Hint: Start with a 4-sided polygon with vertex angles 3 of which are convex, turning to the right in a clockwise traversal of the polygon (just like a convex polygon) and 1 of which is reflex (turning to the left). Draw the kernel of this polygon. Now consider how the kernel is constrained when there are several reflex angles. For instance, draw the kernel when there are two reflex angles.) Solution: Suppose it is already known that the polygon P is star-shaped. Consider every reflex vertex v and the two vertices u and w on P. From v extend two half-lines continuing uv and vw. These form a wedge. From any point in the wedge, the inside of both uv and vw are visible; from outside the wedge, they are not both visible. Now reshape the polygon by connectiing w and u, forgetting v. It can be shown easily that P is still star-shaped, and that uw will still not pass through any edge of P. Continue this process until there are no more reflex vertices. The remaining polygon Q is convex, and forms the convex hull of P. The kernel must be the intersection of all the half-planes on either side of the wedges (two per wedge), which is convex, with Q, which is convex, and so finally the kernel is convex. Spring 04 CS 8/9
13 13. Error-Correcting Codes and Cryptography A binary code C is described by its parity-check matrix H = (a) How would you encode the messages m 1 = 0000 and m 2 = 1101? (b) How would you decode the received vectors v 1 = and v 2 = ? (c) Find the parameters n, k, and d for C. Solution: (a) and (b) and (c) [7, 4, 3] 14. In a public-key cryptosystem using RSA, you intercept the cryptogram C = 10 sent to a receiver whose public key is e = 5 and n = 35. Find the integer M that was sent. Solution: p =5,q =7 Hence d is the inverse of 5 mod 24. This is 5 again. So M =10 5 (mod 35) = 5. Spring 04 CS 9/9
Mathematics Masters Examination
Mathematics Masters Examination OPTION 4 Fall 2011 COMPUTER SCIENCE??TIME?? NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each of the twelve numbered
More informationCS 373: Combinatorial Algorithms, Spring 1999
CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Alias: This is a closed-book, closed-notes exam! If you brought anything with you besides writing instruments and your
More informationThe National Strategies Secondary Mathematics exemplification: Y8, 9
Mathematics exemplification: Y8, 9 183 As outcomes, Year 8 pupils should, for example: Understand a proof that the sum of the angles of a triangle is 180 and of a quadrilateral is 360, and that the exterior
More informationCS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final
CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may
More informationModule Four: Connecting Algebra and Geometry Through Coordinates
NAME: Period: Module Four: Connecting Algebra and Geometry Through Coordinates Topic A: Rectangular and Triangular Regions Defined by Inequalities Lesson 1: Searching a Region in the Plane Lesson 2: Finding
More informationCSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationCS 373: Combinatorial Algorithms, Fall Name: Net ID: Alias: U 3 / 4 1
CS 373: Combinatorial Algorithms, Fall 2000 Homework 1 (due November 16, 2000 at midnight) Starting with Homework 1, homeworks may be done in teams of up to three people. Each team turns in just one solution,
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationEND-TERM EXAMINATION
(Please Write your Exam Roll No. immediately) Exam. Roll No... END-TERM EXAMINATION Paper Code : MCA-205 DECEMBER 2006 Subject: Design and analysis of algorithm Time: 3 Hours Maximum Marks: 60 Note: Attempt
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationBMO Round 1 Problem 6 Solutions
BMO 2005 2006 Round 1 Problem 6 Solutions Joseph Myers November 2005 Introduction Problem 6 is: 6. Let T be a set of 2005 coplanar points with no three collinear. Show that, for any of the 2005 points,
More informationCS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final
CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may
More information2. CONNECTIVITY Connectivity
2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =
More informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
More informationINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator
INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator EXAMINATION ( End Semester ) SEMESTER ( Autumn ) Roll Number Section Name Subject Number C S 6 0 0 3 5 Subject Name Selected
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationAnalysis of Algorithms
Analysis of Algorithms Concept Exam Code: 16 All questions are weighted equally. Assume worst case behavior and sufficiently large input sizes unless otherwise specified. Strong induction Consider this
More informationPrelim 2. CS 2110, November 20, 2014, 7:30 PM Extra Total Question True/False Short Answer
Prelim 2 CS 2110, November 20, 2014, 7:30 PM 1 2 3 4 5 Extra Total Question True/False Short Answer Complexity Induction Trees Graphs Extra Credit Max 20 10 15 25 30 5 100 Score Grader The exam is closed
More informationProperties of Quadratic functions
Name Today s Learning Goals: #1 How do we determine the axis of symmetry and vertex of a quadratic function? Properties of Quadratic functions Date 5-1 Properties of a Quadratic Function A quadratic equation
More informationCS161 - Final Exam Computer Science Department, Stanford University August 16, 2008
CS161 - Final Exam Computer Science Department, Stanford University August 16, 2008 Name: Honor Code 1. The Honor Code is an undertaking of the students, individually and collectively: a) that they will
More information6th Bay Area Mathematical Olympiad
6th Bay Area Mathematical Olympiad February 4, 004 Problems and Solutions 1 A tiling of the plane with polygons consists of placing the polygons in the plane so that interiors of polygons do not overlap,
More informationDiscrete Mathematics I So Practice Sheet Solutions 1
Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise
More informationDepartment of Computer Applications. MCA 312: Design and Analysis of Algorithms. [Part I : Medium Answer Type Questions] UNIT I
MCA 312: Design and Analysis of Algorithms [Part I : Medium Answer Type Questions] UNIT I 1) What is an Algorithm? What is the need to study Algorithms? 2) Define: a) Time Efficiency b) Space Efficiency
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More informationNaming Angles. One complete rotation measures 360º. Half a rotation would then measure 180º. A quarter rotation would measure 90º.
Naming Angles What s the secret for doing well in geometry? Knowing all the angles. An angle can be seen as a rotation of a line about a fixed point. In other words, if I were mark a point on a paper,
More informationIMO Training 2010 Double Counting Victoria Krakovna. Double Counting. Victoria Krakovna
Double Counting Victoria Krakovna vkrakovna@gmail.com 1 Introduction In many combinatorics problems, it is useful to count a quantity in two ways. Let s start with a simple example. Example 1. (Iran 2010
More informationCMSC 380. Graph Terminology and Representation
CMSC 380 Graph Terminology and Representation GRAPH BASICS 2 Basic Graph Definitions n A graph G = (V,E) consists of a finite set of vertices, V, and a finite set of edges, E. n Each edge is a pair (v,w)
More informationQuestions Total Points Score
HKUST Department of Computer Science and Engineering # COMP3711H: Honors Design and Analysis of Algorithms Fall 2016 Midterm Examination Date: Thursday, Oct. 20, 2016 Time: 19:00 21:00 Venue: Room 2304
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationUnit 2A: Angle Pairs and Transversal Notes
Unit 2A: Angle Pairs and Transversal Notes Day 1: Special angle pairs Day 2: Angle pairs formed by transversal through two nonparallel lines Day 3: Angle pairs formed by transversal through parallel lines
More informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
More informationPolygon decomposition. Motivation: Art gallery problem
CG Lecture 3 Polygon decomposition 1. Polygon triangulation Triangulation theory Monotone polygon triangulation 2. Polygon decomposition into monotone pieces 3. Trapezoidal decomposition 4. Convex decomposition
More informationLecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More informationAngles of Polygons. Essential Question What is the sum of the measures of the interior angles of a polygon?
7.1 Angles of Polygons Essential Question What is the sum of the measures of the interior angles of a polygon? The Sum of the Angle Measures of a Polygon Work with a partner. Use dynamic geometry software.
More informationUniversity of Toronto Department of Electrical and Computer Engineering. Midterm Examination. ECE 345 Algorithms and Data Structures Fall 2012
1 University of Toronto Department of Electrical and Computer Engineering Midterm Examination ECE 345 Algorithms and Data Structures Fall 2012 Print your name and ID number neatly in the space provided
More informationStraight-line Drawability of Embedded Graphs
Straight-line Drawability of Embedded Graphs Hiroshi Nagamochi Department of Applied Mathematics and Physics, Kyoto University, Yoshida Honmachi, Sakyo, Kyoto 606-8501, Japan. nag@amp.i.kyoto-u.ac.jp Abstract:
More informationThe Probabilistic Method
The Probabilistic Method Po-Shen Loh June 2010 1 Warm-up 1. (Russia 1996/4 In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees
More informationLine Arrangement. Chapter 6
Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 15 Graphs: Planar Graphs 1 Outline What is a Planar Graph? Euler Planar Formula Platonic Solids Five Color Theorem Kuratowski s Theorem 2 What is a Planar Graph? Definition
More informationChapter 3 Trees. Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.
Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the
More informationCS134 Spring 2005 Final Exam Mon. June. 20, 2005 Signature: Question # Out Of Marks Marker Total
CS134 Spring 2005 Final Exam Mon. June. 20, 2005 Please check your tutorial (TUT) section from the list below: TUT 101: F 11:30, MC 4042 TUT 102: M 10:30, MC 4042 TUT 103: M 11:30, MC 4058 TUT 104: F 10:30,
More information1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1
Asymptotics, Recurrence and Basic Algorithms 1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1 1. O(logn) 2. O(n) 3. O(nlogn) 4. O(n 2 ) 5. O(2 n ) 2. [1 pt] What is the solution
More informationInteractive Math Glossary Terms and Definitions
Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the
More informationMath 414 Lecture 2 Everyone have a laptop?
Math 44 Lecture 2 Everyone have a laptop? THEOREM. Let v,...,v k be k vectors in an n-dimensional space and A = [v ;...; v k ] v,..., v k independent v,..., v k span the space v,..., v k a basis v,...,
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationLesson 19: The Graph of a Linear Equation in Two Variables is a Line
Lesson 19: The Graph of a Linear Equation in Two Variables is a Line Classwork Exercises Theorem: The graph of a linear equation y = mx + b is a non-vertical line with slope m and passing through (0, b),
More informationCS-6402 DESIGN AND ANALYSIS OF ALGORITHMS
CS-6402 DESIGN AND ANALYSIS OF ALGORITHMS 2 marks UNIT-I 1. Define Algorithm. An algorithm is a sequence of unambiguous instructions for solving a problem in a finite amount of time. 2.Write a short note
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationThe Art Gallery Problem: An Overview and Extension to Chromatic Coloring and Mobile Guards
The Art Gallery Problem: An Overview and Extension to Chromatic Coloring and Mobile Guards Nicole Chesnokov May 16, 2018 Contents 1 Introduction 2 2 The Art Gallery Problem 3 2.1 Proof..................................
More informationGeometry Unit 6 Properties of Quadrilaterals Classifying Polygons Review
Geometry Unit 6 Properties of Quadrilaterals Classifying Polygons Review Polygon a closed plane figure with at least 3 sides that are segments -the sides do not intersect except at the vertices N-gon -
More informationConnected Components of Underlying Graphs of Halving Lines
arxiv:1304.5658v1 [math.co] 20 Apr 2013 Connected Components of Underlying Graphs of Halving Lines Tanya Khovanova MIT November 5, 2018 Abstract Dai Yang MIT In this paper we discuss the connected components
More informationCoverage and Search Algorithms. Chapter 10
Coverage and Search Algorithms Chapter 10 Objectives To investigate some simple algorithms for covering the area in an environment To understand how to break down an environment into simple convex pieces
More informationReal life Problem. Review
Linear Programming The Modelling Cycle in Decision Maths Accept solution Real life Problem Yes No Review Make simplifying assumptions Compare the solution with reality is it realistic? Interpret the solution
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationData Structure and Algorithm Homework #3 Due: 2:20pm, Tuesday, April 9, 2013 TA === Homework submission instructions ===
Data Structure and Algorithm Homework #3 Due: 2:20pm, Tuesday, April 9, 2013 TA email: dsa1@csientuedutw === Homework submission instructions === For Problem 1, submit your source code, a Makefile to compile
More informationIndicate the option which most accurately completes the sentence.
Discrete Structures, CSCI 246, Fall 2015 Final, Dec. 10 Indicate the option which most accurately completes the sentence. 1. Say that Discrete(x) means that x is a discrete structures exam and Well(x)
More informationCHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system
CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH6 2.1 Warm-Up: See Solved Homework questions 2.2 Cartesian coordinate system Coordinate axes: Two perpendicular lines that intersect at the origin O on each line.
More informationBasic Properties The Definition of Catalan Numbers
1 Basic Properties 1.1. The Definition of Catalan Numbers There are many equivalent ways to define Catalan numbers. In fact, the main focus of this monograph is the myriad combinatorial interpretations
More informationPrelim 2 Solutions. CS 2110, November 20, 2014, 7:30 PM Extra Total Question True/False Short Answer
Prelim 2 Solutions CS 2110, November 20, 2014, 7:30 PM 1 2 3 4 5 Extra Total Question True/False Short Answer Complexity Induction Trees Graphs Extra Credit Max 20 10 15 25 30 5 100 Score Grader The exam
More information8.NS.1 8.NS.2. 8.EE.7.a 8.EE.4 8.EE.5 8.EE.6
Standard 8.NS.1 8.NS.2 8.EE.1 8.EE.2 8.EE.3 8.EE.4 8.EE.5 8.EE.6 8.EE.7 8.EE.7.a Jackson County Core Curriculum Collaborative (JC4) 8th Grade Math Learning Targets in Student Friendly Language I can identify
More informationGEOMETRY. TI-Nspire Help and Hints. 1 Open a Graphs and Geometry page. (Press c 2 ).
GEOMETRY TI-Nspire Help and Hints 1 Open a Graphs and Geometry page. (Press c 2 ). 2 You may need to save a current document you have been working on. Save or press e to move the cursor to No and press.
More informationSolutions to Midterm 2 - Monday, July 11th, 2009
Solutions to Midterm - Monday, July 11th, 009 CPSC30, Summer009. Instructor: Dr. Lior Malka. (liorma@cs.ubc.ca) 1. Dynamic programming. Let A be a set of n integers A 1,..., A n such that 1 A i n for each
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationChislehurst and Sidcup Grammar School Mathematics Department Year 9 Programme of Study
Chislehurst and Sidcup Grammar School Mathematics Department Year 9 Programme of Study Timings Topics Autumn Term - 1 st half (7 weeks - 21 lessons) 1. Algebra 1: Expressions, Formulae, Equations and Inequalities
More informationMISCELLANEOUS SHAPES
MISCELLANEOUS SHAPES 4.1. INTRODUCTION Five generic shapes of polygons have been usefully distinguished in the literature: convex, orthogonal, star, spiral, and monotone. 1 Convex polygons obviously do
More informationThe Algorithm Design Manual
Steven S. Skiena The Algorithm Design Manual With 72 Figures Includes CD-ROM THE ELECTRONIC LIBRARY OF SCIENCE Contents Preface vii I TECHNIQUES 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 2 2.1 2.2 2.3
More informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
More informationProfessor: Padraic Bartlett. Lecture 9: Trees and Art Galleries. Week 10 UCSB 2015
Math 7H Professor: Padraic Bartlett Lecture 9: Trees and Art Galleries Week 10 UCSB 2015 1 Prelude: Graph Theory This talk uses the mathematical concepts of graphs from our previous class. In particular,
More informationMath 443/543 Graph Theory Notes 5: Planar graphs and coloring
Math 443/543 Graph Theory Notes 5: Planar graphs and coloring David Glickenstein October 10, 2014 1 Planar graphs The Three Houses and Three Utilities Problem: Given three houses and three utilities, can
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationUnit 1, Lesson 1: Moving in the Plane
Unit 1, Lesson 1: Moving in the Plane Let s describe ways figures can move in the plane. 1.1: Which One Doesn t Belong: Diagrams Which one doesn t belong? 1.2: Triangle Square Dance m.openup.org/1/8-1-1-2
More informationIntroduction to Geometry
Introduction to Geometry This course covers the topics outlined below. You can customize the scope and sequence of this course to meet your curricular needs. Curriculum (211 topics + 6 additional topics)
More informationGraph Algorithms Using Depth First Search
Graph Algorithms Using Depth First Search Analysis of Algorithms Week 8, Lecture 1 Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Graph Algorithms Using Depth
More informationCSCE 310 Assignment 3 Summer 2018
Name(s) CSE Login Programming Language(s) Used Question Points Score 1 10 2 10 3 20 4 5 5 5 6 10 7 20 8 120 Total: 200 Graders Notes: Instructions Follow instructions carefully, failure to do so may result
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationStudent number: Datenstrukturen & Algorithmen page 1
Student number: Datenstrukturen & Algorithmen page 1 Problem 1. / 16 P Instructions: 1) In this problem, you have to provide solutions only. You can write them right on this sheet. 2) You may use the notation,
More informationFINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard
FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should Use better data structures
More informationMiddle School Math Course 3
Middle School Math Course 3 Correlation of the ALEKS course Middle School Math Course 3 to the Texas Essential Knowledge and Skills (TEKS) for Mathematics Grade 8 (2012) (1) Mathematical process standards.
More informationStudent number: Datenstrukturen & Algorithmen page 1
Student number: Datenstrukturen & Algorithmen page 1 Problem 1. / 15 P Please note: 1) In this problem, you have to provide solutions only. You can write them right on this sheet. 2) If you use algorithms
More informationTexas High School Geometry
Texas High School Geometry This course covers the topics shown below. Students navigate learning paths based on their level of readiness. Institutional users may customize the scope and sequence to meet
More informationTotal Score /1 /20 /41 /15 /23 Grader
NAME: NETID: CS2110 Spring 2015 Prelim 2 April 21, 2013 at 5:30 0 1 2 3 4 Total Score /1 /20 /41 /15 /23 Grader There are 5 questions numbered 0..4 on 8 pages. Check now that you have all the pages. Write
More informationCorrelation of the ALEKS courses Algebra 1 and High School Geometry to the Wyoming Mathematics Content Standards for Grade 11
Correlation of the ALEKS courses Algebra 1 and High School Geometry to the Wyoming Mathematics Content Standards for Grade 11 1: Number Operations and Concepts Students use numbers, number sense, and number
More informationLesson Plan #39. 2) Students will be able to find the sum of the measures of the exterior angles of a triangle.
Lesson Plan #39 Class: Geometry Date: Tuesday December 11 th, 2018 Topic: Sum of the measures of the interior angles of a polygon Objectives: Aim: What is the sum of the measures of the interior angles
More informationXVIII. AMC 8 Practice Questions
XVIII. AMC 8 Practice Questions - A circle and two distinct lines are drawn on a sheet of paper. What is the largest possible number of points of intersection of these figures? (A) (B) 3 (C) 4 (D) 5 (E)
More informationAnswers to specimen paper questions. Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes.
Answers to specimen paper questions Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes. Question 1. (a) The degree of a vertex x is the number
More informationVertex Cover Approximations
CS124 Lecture 20 Heuristics can be useful in practice, but sometimes we would like to have guarantees. Approximation algorithms give guarantees. It is worth keeping in mind that sometimes approximation
More informationUNIVERSITY OF MANITOBA. SIGNATURE: (in ink) (I understand that cheating is a serious offense)
DATE: Nov. 21, 2013 NAME: (Print in ink) STUDENT NUMBER: SIGNATURE: (in ink) (I understand that cheating is a serious offense) INSTRUCTIONS TO STUDENTS: This is a 90 minute exam. Cearly show all necessary
More informationCentral Valley School District Math Curriculum Map Grade 8. August - September
August - September Decimals Add, subtract, multiply and/or divide decimals without a calculator (straight computation or word problems) Convert between fractions and decimals ( terminating or repeating
More informationImproved Bounds for Intersecting Triangles and Halving Planes
Improved Bounds for Intersecting Triangles and Halving Planes David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Tech. Report 91-60 July 15, 1991 Abstract
More informationmanaging an evolving set of connected components implementing a Union-Find data structure implementing Kruskal s algorithm
Spanning Trees 1 Spanning Trees the minimum spanning tree problem three greedy algorithms analysis of the algorithms 2 The Union-Find Data Structure managing an evolving set of connected components implementing
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationLecture 22 Tuesday, April 10
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,
More information