Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Size: px
Start display at page:

Download "Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S."

Transcription

1 ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both r ositiv ) both r ngtiv ) both r ositiv or both r ngtiv Coyright 2010 Prson Eution, In. ustion 19.1 Eltri Chrg I ustion 19.1b Eltri Chrg II Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? on is ositiv, th othr is ngtiv both r ositiv ) both r ngtiv ) both r ositiv or both r ngtiv From th itur, wht n you onlu bout th hrgs? hv oosit hrgs hv th sm hrg ) ll hv th sm hrg ) on bll must b nutrl (no hrg) Th ft tht th blls rl h othr n tll you only tht thy hv th sm hrg, but you o not know th sign. So thy n b ithr both ositiv or both ngtiv. Follow-u: Wht os th itur look lik if th two blls r oositly hrg? Wht bout if both blls r nutrl? ustion 19.1b Eltri Chrg II ustion 19.2 Conutors I From th itur, wht n you onlu bout th hrgs? hv oosit hrgs hv th sm hrg ) ll hv th sm hrg ) on bll must b nutrl (no hrg) A mtl bll hngs from th iling by n insulting thr. Th bll is ttrt to ositiv-hrg ro hl nr th bll. Th hrg of th bll must b: ositiv ngtiv ) nutrl ) ositiv or nutrl ) ngtiv or nutrl Th GREEN n PINK blls must hv th sm hrg, sin thy rl h othr. Th YELLOW bll lso rls th GREEN, so it must lso hv th sm hrg s th GREEN (n th PINK). Pg 1 1

2 ustion 19.2 A mtl bll hngs from th iling by n insulting thr. Th bll is ttrt to ositiv-hrg ro hl nr th bll. Th hrg of th bll must b: Conutors I ositiv ngtiv ) nutrl ) ositiv or nutrl ) ngtiv or nutrl ustion 19.2b Conutors II Two nutrl onutors r onnt by wir n hrg ro is brought nr, but os not touh. Th wir is tkn wy, n thn th hrg ro is rmov. Wht r th hrgs on th onutors? ) ) ) 0 0 Clrly, th bll will b ttrt if its hrg is ngtiv. Howvr, vn if th bll is nutrl, th hrgs in th bll n b srt by inution (olriztion), ling to nt ttrtion. Rmmbr th bll is onutor! Follow-u: Wht hns if th mtl bll is rl by lsti bll? 0 0?? ustion 19.2b Conutors II Two nutrl onutors r onnt by wir n hrg ro is brought nr, but os not touh. Th wir is tkn wy, n thn th hrg ro is rmov. Wht r th hrgs on th onutors? ) ) ) 0 0 ustion 19.3 Wht is th mgnitu of th for F 2? F 1 = 3 N F 2 =? Coulomb s Lw I 1.0 N 1.5 N ) 2.0 N ) 3.0 N ) 6.0 N Whil th onutors r onnt, ositiv hrg will flow from th blu to th grn bll u to olriztion. On isonnt, th hrgs will rmin on th srt onutors vn whn th ro is rmov. 0 0 Follow-u: Wht will hn whn th onutors r ronnt with wir??? ustion 19.3 Coulomb s Lw I ustion 19.3b Coulomb s Lw II Wht is th mgnitu of th for F 2? F 1 = 3 N F 2 =? 1.0 N 1.5 N ) 2.0 N ) 3.0 N ) 6.0 N F 1 = 3 N F 2 =? If w inrs on hrg to 4, wht is th mgnitu of F 1? F =? 1 4 F =? 2 3/4 N 3.0 N ) 12 N ) 16 N ) 48 N Th for F 2 must hv th sm mgnitu s F 1. This is u to th ft tht th form of Coulomb s lw is totlly symmtri with rst to th two hrgs involv. Th for of on on th othr of ir is th sm s th rvrs. Not tht this souns susiiously lik Nwton s 3r lw!! Pg 2 2

