CPSC (T1) 2nd Midterm Exam
|
|
- Baldwin Hart
- 6 years ago
- Views:
Transcription
1 Signture: Fire Alrm Code: CPSC (T) 2nd Midterm Exm Deprtment of Computer Science University of British Columbi K. Booth & R. Schrein Exm Instructions (Red Crefully). Sign the first pge of the exm with your Signture in the spce provided on the upper left immeditely. 2. Continue reding the instructions, but do not open the exm booklet until you re told to do so by proctor. 3. Print your Nme nd Student Identifiction Number on every pge in the spce provided t the top of ech pge before you strt the exm. 4. Cheting is n cdemic offense. Your signture on the exm indictes tht you understnd nd gree to the University s policies regrding cheting on exms. 5. Plese red the entire exm before nswering ny ofthe questions. 6. There re four questions on this exm, ech worth the indicted number of mrks. Answer s mny questions s you cn. 7. Write ll of your nswers on these pges. If you need more spce, there is blnk spce t the end of the exm. Be sure to indicte when question is continued, both on the pge for tht question nd on the continution pge. 8. Interpret the exm questions s written. No questions will be nswered by the proctor(s) during the exm period. 9. The exm is closed book. There re no ids permitted, except for clcultor.. You hve 7 minutes in which to work. Budget your time wisely.. In the event of fire lrm during the exm, enter the four-chrcter code provided by the proctor(s) in the spce on the upper right, then gther your belongings nd exit the room, hnding your exm to proctor s you exit. 2. No one will be permitted to leve the exm room during the lst ten minutes of the exm. Question Men SD Mx (-b) (c-d) (-d) (e-h) (-l) (m-t) Totl CPSC (T) of3 2nd Midterm Exm (7 minutes)
2 Question # [24 mrks totl] This question tests your knowledge of how 2D polygon clipping is performed. The questions will refer to window-edge coordintes, Sutherlnd-Cohen outcodes, nd the Sutherlnd-Hodgmn polygon clipper discussed in lecture. Below is the min body of the clipping function given in the lecture nd on the course Web pges. It clips ginst single clipping boundry, then psses its output to the next boundry. Assume tht the clipping boundries re the stndrd ones for 2 2squre window centred on the origin,. x, y +., nd tht clipping is performed ginst the four clipping boundries in four stges using the order Left, Right, Bottom, nd then Top. You my ssume tht ll necessry initiliztion hs been performed, nd tht the function WEC(i,x,y) returns the i-th window edge coordinte for the point (x,y). int flg[maxout]; /* flg[i] = FALSE if first vertex */ flot Fx[MAXOUT], Fy[MAXOUT]; /* first vertex t i-th level*/ flot Sx[MAXOUT], Sy[MAXOUT]; /* sved vertex t i-th level*/ flot wecs[maxout]; /* outcode for sved vertex t i-th level */ void Clip ( int i, flot Px, flot Py ) { flot lph, wecp, Ix, Iy; if (i==maxout) { Output(Px,Py); return; } wecp = WEC( i, Px, Py ); /* Get ith Window Edge Coordinte */ if (!flg[i]) { Fx[i]=Px; Fy[i]=Py; flg[i]=true; } else { if (wecs[i]>=) { if (wecp>=) /* Cse ++, S nd P re both OK */ Clip(i+, Px, Py ); /* Pss long P to next level */ else { /* Cse +-, S is OK but P is not */ lph = wecs[i] / (wecs[i] - wecp); Ix = Sx[i] + lph*(px-sx[i]); Iy = Sy[i] + lph*(py-sy[i]); Clip(i+, Ix, Iy ); /* Pss long I to next level */ } } else { if (wecp>=) { /* Cse -+, S is not OK but P is OK */ lph = wecs[i] / (wecs[i] - wecp); Ix = Sx[i] + lph*(px-sx[i]); Iy = Sy[i] + lph*(py-sy[i]); Clip(i+, Ix, Iy ); /* Pss long I to next level */ Clip(i+, Px, Py ); /* Pss long P to next level */ } } } Sx[i]=Px; Sy[i]=Py; wecs[i]=wecp; } void End ( int i ) { if (i<maxout) { /* If never clled, then nothing to do t or fter this level */ if (flg[i]) { Clip( i, Fx[i], Fy[i] ); End(i+); flg[i] = FALSE; } } } void Strt ( int i ) { if (i<maxout) { flg[i] = FALSE; Strt(i+); } } CPSC (T) 2of3 2nd Midterm Exm (7 minutes)
3 In this question, the input polygon to be clipped ginst the 2 2window isgiven bythe following 2D coordintes. Vertex x y P.. P P P () [4 mrks] Determine the vlues of the four one-bit outcodes for ech of the vertices with respect to the four boundries of the clipping region. Use the stndrd convention for outcodes. Vertex L R B T P P P 2 P 3 NOTE: The nswers T or TRUE (insted of ), nd F or FALSE (insted of ) re lso cceptble (this is the convention in the textbook). (b) [4 mrks] Determine the numeric vlues of the four window edge coordintes with respect to the four boundries of the clipping region for just the third vertex P 2 = (. 5, +. 5) in the input polygon. WEC[Left]: + x =+. 5 WEC[Right]: x =+. 5 WEC[Bottom]: + y =+2. 5 WEC[Top]: y =. 5 CPSC (T) 3of3 2nd Midterm Exm (7 minutes)
4 (c) [8 mrks] Indicte the coordintes fter the clipper is clled with ll points for the Left clipping boundry (i.e., provide the output from the first stge of clipping). Unused entries should be left blnk. Vertices should be listed in order so they form proper polygon (you cn strt with ny vertex, but the rest must come in the correct cyclic order). Vertex x y P P L. +. L.. P.. The order bove is wht the C code ctully produces if it is run with just the Left clipping boundry. Your nswer cn be ny cyclic shift of this. (d) [8 mrks] Indicte the coordintes t the very end fter the clipper is clled with ll points for the Top clipping boundry (i.e., provide the output from the lst stge of clipping). Unused entries should be left blnk. Vertices should be listed in order so they form proper polygon (you cn strt with ny vertex, but the rest must come in the correct cyclic order). Vertex x y L.. P.. P T T. +. L. +. NOTICE tht T nd L hve the sme coordintes! CPSC (T) 4of3 2nd Midterm Exm (7 minutes)
5 Question #2 [6 mrks totl] This question tests your knowledge of properties nd conventions for 3D polygons. Below re the 3-D coordintes for polygon (similr to the polygon used in Question #, but this one hs 3D coordintes rther thn just 2D coordintes). Vertex x y z P... P P P Use these coordintes for the first four prts of this question. () [2 mrks] Assume tht the eyepoint is locted t (.,., 3. ). Using our stndrd convention for polygons, is the polygon (P, P, P 2, P 3 )front-fcing or bck-fcing polygon? Why? IT is FRONT-FACING becuse the vertices re seen in COUNTER- CLOCKWISE order from the eyepoint. Newell s formul provides norml of (,,), which points towrd the eyepoint. (b) [2 mrks] Is the polygon (P, P, P 2, P 3 )plnr or non-plnr polygon? Why? It is PLANAR becuse ll of the vertices lie in the z = plne. (c) [2 mrks] Is the polygon (P, P, P 2, P 3 )convex or non-convex polygon? Why? It is NON-CONVEX becuse the line P P 2 is not completely contined within the polygon interior or boundry. (d) [2 mrks] Is the 2D projection onto the screen of the polygon (P, P, P 2, P 3 )simple or nonsimple polygon? Why? It is SIMPLE becuse no edges cross in the projected polygon. CPSC (T) 5of3 2nd Midterm Exm (7 minutes)
6 For the next four prts of this question, consider the following polygon for ll of your nswers. Its vertices re different both in order nd in coordintes from the previous polygon. Vertex x y z P P P 6... P (e) [2 mrks] Assume tht the eyepoint is locted t (.,., 3. ). Using our stndrd convention for polygons, is the polygon (P 4, P 5, P 6, P 7 )front-fcing or bck-fcing polygon? Why? IT is BACK-FACING becuse the vertices re seen in CLOCKWISE order from the eyepoint. Newell s formul provides norml of (.499,.66,-.9986), which points wy from the eyepoint. The polygon is non-plnr (see (f) below) nd non-simple (see (h) below). This mkes it more difficult to nswer this question, but the lrger portion is clockwise nd the smller is counterclockwise, nd Newell s formul weights this ccordingly to produce net result tht corresponds to clockwise ordering. (f) [2 mrks] Is the polygon (P 4, P 5, P 6, P 7 )plnr or non-plnr polygon? Why? It is NON-PLANAR becuse three of the vertices lie in the z = plne but one does not, so there cnnot be ny plne in which they ll four lie. (g) [2 mrks] Is the polygon (P 4, P 5, P 6, P 7 )convex or non-convex polygon? Why? It is NON-CONVEX becuse the line P 5 P 7 is not completely contined within the polygon interior or boundry. The fct tht it is nonplnr mens it cnnot be convex. (h) [2 mrks] Is the 2D projection onto the screen of the polygon simple or non-simple polygon? Why? It is NON-SIMPLE becuse the two edges P 5 P 6 nd P 7 P 4 cross in the projected polygon. CPSC (T) 6of3 2nd Midterm Exm (7 minutes)
7 Question #3 [2 mrks totl] This questions tests you knowledge of hierrchicl disply list structures s discussed in lecture. Below is DAG tht will disply multiple instnces of the unit cube, centred t the origin, whose geometry is stored in the node C when the Wlk() function is clled to process the root node of the DAG. Refer to this digrm for both prts of this question. The nodes with T lbel re trnsltions. T T T2 T3 T4 T5 R S istrnsltion tht tkes (x, y, z) to(x,y 5, z). istrnsltion tht tkes (x, y, z) to(x,y,z). istrnsltion tht tkes (x, y, z) to(x,y+5, z). istrnsltion tht tkes (x, y, z) to(x 5, y, z). istrnsltion tht tkes (x, y, z) to(x,y,z). istrnsltion tht tkes (x, y, z) to(x+5, y, z). iscounterclockwise rottion of 6 degrees bout z-xis. is scling tht contrcts everything by fctor of three long the x xis, expnds everything by fctor of seven long the y xis, nd leves things unchnged long the z xis. T T T2 T3 T4 T5 S R C CPSC (T) 7of3 2nd Midterm Exm (7 minutes)
8 When cube is drwn fter non-uniform scling hs been pplied, it will in generl be prllellipiped, not cube. If we ssume tht the function Wlk() is invoked with T s its rgument (the root of the DAG), there will be six prllellipipeds (possibly scled nd rotted cubes) drw t vrious plces on the screen. () [2 mrks] For ech of the six prllellipipeds, describe its position (x, y) on the screen, its orienttion (rotted or not), nd its shpe (scled or not). Vertex Position Orienttion Shpe () ( 5, 5) rotted scled (2) (, 5) rotted not scled (3) (+5, 5) rotted scled (4) (+5, ) rotted scled (5) (, +5) rotted not scled (6) (+5, +5) rotted scled (b) [8 mrks] Assume tht the viewing trnsformtion is just the identity mtrix with no perspective. Show the contents of the mtrix stck when the lst prllellipiped is being drwn using the Wlk() function described in lecture. The stck will contin five 4 4 mtrices with the current trnsformtion on the top of the stck nd four sved mtrices in the stck. Show ech of the symbolic expressions (vrious products of the mtrices stored in the DAG) for the five mtrices in the stck. () top: I T 2 T 5 S R (2) I T 2 T 5 S (3) I T 2 T 5 (4) I T 2 (5) bottom: I (the identity mtrix) CPSC (T) 8of3 2nd Midterm Exm (7 minutes)
9 Question #4 [4 mrks 2 mrks ech] This question tests your generl knowledge of the concepts nd terminology introduced in the course. The following terms or people s nmes re possible nswers for the questions on subsequent pges. Use the number corresponding to term or nme below sninthe spce provided nswer if you think it is the best mtch for one of the concepts or terms on subsequent pges. Ech term my be used once, more thn once, or not t ll. () DAG (2) ffine (3) child (4) commuttive (5) convex (6) determinnt (7) heterogeneous (8) homogeneous (9) homotopy () indeterminnt () inverse (2) liner (3) non-uniform scling (4) orthogonl (5) orthogrphic (6) prent (7) permnent (8) point (9) point t infinity (2) qudrnt (2) qudruple (22) quternion (23) rottion bout x (24) rottion bout y (25) rottion bout z (26) sher (27) sibling (28) threded (29) trce (3) trnsltion (3) uniform scling (32) vector (33) virtul cmer (34) Weiler-Atherton CPSC (T) 9of3 2nd Midterm Exm (7 minutes)
10 For ech sttement below, write the number of the term listed on the previous pge tht best fits into the missing spce mrked by ******** in the sentence. [2 mrks ech] _ 8 _() We often dd this fourth homogeneous coordinte in 3-D grphics to provide uniform mtrix representtion for the vrious trnsformtions tht re used. _8_(b) For point we dd fourth coordinte tht is one (). _32_(c) For vector we dd fourth coordinte tht is zero (). _9_(d) A second interprettion, insted of the one in prt (c), is tht when we dd fourth coordinte tht is zero () we obtin point t infinity. NOTE: The nswers to (c) nd (d) re interchngeble, but credit will not be given twice for the sme nswer. _2_(e) A weighted sum of vectors is liner combintion nd is itself lwys vector. _2_(f) A weighted sum of vectors whose weights sum to unity () is clled ffine. _ 5 _(g) A weighted sum of vectors whose weights re ll non-negtive nd sum to unity () is clled convex. _2_(h) A weighted sum of points must be ffine if the result is point. _28_(i) A threded n-ry tree is one in which the usul pointers from prents to children hve been replced by only two pointers, one to the first child nd one to the next sibling. _6_(j) The difference between tree nd DAG is tht some nodes my hve more thn one prent in DAG. _34_(k) The Weiler-Atherton clipping lgorithm is the most generl polygon clipping lgorithm of those discussed in the textbook. _33_(l) The virtul cmer is useful nlogy or metphor tht ssists in understnding vrious viewing nd perspective prmeters. CPSC (T) of3 2nd Midterm Exm (7 minutes)
11 [2 mrks ech] _24_(m) A 4 4mtrix b b where 2 + b 2 = corresponds to rottion bout y trnsformtion. NOTE: An lternte nswer (worth only mrk) is #4, orthogonl. _3_(n) A 4 4mtrix b c corresponds to trnsltion trnsformtion. _3_(o) A 4 4mtrix b c corresponds to non-uniform scling trnsformtion. _3_(p) A 4 4mtrix corresponds to uniform scling trnsformtion. _26_(q) A 4 4mtrix corresponds to sher trnsformtion. _ 6 _(r) The re of polygon fter trnsformtion by mtrix M is relted to the originl re by the determinnt of the mtrix M. _22_(s) The quternion is mthemticl object hs four components nd cn be used to represent rottions in three-dimensionl spce. It ws discovered by Sir Willim Rowen Hmilton in 843 while wlking with his wife one evening long the Royl Cnl in Dublin. _4_(t) Two mtrices A nd B re commuttive if AB = BA. CPSC (T) of3 2nd Midterm Exm (7 minutes)
Geometric transformations
Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationFall 2018 Midterm 1 October 11, ˆ You may not ask questions about the exam except for language clarifications.
15-112 Fll 2018 Midterm 1 October 11, 2018 Nme: Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
More informationa(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationECE 468/573 Midterm 1 September 28, 2012
ECE 468/573 Midterm 1 September 28, 2012 Nme:! Purdue emil:! Plese sign the following: I ffirm tht the nswers given on this test re mine nd mine lone. I did not receive help from ny person or mteril (other
More informationViewing and Projection
15-462 Computer Grphics I Lecture 5 Viewing nd Projection Sher Trnsformtion Cmer Positioning Simple Prllel Projections Simple Perspective Projections [Angel, Ch. 5.2-5.4] Jnury 30, 2003 [Red s Drem, Pixr,
More information1 Drawing 3D Objects in Adobe Illustrator
Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More informationRay surface intersections
Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More information50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:
5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )
More information6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
More informationLecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1
More informationPhysics 208: Electricity and Magnetism Exam 1, Secs Feb IMPORTANT. Read these directions carefully:
Physics 208: Electricity nd Mgnetism Exm 1, Secs. 506 510 11 Feb. 2004 Instructor: Dr. George R. Welch, 415 Engineering-Physics, 845-7737 Print your nme netly: Lst nme: First nme: Sign your nme: Plese
More informationMidterm I Solutions CS164, Spring 2006
Midterm I Solutions CS164, Spring 2006 Februry 23, 2006 Plese red ll instructions (including these) crefully. Write your nme, login, SID, nd circle the section time. There re 8 pges in this exm nd 4 questions,
More informationFall 2017 Midterm Exam 1 October 19, You may not use any books, notes, or electronic devices during this exam.
15-112 Fll 2017 Midterm Exm 1 October 19, 2017 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for
More informationOrientation & Quaternions. CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2017
Orienttion & Quternions CSE69: Computer Animtion Instructor: Steve Rotenberg UCSD, Winter 7 Orienttion Orienttion We will define orienttion to men n object s instntneous rottionl configurtion Think of
More informationSpring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam.
15-112 Spring 2018 Midterm Exm 1 Mrch 1, 2018 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for lnguge
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationFall 2018 Midterm 2 November 15, 2018
Nme: 15-112 Fll 2018 Midterm 2 November 15, 2018 Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
More informationPythagoras theorem and trigonometry (2)
HPTR 10 Pythgors theorem nd trigonometry (2) 31 HPTR Liner equtions In hpter 19, Pythgors theorem nd trigonometry were used to find the lengths of sides nd the sizes of ngles in right-ngled tringles. These
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationAngle Properties in Polygons. Part 1 Interior Angles
2.4 Angle Properties in Polygons YOU WILL NEED dynmic geometry softwre OR protrctor nd ruler EXPLORE A pentgon hs three right ngles nd four sides of equl length, s shown. Wht is the sum of the mesures
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationMatrices and Systems of Equations
Mtrices Mtrices nd Sstems of Equtions A mtri is rectngulr rr of rel numbers. CHAT Pre-Clculus Section 8. m m m............ n n n mn We will use the double subscript nottion for ech element of the mtri.
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationTopic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords
Tody s Topics 3. Trnsformtions in 2D 4. Coordinte-free geometry 5. (curves & surfces) Topic 3: 2D Trnsformtions 6. Trnsformtions in 3D Simple Trnsformtions Homogeneous coordintes Homogeneous 2D trnsformtions
More informationEssential Question What are some of the characteristics of the graph of a rational function?
8. TEXAS ESSENTIAL KNOWLEDGE AND SKILLS A..A A..G A..H A..K Grphing Rtionl Functions Essentil Question Wht re some of the chrcteristics of the grph of rtionl function? The prent function for rtionl functions
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationGraphing Conic Sections
Grphing Conic Sections Definition of Circle Set of ll points in plne tht re n equl distnce, clled the rdius, from fixed point in tht plne, clled the center. Grphing Circle (x h) 2 + (y k) 2 = r 2 where
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More information2D Projective transformation
2D Projective trnsformtion The mpping of points from n N-D spce to n M-D subspce (M < N) w' w' w m m m 2 m m m 2 m m m 2 2 22 w' w' w m m m 2 m m m 2 m m 2 2 Boqun Chen 22 2D Projective trnsformtion w'
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationClass-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts
Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationHyperbolas. Definition of Hyperbola
CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationThirty-fourth Annual Columbus State Invitational Mathematics Tournament. Instructions
Thirty-fourth Annul Columbus Stte Invittionl Mthemtics Tournment Sponsored by Columbus Stte University Deprtment of Mthemtics Februry, 008 ************************* The Mthemtics Deprtment t Columbus Stte
More informationCS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:
CS38: Computer Grphics Modeling Trnsformtions Sung-Eui Yoon ( 윤성의 ) Course URL: http://sgl.kist.c.kr/~sungeui/cg/ Clss Ojectives (Ch. 3.5) Know the clssic dt processing steps, rendering pipeline, for rendering
More informationStack. A list whose end points are pointed by top and bottom
4. Stck Stck A list whose end points re pointed by top nd bottom Insertion nd deletion tke plce t the top (cf: Wht is the difference between Stck nd Arry?) Bottom is constnt, but top grows nd shrinks!
More informationFunctor (1A) Young Won Lim 8/2/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More informationLecture Overview. Knowledge-based systems in Bioinformatics, 1MB602. Procedural abstraction. The sum procedure. Integration as a procedure
Lecture Overview Knowledge-bsed systems in Bioinformtics, MB6 Scheme lecture Procedurl bstrction Higher order procedures Procedures s rguments Procedures s returned vlues Locl vribles Dt bstrction Compound
More informationSubtracting Fractions
Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationMid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:
Fll term 2012 KAIST EE209 Progrmming Structures for EE Mid-term exm Thursdy Oct 25, 2012 Student's nme: Student ID: The exm is closed book nd notes. Red the questions crefully nd focus your nswers on wht
More informationCHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE
CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse
More informationLecture 5: Spatial Analysis Algorithms
Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/
More informationarxiv: v1 [cs.cg] 9 Dec 2016
Some Counterexmples for Comptible Tringultions rxiv:62.0486v [cs.cg] 9 Dec 206 Cody Brnson Dwn Chndler 2 Qio Chen 3 Christin Chung 4 Andrew Coccimiglio 5 Sen L 6 Lily Li 7 Aïn Linn 8 Ann Lubiw 9 Clre Lyle
More informationGrade 7/8 Math Circles Geometric Arithmetic October 31, 2012
Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt
More informationMIPS I/O and Interrupt
MIPS I/O nd Interrupt Review Floting point instructions re crried out on seprte chip clled coprocessor 1 You hve to move dt to/from coprocessor 1 to do most common opertions such s printing, clling functions,
More informationIntroduction Transformation formulae Polar graphs Standard curves Polar equations Test GRAPHS INU0114/514 (MATHS 1)
POLAR EQUATIONS AND GRAPHS GEOMETRY INU4/54 (MATHS ) Dr Adrin Jnnett MIMA CMth FRAS Polr equtions nd grphs / 6 Adrin Jnnett Objectives The purpose of this presenttion is to cover the following topics:
More informationEXPONENTIAL & POWER GRAPHS
Eponentil & Power Grphs EXPONENTIAL & POWER GRAPHS www.mthletics.com.u Eponentil EXPONENTIAL & Power & Grphs POWER GRAPHS These re grphs which result from equtions tht re not liner or qudrtic. The eponentil
More informationAngle properties of lines and polygons
chievement Stndrd 91031 pply geometric resoning in solving problems Copy correctly Up to 3% of workbook Copying or scnning from ES workbooks is subject to the NZ Copyright ct which limits copying to 3%
More informationarxiv: v1 [cs.cg] 1 Jun 2016
HOW TO MORPH PLANAR GRAPH DRAWINGS Soroush Almdri, Ptrizio Angelini, Fidel Brrer-Cruz, Timothy M. Chn, Giordno D Lozzo, Giuseppe Di Bttist, Fbrizio Frti, Penny Hxell, Ann Lubiw, Murizio Ptrignni, Vincenzo
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More information10/12/17. Motivating Example. Lexical and Syntax Analysis (2) Recursive-Descent Parsing. Recursive-Descent Parsing. Recursive-Descent Parsing
Motivting Exmple Lexicl nd yntx Anlysis (2) In Text: Chpter 4 Consider the grmmr -> cad A -> b Input string: w = cd How to build prse tree top-down? 2 Initilly crete tree contining single node (the strt
More informationMath 35 Review Sheet, Spring 2014
Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided
More informationQuiz2 45mins. Personal Number: Problem 1. (20pts) Here is an Table of Perl Regular Ex
Long Quiz2 45mins Nme: Personl Numer: Prolem. (20pts) Here is n Tle of Perl Regulr Ex Chrcter Description. single chrcter \s whitespce chrcter (spce, t, newline) \S non-whitespce chrcter \d digit (0-9)
More informationAVolumePreservingMapfromCubetoOctahedron
Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online
More information3 FRACTIONS. Before you start. Objectives
FRATIONS Only one eighth of n iceberg shows bove the surfce of the wter, which leves most of it hidden. The lrgest northern hemisphere iceberg ws encountered ner Bffin Islnd in nd in 1. It ws 1 km long,
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More information4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E
4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationTASK SPECIFIC DESCRIPTION
MYP Algebr II/Trig Unit 2 Ch. 4 Trnsformtions Project Nme: Block: - Due Dte: Tuesdy, 11/7 (B-dy) & Wednesdy, 11/8 (A-dy) Mterils: Grph pper, ruler, protrctor, compss, highlight mrkers/colored pencils SCORE:
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationCompilers Spring 2013 PRACTICE Midterm Exam
Compilers Spring 2013 PRACTICE Midterm Exm This is full length prctice midterm exm. If you wnt to tke it t exm pce, give yourself 7 minutes to tke the entire test. Just like the rel exm, ech question hs
More informationSIMPLIFYING ALGEBRA PASSPORT.
SIMPLIFYING ALGEBRA PASSPORT www.mthletics.com.u This booklet is ll bout turning complex problems into something simple. You will be ble to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationCSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe
CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Instructor: Adm Sheffer. TA: Cosmin Pohot. 1pm Mondys, Wednesdys, nd Fridys. http://mth.cltech.edu/~2015-16/2term/m006/ Min ook: Introduction to Grph
More informationIntegration. September 28, 2017
Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my
More informationRigid Body Transformations
igid od Kinemtics igid od Trnsformtions Vij Kumr igid od Kinemtics emrk out Nottion Vectors,,, u, v, p, q, Potentil for Confusion! Mtrices,, C, g, h, igid od Kinemtics The vector nd its skew smmetric mtri
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Adm Sheffer. Office hour: Tuesdys 4pm. dmsh@cltech.edu TA: Victor Kstkin. Office hour: Tuesdys 7pm. 1:00 Mondy, Wednesdy, nd Fridy. http://www.mth.cltech.edu/~2014-15/2term/m006/
More informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More information9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association
9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl
More informationCSCI1950 Z Computa4onal Methods for Biology Lecture 2. Ben Raphael January 26, hhp://cs.brown.edu/courses/csci1950 z/ Outline
CSCI1950 Z Comput4onl Methods for Biology Lecture 2 Ben Rphel Jnury 26, 2009 hhp://cs.brown.edu/courses/csci1950 z/ Outline Review of trees. Coun4ng fetures. Chrcter bsed phylogeny Mximum prsimony Mximum
More informationYoplait with Areas and Volumes
Yoplit with Ares nd Volumes Yoplit yogurt comes in two differently shped continers. One is truncted cone nd the other is n ellipticl cylinder (see photos below). In this exercise, you will determine the
More informationCMSC 331 First Midterm Exam
0 00/ 1 20/ 2 05/ 3 15/ 4 15/ 5 15/ 6 20/ 7 30/ 8 30/ 150/ 331 First Midterm Exm 7 October 2003 CMC 331 First Midterm Exm Nme: mple Answers tudent ID#: You will hve seventy-five (75) minutes to complete
More informationarxiv:cs.cg/ v1 18 Oct 2005
A Pir of Trees without Simultneous Geometric Embedding in the Plne rxiv:cs.cg/0510053 v1 18 Oct 2005 Mrtin Kutz Mx-Plnck-Institut für Informtik, Srbrücken, Germny mkutz@mpi-inf.mpg.de October 19, 2005
More informationCSCE 531, Spring 2017, Midterm Exam Answer Key
CCE 531, pring 2017, Midterm Exm Answer Key 1. (15 points) Using the method descried in the ook or in clss, convert the following regulr expression into n equivlent (nondeterministic) finite utomton: (
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More informationThe Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center
Resource Overview Quntile Mesure: Skill or Concept: 80Q Multiply two frctions or frction nd whole numer. (QT N ) Excerpted from: The Mth Lerning Center PO Box 99, Slem, Oregon 9709 099 www.mthlerningcenter.org
More information