Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Similar documents
MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

QUESTIONS BEGIN HERE!

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Present state Next state Q + M N

Tangram Fractions Overview: Students will analyze standard and nonstandard

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

QUESTIONS BEGIN HERE!

In which direction do compass needles always align? Why?

The University of Sydney MATH 2009

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

d e c b a d c b a d e c b a a c a d c c e b

OpenMx Matrices and Operators

1 Introduction to Modulo 7 Arithmetic

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

(4, 2)-choosability of planar graphs with forbidden structures

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Designing A Concrete Arch Bridge

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

CS 103 BFS Alorithm. Mark Redekopp

Weighted Graphs. Weighted graphs may be either directed or undirected.

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

Lecture 20: Minimum Spanning Trees (CLRS 23)

Planar Upward Drawings

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

MCS100. One can begin to reason only when a clear picture has been formed in the imagination.

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

0.1. Exercise 1: the distances between four points in a graph

CS150 Sp 98 R. Newton & K. Pister 1

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Outline. Binary Tree

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Graph Algorithms and Combinatorial Optimization Presenters: Benjamin Ferrell and K. Alex Mills May 7th, 2014

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs

Constructive Geometric Constraint Solving

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

Trees as operads. Lecture A formalism of trees

VLSI Testing Assignment 2

Physics 222 Midterm, Form: A

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Garnir Polynomial and their Properties

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

EE1000 Project 4 Digital Volt Meter

Designing A Uniformly Loaded Arch Or Cable

CS 461, Lecture 17. Today s Outline. Example Run

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

c 2009 Society for Industrial and Applied Mathematics

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

(Minimum) Spanning Trees

Seven-Segment Display Driver

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

CS 241 Analysis of Algorithms

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

12. Traffic engineering

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)

Decimals DECIMALS.

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

CSCI 104 Graph Representation and Traversals. Mark Redekopp David Kempe

Problem solving by search

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Combinatorial Optimization

Problem 1. Solution: = show that for a constant number of particles: c and V. a) Using the definitions of P

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Section 10.4 Connectivity (up to paths and isomorphism, not including)

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

Logic, Set Theory and Computability [M. Coppenbarger]

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

