Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Similar documents
Three Phase Asymmetrical Load Flow for Four-Wire Distribution Networks

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

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Determination of slot leakage inductance for three-phase induction motor winding using an analytical method

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

The University of Sydney MATH 2009

In which direction do compass needles always align? Why?

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

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

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

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

Lecture 20: Minimum Spanning Trees (CLRS 23)

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

SERVICE MANUAL BG3R TRINITRON COLOR TV CHASSIS. KV-AR25M60 RM-995 Thailand. KV-AR25N90 RM-996 Philippines KV-AR25M80 RM-995 ME KV-AR25M66 RM-993 GE

Appendix. In the absence of default risk, the benefit of the tax shield due to debt financing by the firm is 1 C E C

STRIPLINES. A stripline is a planar type transmission line which is well suited for microwave integrated circuitry and photolithographic fabrication.

Introduction to Inertial Dynamics

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

I M P O R T A N T S A F E T Y I N S T R U C T I O N S W h e n u s i n g t h i s e l e c t r o n i c d e v i c e, b a s i c p r e c a u t i o n s s h o

Graphs Depth First Search

MIL-DTL SERIES 2

NUCON NRNON CONRNC ON CURRN RN N CHNOOGY, 011 oo uul o w ul x ol volv y y oll. y ov,., - o lo ll vy ul o Mo l u v ul (G) v Gl vlu oll. u 3- [11]. 000

An action with positive kinetic energy term for general relativity. T. Mei

SYMMETRICAL COMPONENTS

Lecture 9-3/8/10-14 Spatial Description and Transformation

Strongly connected components. Finding strongly-connected components

F102 1/4 AMP +240 VDC SEE FIGURE 5-14 FILAMENT AND OVEN CKTS BLU J811 BREAK-IN TB103 TO S103 TRANSMITTER ASSOCIATED CAL OFF FUNCTION NOTE 2 STANDBY

Lecture II: Minimium Spanning Tree Algorithms

Stable Matching for Spectrum Market with Guaranteed Minimum Requirement

THIS PAGE DECLASSIFIED IAW E

Jonathan Turner Exam 2-10/28/03

fur \ \,,^N/ D7,,)d.s) 7. The champion and Runner up of the previous year shall be allowed to play directly in final Zone.

FOR LEASE 701 EAST TIMPANOGOS PARKWAY OREM, UTAH Exclusively Marketed by

Amphenol RNJ LOW PROFILE. Harsh Environment Rack & Panel Cylindrical Connectors

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW)

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

SHELL CANADA PIPING AND INSTRUMENT DIAGRAM QUEST CCS PROJECT LEGENDS AND SYMBOLS QUEST CCS PROJECT UNIT COMMON "!!

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

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

Easy Steps to build a part number... Tri-Start Series III CF P

Telecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4"C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48" AFF.

h : sh +i F J a n W i m +i F D eh, 1 ; 5 i A cl m i n i sh» si N «q a : 1? ek ser P t r \. e a & im a n alaa p ( M Scanned by CamScanner

Today. CS 232: Ar)ficial Intelligence. Search. Agents that Plan. September 3 rd, 2015 Search Problems. Uninformed Search Methods

A simple 2-D interpolation model for analysis of nonlinear data

drawing issue sheet Former Royal High School - Hotel Development

264m. Raggengill Gilkerscleuch. Abington. 250m. Cottage. Iss. Mast. 246m. TER R AC E 240m OO KE TE H U N TE COLEBROOKE. Over Abington STATION.

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

LOWELL, MICHIGAN, THURSDAY, MARCH 7, 1929 HATS OFF TO PRESIDENT HOOVER

CS 103 BFS Alorithm. Mark Redekopp

CS 188: Artificial Intelligence Spring Announcements

"The Crescent" Student Newspaper, December 31, 1935

- ASSEMBLY AND INSTALLATION -

A H C H. for the homeless WRIGHT AND HAMMER FIRST STREET CAMPUS EXPANSION 1220 FIRST STREET, NW ALBUQUERQUE, NEW MEXICO. CITY OF ALBUQUERQUE - estamp

VICTORIA AVE. Chip pawa- Gra ss Isl and Pool. Ice Dam Niagara Falls WTP and Intake. Chippawa. Cree

T h e C S E T I P r o j e c t

CBSE , ˆj. cos CBSE_2015_SET-1. SECTION A 1. Given that a 2iˆ ˆj. We need to find. 3. Consider the vector equation of the plane.

Winnie flies again. Winnie s Song. hat. A big tall hat Ten long toes A black magic wand A long red nose. nose. She s Winnie Winnie the Witch.

I L Livermore. San Jose CALTRANS STANDARD PLANS (DATED 2010) A20 A,B,D A24 D RSP A88A ES-7A ES-5A,B ES-5C REVIEWED BY:

Neutrosophic Hyperideals of Semihyperrings

10.3 The Quadratic Formula

L...,,...lllM" l)-""" Si_...,...

n r t d n :4 T P bl D n, l d t z d th tr t. r pd l

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

Who is this Great Team? Nickname. Strangest Gift/Friend. Hometown. Best Teacher. Hobby. Travel Destination. 8 G People, Places & Possibilities

Self-Adjusting Top Trees

SHT 1 OF 3 SHT 2 AND 3 ARE -A- SIZE

< < or a. * or c w u. "* \, w * r? ««m * * Z * < -4 * if # * « * W * <r? # *» */>* - 2r 2 * j j. # w O <» x <» V X * M <2 * * * *

E-Companion: Mathematical Proofs

Graph Search (6A) Young Won Lim 5/18/18

NEWBERRY FOREST MGT UNIT Stand Level Information Compartment: 10 Entry Year: 2001

P a g e 5 1 of R e p o r t P B 4 / 0 9

sin sin 1 d r d Ae r 2

OpenMx Matrices and Operators


0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r

SE1.1. vloh=`lrkqv=c^jfiv=`lroq. eb`hib=_isai=ol`h=efiii=p` vloh=`lrkqv SITE PLAN - SECURITY. dbkbo^i=klqbp

Grady Memorial Hospital. Facade Rehabilitation Project

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


15 DEFINITE INTEGRALS

R e p u b lic o f th e P h ilip p in e s. R e g io n V II, C e n tra l V isa y a s. C ity o f T a g b ila ran

KEB INVERTER L1 L2 L3 FLC - RELAY 1 COMMON I1 - APPROACH CLOSE 0V - DIGITAL COMMON FLA - RELAY 1 N.O. AN1+ - ANALOG 1 (+) CRF - +10V OUTPUT

Closed Monochromatic Bishops Tours

O W 1 L L LiXWJER. Memorial. W. M. Lawton Shone Bright. Park Planted. Legionaires. Yesterday. Met at Lowell

VICTORIA AVE. Chippawa. Cree

n ARTICLE INFO *Corresponding Author

Humanistic, and Particularly Classical, Studies as a Preparation for the Law

Priority Search Trees - Part I

P a g e 3 6 of R e p o r t P B 4 / 0 9

HYPERBOLIC ALTERNATING VIRTUAL LINK GROUPS

, (1). -, [9], [1]. 1.. T =[ a] R: _(t)=f((t)) _ L(t) () = x f, L(t) T., L(t), L() = L(a ; ) = L(a). (2) - : L n (t) =(L n )(t) = 1=n R supp [ 1], 1R

Outline. CSE 473: Artificial Intelligence Spring Types of Agents

bounty Herald Times THURSDAY,- SEPTEMBER!7, 1925

CBSE SAMPLE PAPER SOLUTIONS CLASS-XII MATHS SET-2 CBSE , ˆj. cos. SECTION A 1. Given that a 2iˆ ˆj. We need to find

-Z ONGRE::IONAL ACTION ON FY 1987 SUPPLEMENTAL 1/1

On Fractional Operational Calculus pertaining to the product of H- functions


4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th

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

w x a f f s t p q 4 r u v 5 i l h m o k j d g DT Competition, 1.8/1.6 Stainless, Black S, M, L, XL Matte Raw/Yellow

Transcription:

CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n o t oot mut t lt 20. Sn t n t mot l n, w mut v t lt 2 20 no. In t O(m lo lo n) nly o t tton t tutu, w n t noton o omnnt no. Suo t tton t tutu 6 mllon no. I t oot o t t nvolv n t ov n oton n o 30, wt t mxmum num o no lon t n t tt oul omnnt? Exln you nw. T Δ vlu o t omnnt no mut n y mo tn to o >2 you o own t n t om t oot. Sn t t omnnt no mut v Δ, t nxt mut Δ 3, t nxt mut v Δ 7 n t nxt mut v Δ 5. I t w not omnnt no, t woul v Δ 3, ut t not ol, vn tt t n o t oot 30. So, t n t mot 4 omnnt no. In t, n t ot no v Δ o t lt, vn ou omnnt no too mny to t n o t oot om xn 30. Wt 3 omnnt no, w n v 7 nonomnnt no wt Δ o. An t to 37 v 28, w mll tn t vn oot n o 30. So t mxmum num o omnnt no 3. Con no x wt n(x)=0 n n((x))=8. Suo w om t oton nvolvn no x n x not omnnt mmtly o o t n oton. Wt t mllt ol vlu tt n((x)) n v t t t n oton v omlt? Exln you nw. E o t n mut n t Δ(x) y t lt to o 3/2. So, t t n n t om 8 to t lt 8(3/2) 3 =27. Sn n(x)=0, t lo mn tt n((x)) t lt 27.