3 ustion 19.3b Coulomb s Lw II ustion 19.3 Coulomb s Lw III F 1 = 3 N F 2 =? If w inrs on hrg to 4, wht is th mgnitu of F 1? F =? 1 4 F =? 2 3/4 N 3.0 N ) 12 N ) 16 N ) 48 N Th for btwn two hrgs srt by istn is F. If th hrgs r ull rt to istn 3, wht is th for on h hrg? 9F 3F ) F ) 1/3F ) 1/9F Originlly w h: F 1 = k()()/r 2 = 3 N F F Now w hv: F 1 = k(4)()/r 2?? whih is 4 tims biggr thn bfor. Follow-u: Now wht is th mgnitu of F 2? 3 ustion 19.3 Coulomb s Lw III Th for btwn two hrgs 9F srt by istn is F. If 3F th hrgs r ull rt to ) F istn 3, wht is th for on ) 1/3F h hrg? ) 1/9F ustion 19.4 Two blls with hrgs n 4 r fix t srtion istn of. Is it ossibl to l nothr hrg bll 0 on th lin btwn th two hrgs suh tht th nt for on 0 will b zro? Eltri For I ys, but only if 0 is ositiv ys, but only if 0 is ngtiv ) ys, innnt of th sign (or vlu) of 0 ) no, th nt for n nvr b zro Originlly w h: F bfor = k()()/ 2 = F Now w hv: F ftr = k()()/(3) 2 = 1/9F? F F? 4 Follow-u: Wht is th for if th originl istn is hlv? 3 ustion 19.4 Two blls with hrgs n 4 r fix t srtion istn of. Is it ossibl to l nothr hrg bll 0 on th lin btwn th two hrgs suh tht th nt for on 0 will b zro? Eltri For I ys, but only if 0 is ositiv ys, but only if 0 is ngtiv ) ys, innnt of th sign (or vlu) of 0 ) no, th nt for n nvr b zro ustion 19.4b Eltri For II Two blls with hrgs n 4 r srt by. Whr shoul you l nothr hrg bll 0 on th lin btwn th two hrgs suh tht th nt for on 0 will b zro? A ositiv hrg woul b rll by both hrgs, so oint whr ths two rulsiv fors nl n b foun. A ngtiv hrg woul b ttrt by both, n th sm rgumnt hols. 4 b R 2R 4 Follow-u: Wht hns if both hrgs r? Whr woul th F = 0 oint b in this s? Pg 3 3

4 ustion 19.4b Two blls with hrgs n 4 r srt by. Whr shoul you l nothr hrg bll 0 on th lin btwn th two hrgs suh tht th nt for on 0 will b zro? b R Eltri For II 2R 4 ustion 19.4 Two blls with hrgs n 4 r fix t srtion istn of. Is it ossibl to l nothr hrg bll 0 nywhr on th lin suh tht th nt for on 0 will b zro? Eltri For III ys, but only if 0 is ositiv ys, but only if 0 is ngtiv ) ys, innnt of th sign (or vlu) of 0 ) no, th nt for n nvr b zro Th for on 0 u to is: F = k( 0 )()/R 2 Th for on 0 u to 4 is: F = k( 0 )(4)/(2R) 2 Sin 4 is 4 tims biggr thn, 0 ns to b frthr from 4. In ft, 0 must b twi s fr from 4, sin th istn is squr in Coulomb s lw. 4 ustion 19.4 Two blls with hrgs n 4 r fix t srtion istn of. Is it ossibl to l nothr hrg bll 0 nywhr on th lin suh tht th nt for on 0 will b zro? Eltri For III ys, but only if 0 is ositiv ys, but only if 0 is ngtiv ) ys, innnt of th sign (or vlu) of 0 ) no, th nt for n nvr b zro ustion 19.5 A roton n n ltron r hl rt istn of 1 m n thn rls. As thy roh h othr, wht hns to th for btwn thm? Proton n Eltron I it gts biggr it gts smllr ) it stys th sm A hrg (ositiv or ngtiv) n b l to th lft of th hrg, suh tht th rulsiv for from th hrg nls th ttrtiv 4 for from 4. Follow-u: Wht hns if on hrg is n th othr is? ustion 19.5 Proton n Eltron I ustion 19.5b Proton n Eltron II A roton n n ltron r hl rt istn of 1 m n thn rls. As thy roh h othr, wht hns to th for btwn thm? it gts biggr it gts smllr ) it stys th sm A roton n n ltron r hl rt istn of 1 m n thn rls. Whih rtil hs th lrgr lrtion t ny on momnt? roton ltron ) both th sm By Coulomb s lw, th for btwn th two hrgs is invrsly roortionl to th istn squr. So, th losr thy gt to h othr, th biggr th ltri for btwn thm gts! F = k r Follow-u: Whih rtil fls th lrgr for t ny on momnt? Pg 4 4