Transcription:

Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In w pls, t worin o prolm is n slitly to rlt t moi lyout. A tl proviin point vlus or t prolms is ivn t t vry n. 1. Dv lims tr is trinl-r rp wit 8 vrtis n 412 s. Yoln sys is wron. Explin wo is rit. T intnt o tis qustion is to trmin wtr you know Turán s torm, wi stts tt t mximum numr o s in trinl-r rp on n vrtis is n 2 /4. Tis vlu is t numr o s in omplt iprtit rp in wi t two prt sizs r s ln s possil. In tis s, sin n = 8, t two prts woul ot v 19 vrtis, so t mximum numr o s, provi tr wr no trinls, is 19 2 = 61. Sin t rp Dv rrs to s 412 s, it must v trinl. So Yoln is rit. 2. Zori lims tt tr is plnr rp wit 1012 vrtis n 672 s. Crlos sys s is wron. Explin wo is rit. T intnt r is to trmin wtr you rmmr tt plnr rp on n vrtis s t most n 6 s wn n. W sow tis in lss y strtin wit n ritrry plnr rp n sowin tt i ny is not trinl, tn w n lwys n n prsrv plnrity. Wn ll s (inluin t xtrnl ) r trinls, tn Eulr s ormul will sow tt t numr o s is xtly n 6. In t s t n, Crlos is rit. T rp s 1012 vrtis n 672 s. Sin 672 > (1012) 6, it n t plnr.. Vriy Eulr s ormul or tis plnr rp. W ount V, t numr o vrtis; E, t numr o s; n F, t numr o s, n s tt V = 9, E = 10 n F =. So, V E + F = 9 10 + = 2. 4. How mny symmtri inry rltions r tr on {1, 2,..., n}? O ts ow mny r rlxiv? A inry rltion R on st X is symmtri wn (x, y) R i n only i (y, x) R, or vry x, y X. Tr r n pirs o t orm (x, x), wr x {1, 2,..., n}. For o ts pirs, w i wtr to put (x, x) in t rltion or not. Similrly tr r ( n 2) 2-lmnt susts o t orm {x, y} wit x, y {1, 2,..., n} n x y. For su pir, w must itr put ot (x, y) n (y, x) in t rltion or put nitr in t rltion. So t totl numr o symmtri rltions is 2 n 2 (n 2). For t son prt, inry rltion R is rlxiv i (x, x) R or vry x X. Now, w los t issu o oi. All pirs (x, x) wit x {1, 2,..., n} must lon to R, n w v oi only or t istint 2-lmnt susts. So t totl numr o rltions wi r ot symmtri n rlxiv is 2 2) (n.

5.. Lt X = {,,,, } n lt P = {(, ), (, ), (, ), (, ), (, ), (, ), (, ), (, ), (, ), (, )}. Drw irm or t post (X, P ). 6. Sow tt t ollowin rp is omprility rp y trnsitivly orintin t s. In t sp to t rit, rw t irm o t ssoit post. T iur on t lt is t oriinl rp ivn on t tst. In t ntr is trnsitiv orinttion. I strt wit t wi I orint s (, ), i.., irt rom to. Tis totr wit orms V, sin is not n in t rp. Tis ors t irt (, ). T (, ) ors (, ), wi tn ors (, ). In turn, (, ) ors (, ). Now (, ) ors (, ) n (, ) ors (, ). It is sy to s tt t orinttion is ssntilly uniqu, i.., t only option is to rvrs t irtions on ll t s. T iur on t rit is irm or t rsultin post. O ours, i t rrows r rvrs in t mil iur, tn t irm on t rit is turn upsi own. 7. Consir t post sown on t lt. j 2 j 2 k k 2 2 1. Fin ll points omprl to. i 1 1 1 A point u is omprl to wn itr u < or u >. In tis post, is miniml point, so no otr point is lss tn. Howvr,, n r ll ir tn. Answr: {,, }.. Fin ll points wi ovr. A point u ovrs wn u > n tr is no point v twn tm. Hr n ovr. Not tt > ut os not ovr sin is twn tm. Answr: {, }. i

. Fin mximl in o siz 2. A in C is mximl wn tr is no point u wi is not in C or wi C {x} is lso in. In tis post {, }, i, j} n {, i} r 2-lmnt mximl ins.. Fin mximl ntiin o siz. In tis post, {, i, k} is -lmnt mximl ntiin.. Fin t st o ll miniml lmnts. An lmnt u is miniml wn tr is no v wit v < u in t post. Hr t st o miniml lmnts is {,,, i}.. Usin t loritm tut in lss (rursivly rmovin t st o miniml lmnts), in t it o t post n prtition o P into ntiins. Also in mximum in. You my init t prtition y writin irtly on t im. T ntiin prtition is rwn to t rit o t oriinl post, i.., or i = 1, 2,, t ntiin A i onsists o t points lll wit ol i. Fin t it o tis post n in mximum in. To nswr tis qustion, you tk n lmnt rom t ist ntiin, n tn prorm k-trkin. Hr you mit strt wit wi oms rom A. Wy is not in A 2? Bus is ovr somtin in A 2. Hr w s is in A 2 n >. Wy is not in A 1? Bus it is ovr somtin in A 1. Now w s tt is in A 1 n >. So t it is n {,, } is mximum in. Not tt tr r svrl mximum ins in tis post. 8. In t sp to t rit, rw t irms o tr irnt posts ll vin t ollowin rp s tir ovr rps () it 2, wit post; () it, wit post; n () it 4, wit 2 post. T nswr or prt () is uniqu up to ulity, i.., t post sown n turn upsi own. Also, tr r mny wys to rw t irm or t sm post, so orrt nswrs n ppr to somwt irnt ut ty r rlly rwins o t sm post. On t otr n, tr r multipl orrt nswrs or ot prt () n or prt (). Tis rlts t t tt it is iiult to trmin wtr rp is ovr rp. Also, it is iiult to ount t numr o istint posts wit t sm ovr rp.