2 2. (2 ont) T m low ow tl ntton o n ntmt tt n t xuton o t ntommon nto lotm. In t tt, w no on?, n on, Wt t nt on nto o o t no, n n? no()=, no(n)=, no()= Fo w t lotm omut t n vlu t t ont? {,t}, {,} Sow ow t tton n t t unt uv ll to t n unton tun Ptton m n n t t m : {,), {,t}, {,}, {,}, {,} t n t m

3. (2 ont) T m low ow tl ntton o t tt o t ounon lotm. Slly, t ow t, t t n t ltt (wt y n n omtt). 4 4 () 3 5 2 5 m m 6 2 4 3 2 m m 3 2 4 3 m () () () Lt t t n y t tton t tutu o t tt. Fo t n t tton, l t nonl lmnt. T nonl lmnt unln n t t t t: {,}, {,}, {,,}, {,,,,m} In t m ov w n X tou ll no n () tt on lt y t lotm. T lt no t ummy no t t to, lu ot, ot, ot I t t ontnn t t ont o t ounon uu t t ont n tm. Lt t ut o () tt tun y t u mto n t nmn oton t t tt o t mn loo. Alo, ow t tt tun y t y mto, wtn nmn. 3

4. (5 ont) T u low ow n ntmt t n t xuton o Emon lotm o nn mxmum z mtn. T mtn not own xltly, ut nt ont own n t tton t tutu own. B n m Dw lo uv oun t vtx t w om loom n t unt. M t o t loom wt B. M vn vt wt lu n n o vt wt mnu n. Int w n t unt mtn, y mn tm wt n M. I {,} o nxt, n umntn t oun. Lt t vt n tt umntn t. nm B 4

5. (20 ont) In t nly o t ott umntn t lotm, w n lvl (u) to t lnt o t ott t om to u n t ul, t t t umntn t. A t lotm o, lvl (t) n t vou ont n w n n to t o twn two uv n to lvl (t). Wt t lt num o tt t ott umntn t lotm wll xut on unt ntwo wt n vt n m? Exln you nw. 2(n2) /2 on t nly o Dn lotm, n t n oon tly to t u n Dn lotm. Suo tt o vn lvl (t) =. Gv n u oun on t num o umntn t t n tt. (Hnt: n unt ntwo, n two umntn t oun n t m tou t m vtx?) Exln you nw. E no n only u on n, n ut on nomn o outon n t t ll. Conuntly, t num o umntn t n t t mot (n2)/ Now, v n u oun on t tm nt nn umntn t o lnt. Sn umntn t t O(m) tm, t totl tm nt O(mn/) Now, u t ult om t lt two t to v n u oun on t totl tm nt y t ott umntn t lotm on unt ntwo. I N t mx num o, t unnn tm O(mn(/2/3.../N))=O(mn lo N) =O(mn lo n). 5

6. (8 ont) Con t ny t own low. I t ll ln ny t ( l t). I o, ow vlu o t n tt ty t nvnt on t n. I not, ow ow t n m ln wt nl otton n ow t o n tt ty t nvnt o t t t t otton oton. It not ll ln ny t. I t w, t n() woul v to t lt 2, n o to ontnt wt t n()=. But t ml n() mut t lt 3 n tt ontt t t tt t tmot nl (t xtnl no w t t l o ) n o 0. T t low otn y on t otton t t oot n t n own ty t nvnt on t n. 2 2 2 6

7. (20 ont) In t nly o t lutn ny t, tn num o t llot to ly. Suo tt 25 t llot to ly t no x. Wt t mllt ol num o no n t t? Exln you nw. I t oot o t t tn t num o llot t 3(n() n(x). Sn t num 25, t n n n twn x n 8. T ml tt n() t lt 8. In t ontxt, t n o no t loo o t l o t num o nnt tt t. Hn t num o no t lt 256. Wt t n to t vlu o n(x) ult o t ly? Exln you nw. At t ly, x t oot o t t, o t t m n tt onlly. So, t n(x) n y 8. Suo tt ly t no x tn ly t, ll o w nvolv oulotton. Suo tt o x o t ly t, ((x)) t m n x n o t mnn t t n o ((x)) ul to n(x)3. I C t num o t n to mntn t t nvnt o t ly, n C 2 t num n t t ly, v low oun on t n C C 2. Exln you nw. Fom t nly o t lutn t, w now tt wn w o oul otton wt n(x)=n(((x))), t lt on t l (tt, w n t lt on w t t t t tn w o t t). So, t 6 t o w n(x)=n(((x))), l t lt 6 t. W lo now tt wn n(x)<n(((x))), tt t lt /3 o t t llot to t t l. E o t ou t wt n(((x)))=n(x)3 9 t llot to t. Sn 3 o t no lon n t t t, w n totl o 2 t om t t. Comnn t ult, w v tt C C 2 t lt 8. 7