5 ustion 19.5b Proton n Eltron II A roton n n ltron r roton hl rt istn of 1 m ltron n thn rls. Whih ) both th sm rtil hs th lrgr lrtion t ny on momnt? ustion 19.5 A roton n n ltron r hl rt istn of 1 m n thn lt go. Whr woul thy mt? Proton n Eltron III in th mil losr to th ltron s si ) losr to th roton s si Th two rtils fl th sm for. Sin F = m, th rtil with th smllr mss will hv th lrgr lrtion. This is th ltron. F = k r ustion 19.5 Proton n Eltron III ustion 19.6 Fors in 2D b A roton n n ltron r hl rt istn of 1 m n thn lt go. Whr woul thy mt? in th mil losr to th ltron s si ) losr to th roton s si Whih of th rrows bst rrsnts th irtion of th nt for on hrg u to th othr two hrgs? 2 By Nwton s 3r lw, th ltron n roton fl th sm for. But, sin F = m, n sin th roton s mss is muh grtr, th roton s lrtion will b muh smllr! 4 Thus, thy will mt losr to th roton s originl osition. Follow-u: Whih rtil will b moving fstr whn thy mt? ustion 19.6 Fors in 2D Whih of th rrows bst rrsnts th irtion of th nt for on hrg 2 u to th othr two hrgs? b ustion 19.7 You r sitting rtin istn from oint hrg, n you msur n ltri fil of E 0. If th hrg is oubl n your istn from th hrg is lso oubl, wht is th ltri fil strngth now? Eltri Fil 4E 0 2E 0 ) E 0 ) 1/2E 0 ) 1/4E 0 Th hrg 2 rls towr th right. Th hrg 4 rls uwr, but with strongr for. Thrfor, th nt for is u n to th right, but mostly u. Follow-u: Wht woul hn if th yllow hrg wr 3? Pg 5 5

6 ustion 19.7 You r sitting rtin istn from oint hrg, n you msur n ltri fil of E 0. If th hrg is oubl n your istn from th hrg is lso oubl, wht is th ltri fil strngth now? Eltri Fil 4E 0 2E 0 ) E 0 ) 1/2E 0 ) 1/4E 0 ustion 19.8 Btwn th r n th blu hrg, whih of thm xrins th grtr ltri fil u to th grn hrg? Fil n For I 1 2 ) th sm for both Rmmbr tht th ltri fil is: E = k/r 2. Doubling th hrg uts ftor of 2 in th numrtor, but oubling th istn uts ftor of 4 in th nomintor, bus it is istn squr!! Ovrll, tht givs us ftor of 1/ Follow-u: If your istn is oubl, wht must you o to th hrg to mintin th sm E fil t your nw osition? ustion 19.8 Fil n For I ustion 19.8b Fil n For II Btwn th r n th blu hrg, whih of thm xrins th grtr ltri fil u to th grn hrg? 1 2 ) th sm for both Btwn th r n th blu hrg, whih of thm xrins th grtr ltri for u to th grn hrg? 1 2 ) th sm for both Both hrgs fl th sm ltri fil u to th grn hrg bus thy r t th sm oint in s! E = k 2 r ustion 19.8b Fil n For II ustion 19.9 Surosition I Btwn th r n th blu hrg, whih of thm xrins th grtr ltri for u to th grn hrg? 1 2 ) th sm for both Wht is th ltri fil t th ntr of th squr? ) E = 0 b Th ltri fil is th sm for both hrgs, but th for on givn hrg lso ns on th mgnitu of tht sifi hrg. F = qe Pg 6 6