9. By insption (not y loritm), in our points in t ollowin post tt orm 2 + 2. T our points in {,,, } orm two 2-lmnt ins wit ot points in on in inomprl wit ot points in t otr. 10. Fin y insption t wit w o t post sown low on t lt n in prtition o t post into w ins. Also in mximum ntiin. You my init t prtition y writin irtly on t irm. i 1 2 i 2 1 1 4 T in prtition is init y t iur on t rit. Fin t wit w o tis post n in mximum ntiin. By insption, t wit is 4 n {,,, } is 4-lmnt ntiin. Tr r otr 4-lmnt ntiins in tis post. On su is {,,, }. Not tt xpt or wn P is n intrvl orr, w o not v n loritm or inin t wit w o post P n prtition o P into w ins. From Dilwort s torm, w know tt su prtition xists. W just on t know ow to in it. Tis issu will rss rit t t n o our ours. 11. Sown low is t irm o n intrvl orr. Us t loritm tut in lss to in n intrvl rprsnttion. Tn us t First Fit olorin loritm to in t wit w n prtition o t post into w ins. Also, in mximum ntiin. W list low t own sts n t up sts. Tr r 5 istint own sts n 5 istint up sts (ts numrs will lwys t sm. Cn you xplin wy?), n w ll t own sts rom littl to i n t up sts rom i to littl. Tis lllin is sown in ol typ.

D() = {,,, } 5 D() = {, } D() = {,, } 4 D() = 1 D() = 1 D() = {} 2 D() = {, } U() = 5 U() = 5 U() = 5 U() = {,,,, } 1 U() = {,,, } 2 U() = {} 4 U() = {, } W sow low t intrvl rprsnttion wi tis lllin prous. Not tt tis rprsnttion is uniqu n it uss t wst numr o npoints. 1 2 [ ] [ ] 2 [ ] [ ] [ ] 1 1 [ ] [ ] 1 2 4 5 Fin t wit w o tis post n in mximum ntiin. In ontrst to t sitution in Prolm 10, w v ln loritm or inin t wit w, mximum ntiin n prtition o t post into w ins. Tis is omplis y pplyin t irst it olorin lorit in t orr o lt n points. Tis is illustrt in t iur y t olorin wit t ol olors pl nr t lt n points. Hr I v rokn tis y proin rom top to ottom in t pitur. Furtrmor, w s tt w = n {,, } is mximum ntiin. To s ow tis is on, lt k t lrst olor ssin. Wn vrtx x is ssin olor k, tn or i = 1, 2,..., k 1, t vrtx x must jnt to vrtx x i olor i wi s lry n olor. Tis mns tt t intrvl or x i ontins t lt npoint o t intrvl or x, so {x, x 1, x 2,..., x k 1 } is n ntiin o siz k. 12. Lt 2 1 t post onsistin o ll susts o {1, 2,,..., 1}, orr y inlusion.. Wt is t it o tis post? W not tt ll mximl ins r mximum n ll v 14 points. T rson is tt mximl in strts wit (0, 0, 0,..., 0 s its lst lmnt (1 zros in tis strin). Tn s w pro up t in, t stp zro is swpp out or on. Tis is rpt until w t to t vry top lmnt (1, 1, 1,..., 1).. Wt is t wit o tis post? T intnt o tis qustion is to s i you rmmr Sprnr s torm wi stts tt t wit o t ltti o ll susts o {1, 2,,..., n} is t mil inomil oiint C(n, n/2 ). So in tis s, t wit is C(1, 6) wi o ours n lso writtn s ( 1 6 ).

. How mny mximl ins os t post v? W v lry ommnt on t strutur o mximl ins. Usin tis strutur, w s tt tr r n! mximl ins. Tis ollows rom t t tt t stp 1, w n oos ny o t n zros in (0, 0, 0,..., 0) to tol to on. For t son stp, w oos on o t rminin n 1 zros to lip. Tn n 2, t.. How mny mximl ins in tis post pss trou t st {2, 5, 8, 10}? To nswr tis qustion, w pply t rsonin o t proin nswr in ot irtions, so t nswr is 4!9!. 1. Extr Crit. Sow tt t post sown low s imnsion 2 y inin two linr xtnsions wos intrstion is t prtil orr. i A rprsnttion o P usin qurtrplns is sown low. i From tis rprsnttion, w s tt w my tk: L 1 = [,,,,,,,, i] n L 2 = [,,,,, i,,, ].

Point Totls 1. Svn points. 2. Svn points.. Svn points. 4. Six points. 5. Six points. 6. Eit points. 7. Sixtn points. 16 = 2 + 2 + 2 + 2 + 2 + 6. 8. Six points. 6 = 2 + 2 + 2. 9. Six points. 10. Eit points. 11. Fitn points. 12. Eit points. 8 = 2 + 2 + 2 + 2. T totl is 100 n t Extr Crit prolm oul rn up to +10 points.