7 ustion 19.9 Surosition I ustion 19.9b Surosition II Wht is th ltri fil t th ntr of th squr? b Wht is th ltri fil t th ntr of th squr? b ) E = 0 ) E = 0 For th ur hrg, th E fil vtor t th ntr of th squr oints towr tht hrg. For th lowr hrg, th sm thing is tru. Thn th vtor sum of ths two E fil vtors oints to th lft. Follow-u: Wht if th lowr hrg wr 2 C? Wht if both hrgs wr 2 C? ustion 19.9b Wht is th ltri fil t Surosition II b th ntr of th squr? ) E = 0 ustion 19.9 Wht is th irtion of th ltri fil t th osition of th X? Surosition III - b Th four E fil vtors ll oint outwr from th ntr of th squr towr thir rstiv hrgs. Bus thy r ll qul, th nt E fil is zro t th ntr!! Follow-u: Wht if th ur two hrgs wr 2 C? Wht if th right-hn hrgs wr 2 C? ustion 19.9 Surosition III - Wht is th irtion of th ltri fil t th osition of th X? b Th two hrgs giv rsultnt E fil tht is own n to th right. Th hrg hs n E fil u n to th lft, but smllr in mgnitu. Thrfor, th totl ltri fil is own n to th right. Follow-u: Wht if ll thr hrgs rvrs thir signs? ustion Two hrgs r fix long th x xis. Thy rou n ltri fil E irt long th ngtiv y xis t th init oint. Whih of th following is tru? Fin th Chrgs hrgs r qul n ositiv hrgs r qul n ngtiv ) hrgs r qul n oosit ) hrgs r qul, but sign is untrmin ) hrgs nnot b qul 1 y E 2 x Pg 7 7

8 ustion Fin th Chrgs ustion Uniform Eltri Fil Two hrgs r fix long th x xis. Thy rou n ltri fil E irt long th ngtiv y xis t th init oint. Whih of th following is tru? hrgs r qul n ositiv hrgs r qul n ngtiv ) hrgs r qul n oosit ) hrgs r qul, but sign is untrmin ) hrgs nnot b qul In uniform ltri fil in mty s, 4 C hrg is l n it fls n ltri for of 12 N. If this hrg is rmov n 6 C hrg is l t tht oint inst, wht for will it fl? 12 N 8 N ) 24 N ) no for ) 18 N Th wy to gt th rsultnt PINK vtor is to us th GREEN n BLUE vtors. Ths E vtors orrson to qul hrgs (bus th lngths r qul) tht r both ngtiv (bus thir y E irtions r towr th hrgs). 1 2 x Follow-u: How woul you gt th E fil to oint towr th right? ustion Uniform Eltri Fil ustion Eltri Fil Lins I In uniform ltri fil in mty 12 N s, 4 C hrg is l n it fls n ltri for of 12 N. If this hrg is rmov n 6 C hrg is l t tht oint inst, wht for will it fl? 8 N ) 24 N ) no for ) 18 N Wht r th signs of th hrgs whos ltri fils r shown t right? ) ) ) no wy to tll Sin th 4 C hrg fls for, thr must b n ltri fil rsnt, with mgnitu: E = F / q = 12 N / 4 C = 3 N/C On th 4 C hrg is rl with 6 C hrg, this nw hrg will fl for of: F = q E = (6 C)(3 N/C) = 18 N Follow-u: Wht if th hrg is l t iffrnt osition in th fil? ustion Eltri Fil Lins I ustion 19.12b Eltri Fil Lins II Wht r th signs of th hrgs whos ltri fils r shown t right? ) Whih of th hrgs hs th grtr mgnitu? ) ) both th sm ) no wy to tll Eltri fil lins origint on ositiv hrgs n trmint on ngtiv hrgs. Pg 8 8

9 ustion 19.12b Eltri Fil Lins II Whih of th hrgs hs th grtr mgnitu? ) both th sm Th fil lins r nsr roun th r hrg, so th r on hs th grtr mgnitu. Follow-u: Wht is th r/grn rtio of mgnitus for th two hrgs? Pg 9 9

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

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

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

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

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

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

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

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

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

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

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

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

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

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

More information

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

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

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

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

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

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

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

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA. S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths

More information

Construction 11: Book I, Proposition 42

Construction 11: Book I, Proposition 42 Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

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

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii - Nming frtions Chptr Frtions Eh shp rprsnts ONE whol. i ii Wht frtion is shdd? Writ s frtion nd in words. Wht frtion is not shdd? Writ s frtion nd in words. i ii i ii Writ s mny diffrnt frtions s you

More information

Chem 104A, Fall 2016, Midterm 1 Key

Chem 104A, Fall 2016, Midterm 1 Key hm 104A, ll 2016, Mitrm 1 Ky 1) onstruct microstt tl for p 4 configurtion. Pls numrt th ms n ml for ch lctron in ch microstt in th tl. (Us th formt ml m s. Tht is spin -½ lctron in n s oritl woul writtn

More information

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

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c. MA56 utorial Solutions Qustion a Intgrating fator is ln p p in gnral, multipl b p So b ln p p sin his kin is all a Brnoulli quation -- st Sin w fin Y, Y Y, Y Y p Qustion Dfin v / hn our quation is v μ

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

The Angular Momenta Dipole Moments and Gyromagnetic Ratios of the Electron and the Proton

The Angular Momenta Dipole Moments and Gyromagnetic Ratios of the Electron and the Proton Journl of Modrn hysics, 014, 5, 154-157 ublishd Onlin August 014 in SciRs. htt://www.scir.org/journl/jm htt://dx.doi.org/.436/jm.014.51415 Th Angulr Momnt Diol Momnts nd Gyromgntic Rtios of th Elctron

More information

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

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 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

Polygons POLYGONS.

Polygons POLYGONS. Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

Physics 222 Midterm, Form: A

Physics 222 Midterm, Form: A Pysis 222 Mitrm, Form: A Nm: Dt: Hr r som usul onstnts. 1 4πɛ 0 = 9 10 9 Nm 2 /C 2 µ0 4π = 1 10 7 tsl s/c = 1.6 10 19 C Qustions 1 5: A ipol onsistin o two r point-lik prtils wit q = 1 µc, sprt y istn

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

Case Study VI Answers PHA 5127 Fall 2006

Case Study VI Answers PHA 5127 Fall 2006 Qustion. A ptint is givn 250 mg immit-rls thophyllin tblt (Tblt A). A wk ltr, th sm ptint is givn 250 mg sustin-rls thophyllin tblt (Tblt B). Th tblts follow on-comprtmntl mol n hv first-orr bsorption

More information

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

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

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

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9 Lctur contnts Bloch thorm -vctor Brillouin zon Almost fr-lctron modl Bnds ffctiv mss Hols Trnsltionl symmtry: Bloch thorm On-lctron Schrödingr qution ch stt cn ccommo up to lctrons: If Vr is priodic function:

More information

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

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

Review & Summary. Field Due to a Point Charge The magnitude of the electric set up by a point charge q at a distance r from the charge is

Review & Summary. Field Due to a Point Charge The magnitude of the electric set up by a point charge q at a distance r from the charge is CHATE 22 ELECTIC FIELDS viw & Summr Elctric Fil To lin th lctrosttic forc btwn two chrgs, w ssum tht ch chrg sts u n lctric fil in th sc roun it. Th forc cting on ch chrg is thn u to th lctric fil st u

More information

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

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

IIT JEE MATHS MATRICES AND DETERMINANTS

IIT JEE MATHS MATRICES AND DETERMINANTS IIT JEE MTHS MTRICES ND DETERMINNTS THIRUMURUGN.K PGT Mths IIT Trir 978757 Pg. Lt = 5, th () =, = () = -, = () =, = - (d) = -, = -. Lt sw smmtri mtri of odd th quls () () () - (d) o of ths. Th vlu of th

More information

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

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

Binomials and Pascal s Triangle

Binomials and Pascal s Triangle Binomils n Psl s Tringl Binomils n Psl s Tringl Curriulum R AC: 0, 0, 08 ACS: 00 www.mthltis.om Binomils n Psl s Tringl Bsis 0. Intif th prts of th polnomil: 8. (i) Th gr. Th gr is. (Sin is th highst

More information

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

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

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

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Jonathan Turner Exam 2-10/28/03

Jonathan Turner Exam 2-10/28/03 CS Algorihm n Progrm Prolm Exm Soluion S Soluion Jonhn Turnr Exm //. ( poin) In h Fioni hp ruur, u wn vrx u n i prn v u ing u v i v h lry lo hil in i l m hil o om ohr vrx. Suppo w hng hi, o h ing u i prorm

More information

Handout 28. Ballistic Quantum Transport in Semiconductor Nanostructures

Handout 28. Ballistic Quantum Transport in Semiconductor Nanostructures Hanout 8 Ballisti Quantum Transport in Smionutor Nanostruturs In this ltur you will larn: ltron transport without sattring (ballisti transport) Th quantum o onutan an th quantum o rsistan Quanti onutan

More information

UNIT # 08 (PART - I)

UNIT # 08 (PART - I) . r. d[h d[h.5 7.5 mol L S d[o d[so UNIT # 8 (PRT - I CHEMICL INETICS EXERCISE # 6. d[ x [ x [ x. r [X[C ' [X [[B r '[ [B [C. r [NO [Cl. d[so d[h.5 5 mol L S d[nh d[nh. 5. 6. r [ [B r [x [y r' [x [y r'

More information

HIGHER ORDER DIFFERENTIAL EQUATIONS

HIGHER ORDER DIFFERENTIAL EQUATIONS Prof Enriqu Mtus Nivs PhD in Mthmtis Edution IGER ORDER DIFFERENTIAL EQUATIONS omognous linr qutions with onstnt offiints of ordr two highr Appl rdution mthod to dtrmin solution of th nonhomognous qution

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

Module 2 Motion Instructions

Module 2 Motion Instructions Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr

More information

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

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

This chapter covers special properties of planar graphs.

This chapter covers special properties of planar graphs. Chptr 21 Plnr Grphs This hptr ovrs spil proprtis of plnr grphs. 21.1 Plnr grphs A plnr grph is grph whih n b rwn in th pln without ny gs rossing. Som piturs of plnr grph might hv rossing gs, but it s possibl

More information

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

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

Decimals DECIMALS.

Decimals DECIMALS. Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths

More information

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

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

ELECTRIC CURRENT. charge carrier. electric field MISN ELECTRIC CURRENT. by F. Reif, George Brackett and Jill Larkin CONTENTS

ELECTRIC CURRENT. charge carrier. electric field MISN ELECTRIC CURRENT. by F. Reif, George Brackett and Jill Larkin CONTENTS MISN0423 ELECTRIC CURRENT ELECTRIC CURRENT y F. Rif, Gorg Brktt n Jill Lrkin hrg rrir ltri fil CONTENTS A. Dfinition n Proprtis of Currnt B. Currnt n Motion of Chrg Prtils C. Sty Stt Currnts D. TwoTrminl

More information

Chapter 1. Analysis of a M/G/1/K Queue without Vacations

Chapter 1. Analysis of a M/G/1/K Queue without Vacations Chatr nalysis of a M/G// Quu without Vaations W onsir th singl srvr finit aaity quu with Poisson arrivals an gnrally istriut srvi tims. Th M/G// systm may analys using an im Marov Chain aroah vry similar

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

CONTINUITY AND DIFFERENTIABILITY

CONTINUITY AND DIFFERENTIABILITY MCD CONTINUITY AND DIFFERENTIABILITY NCERT Solvd mpls upto th sction 5 (Introduction) nd 5 (Continuity) : Empl : Chck th continuity of th function f givn by f() = + t = Empl : Emin whthr th function f

More information

Single Correct Type. cos z + k, then the value of k equals. dx = 2 dz. (a) 1 (b) 0 (c)1 (d) 2 (code-v2t3paq10) l (c) ( l ) x.

Single Correct Type. cos z + k, then the value of k equals. dx = 2 dz. (a) 1 (b) 0 (c)1 (d) 2 (code-v2t3paq10) l (c) ( l ) x. IIT JEE/AIEEE MATHS y SUHAAG SIR Bhopl, Ph. (755)3 www.kolsss.om Qusion. & Soluion. In. Cl. Pg: of 6 TOPIC = INTEGRAL CALCULUS Singl Corr Typ 3 3 3 Qu.. L f () = sin + sin + + sin + hn h primiiv of f()

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},

More information

Elliptical motion, gravity, etc

Elliptical motion, gravity, etc FW Physics 130 G:\130 lctur\ch 13 Elliticl motion.docx g 1 of 7 11/3/010; 6:40 PM; Lst rintd 11/3/010 6:40:00 PM Fig. 1 Elliticl motion, grvity, tc minor xis mjor xis F 1 =A F =B C - D, mjor nd minor xs

More information

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration

More information

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

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 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations. Dy : Mondy 5 inuts. Ovrviw of th PH47 wsit (syllus, ssignnts tc.). Coupld oscilltions W gin with sss coupld y Hook's Lw springs nd find th possil longitudinl) otion of such syst. W ll xtnd this to finit

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

C-201 Sheet Bar Measures 1 inch

C-201 Sheet Bar Measures 1 inch Janine M. lexander, P.. P.. No. 9, L 0 N. PRK RO, SUIT 0 HOLLYWOO, LORI 0 PHON: (9) - X: (9) 08- No.: 9 I ST SRIPTION Y GT VLVS SHLL RSILINT ST, MNUTUR TO MT OR X TH RQUIRMNTS O WW 09 (LTST RVISION) N

More information

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

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

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

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

Practice Test I Bonding and Geometry Name Per

Practice Test I Bonding and Geometry Name Per Prti Tst Boning n Gomtry Nm Pr This is prti - Do NOT ht yourslf of fining out wht you r pl of oing. B sur you follow th tsting onitions outlin low. DO NOT USE A CALCULATOR. You my us ONLY th lu prioi tl.

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss

More information

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

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Numerical methods, Mixed exercise 10

Numerical methods, Mixed exercise 10 Numrial mthos, Mi ris a f ( ) 6 f ( ) 6 6 6 a = 6, b = f ( ) So. 6 b n a n 6 7.67... 6.99....67... 6.68....99... 6.667....68... To.p., th valus ar =.68, =.99, =.68, =.67. f (.6).6 6.6... f (.6).6 6.6.7...

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

More information

SAFE HANDS & IIT-ian's PACE EDT-15 (JEE) SOLUTIONS

SAFE HANDS & IIT-ian's PACE EDT-15 (JEE) SOLUTIONS It is not possibl to find flu through biggr loop dirctly So w will find cofficint of mutual inductanc btwn two loops and thn find th flu through biggr loop Also rmmbr M = M ( ) ( ) EDT- (JEE) SOLUTIONS

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

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

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

Weighted Matching and Linear Programming

Weighted Matching and Linear Programming Wightd Mtching nd Linr Progrmming Jonthn Turnr Mrch 19, 01 W v sn tht mximum siz mtchings cn b found in gnrl grphs using ugmnting pths. In principl, this sm pproch cn b pplid to mximum wight mtchings.

More information

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM Fr Est Journl o Mthtil Sins (FJMS) Volu 6 Nur Pgs 8- Pulish Onlin: Sptr This ppr is vill onlin t http://pphjo/journls/jsht Pushp Pulishing Hous DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF MATRICES

More information

MSLC Math 151 WI09 Exam 2 Review Solutions

MSLC Math 151 WI09 Exam 2 Review Solutions Eam Rviw Solutions. Comput th following rivativs using th iffrntiation ruls: a.) cot cot cot csc cot cos 5 cos 5 cos 5 cos 5 sin 5 5 b.) c.) sin( ) sin( ) y sin( ) ln( y) ln( ) ln( y) sin( ) ln( ) y y

More information

On each of them are the numbers +6, 5, +4, 3, +2, 1. The two dice are rolled. The score is obtained by adding the numbers on the upper faces.

On each of them are the numbers +6, 5, +4, 3, +2, 1. The two dice are rolled. The score is obtained by adding the numbers on the upper faces. Cmrig Essntils Mthmtis Cor 8 N1.1 Homwork N1.1 Homwork 1 A thr shows hr lss 2 six-si i. On h of thm r th numrs +6, 5, +4, 3, +2, 1. Th two i r roll. Th sor is otin y ing th numrs on th uppr fs. Clult th

More information

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse Animls shp T h i nk Wht o you know? 2 2:29 Listn n fin. hors Wht s this? Wht s this? It s got ig nos. It s ig n gry. It s hors! YES! 2 Wht r ths? Wht r ths? Thy v got two lgs. Thy r smll n rown. Thy r

More information