ECE Experiment #6 Kitchen Timer
|
|
- Millicent Morrison
- 6 years ago
- Views:
Transcription
1 ECE Exprimnt #6 Kithn Timr Sprin 2006 Smstr Introution This xprimnt hs you onstrut iruit intrfin nin I/O lins from th 68HC11 with two svn smnt isplys n mtrix kyp, n writ ssmbly lnu o to rliz prormmbl ountown kithn timr tht llows th usr to prform vrious funtions: prst ount vlu, strt/rsum n pus ountown. Th purpos of this xprimnt is to th vn hrwr n softwr thniqus of intrfin miroontrollrs. Rquir Hrwr In ition to th MiroStmp11 moul, this xprimnt rquirs two svn smnt LED isplys, mtrix kyp, two TTL hx invrtrs (on 74LS04 IC), th 220Ω DIP rsistors n th 10KΩ SIP rsistors. Hr is photo of th omplt iruit:
2 Wirin Dirm Buil th followin iruit on solrlss brbor th iruit is vry similr to tht in Exprimnt 5. Th biirtionl rrows nxt to {PD2, PD1, PD0} init tht ths lins will b us for both input n output urin run-tim. Ω b tns of sons iit f b b sons iit f b f f CC CC n.. Ω
3 On in, for your rfrn, hr r pinout irms of th mtrix kyp n svn smnt LED isply in your lb prts kit: )(*$+%&,(*$+% -(*$+%,(*$+%',(!.( " -( " /'0 1 0 #! " " # $%& $% $% $%' f CC b Smnt: Output Lin: PA7 b PD5 PD4 PD3 PD2 f PD1 PD0 CC (lft iit) PA6 CC (riht iit) PA5 f b CC p
4 Softwr Dsin OC1F = 1? no OC2F = 1? no OC3F = 1? no ys xut Tsk1 ys xut Tsk2 ys xut Tsk3 offst1 to TOC1, rst OC1F offst1 to TOC2, rst OC2F offst3 to TOC3, rst OC3F In this xprimnt you will b usin TCNT n thr Output Compr ristrs to xut thr tsks t iffrnt frqunis. Hr is hih-lvl sription of th thr tsks: Tsk1 kps ount of tim usin thr iml iits (s in 54.7 s). This ount is rmnt vry 0.1 s whn th timr is runnin. Tsk1 xuts vry 1/10 s. Tsk2 multiplxs n upts th 7-smnt isplys; it xuts vry 1/200 s. Tsk3 polls th kyp to tt ky prsss n rspons orinly; it xuts vry 1/20 s.
5 Tsk1 Dtils Th mmory byt Mo is us to init whthr or not th ountr is runnin or is pus: Mo = 1 inits tht th timr is ountin own, n Mo = 0 inits tht it is frozn t th urrnt ount. Tsk1 psuoo: (xut vry 0.1 s) Diit3 Diit2 Diit1 (Th hrwr isplys only Diit3 n Diit2) if (Mo = 1 n Ky_Prss = 0) Diit1 Diit1 1 if (Diit1 = 1) Diit1 9 Diit2 Diit2 1 if (Diit2 = 1) Diit2 9 Diit3 Diit3 1 if (Diit3 = 1) Diit1 0 Diit2 0 Diit3 0 Mo 0 ; rmnt 0.1 s iit ; rmnt 1.0 s iit ; rmnt 10 s iit ; n of ountown is rh ; stop ountr (initilly Diit1 = 0, Diit2 = 0, Diit3 = 0, Mo = 0) S Tsk3 sription for xplntion of Ky_Prss.
6 Tsk2 Dtils Tsk2 prforms tim-ivision multiplxin by ltrntin th iit bin isply vry 1/200 s. This rsults in n ovrll 100 Hz rfrsh rt for both iits. Mmory byt Diit_Slt is n initor of wht iit (lft or riht) is urrntly bin isply. Tsk2 psuoo: (xut vry s) if (Diit_Slt = 0) Diit_Slt 1 PA6 1 PA5 0 Diit Diit3 ls Diit_Slt 0 PA6 0 PA5 1 Diit Diit2 ; tivt lft 7-s. isply ; isply tns of s vlu ; tivt riht 7-s. isply ; isply s vlu Thn, output 7-smnt t orrsponin to mmory vlu Diit just s it ws on in Exprimnts 4 n 5. (initilly Diit_Slt = 0, Diit = 0, PA6 = 0, PA5 = 1)
7 Tsk3 Dtils Tsk3 xuts vry 1/20 s; it hks if ny ky is prss n rspons orinly. Mmory byt Ky_Prss kps trk of th kyp sttus: Ky_Prss = 1 whn kyprss is tt, Ky_Prss = 0 whn no kys r prss. To frz th ount, on must prss ny ky in th first thr olumns of th kyp (A, B, C, D kys r intiv). To strt th ountown squn on must prss n rls ithr E or F whn th ount is frozn. To ntr nw strtin tim vlu on must prss numri kys whn th ount is frozn. Tsk3 psuoo: (xut vry 0.05 s) if (ny ky is prss) if (Ky_Prss = 0) Ky_Prss 1 if (Mo = 1) Mo 0 ls if (E or F is prss) Mo 1 ls Ky_Prss 0 ls ; if now ountin thn ; stop ountin ; strt/rsum ountin Diit3 Diit2, Diit1 0 ; initiliz ount by shiftin in iits from th riht if (0 is prss) Diit2 0 lsif (1 is prss) Diit2 1 lsif (2 is prss) Diit2 2 lsif (9 is prss) Diit2 9 (initilly Ky_Prss = 0)
8 Bus w r shrin I/O lins btwn kyp n isply vis, som of th biirtionl lins of PortD will prioilly b onfiur for input (to r mtrix kyp t) n thn onfiur for output (to output t to th isplys). Th subroutin oin this on-th-fly ronfiurin is Tsk3. To sv you som prormmin tim hr is th o listin for subroutin Tsk3 (bs on th psuoo shown prviously): ; ; Tsk 3 (xut vry 1/20 s) - Poll th mtrix kyp: Tsk3: BCLR PortA,X,$60 ; PA6,PA5 <-- 0 (turn off both isplys) BCLR DDRD,X,$07 ; mk PD2...PD0 inputs, to r kyp ols ; riv ll kyp row lins hih: BSET PortA,X,$80 ; PA7 <-- 1 BSET PortD,X,$38 ; PD5...PD3 <-- 1 ; r kyp olumn lins to tt if ny ky is prss: BRCLR PortD,X,$07,C0 ; (hkin if PD2...PD0 r ll zro) JMP C1 C0: CLR Ky_Prss ; no ky is now prss C1: LDAA #0 ; on of th kys is now prss CMPA Ky_Prss BEQ C2 ; ky ws prss lst tim, so o ; nothin n wit for its rls C2: LDAA #1 ; nw kyprss is tt STAA Ky_Prss LDAA #0 CMPA Mo BEQ C3 CLR Mo ; stop th ountown if runnin C3: ; nw kyprss is tt in pus mo ; hk for ky prss in Row4 of th mtrix kyp: BCLR PortA,X,$80 ; PA7 <-- 0 (Row1) BCLR PortD,X,$20 ; PD5 <-- 0 (Row2) BCLR PortD,X,$10 ; PD4 <-- 0 (Row3) BSET PortD,X,$08 ; PD3 <-- 1 (Row4) BRSET PortD,X,$01,C4 ; jump to C4 if E is prss BRSET PortD,X,$02,C4 ; jump to C4 if F is prss JMP C5 C4: ; E or F ky is prss, hn mo to rsum ountown: LDAA #1 STAA Mo
9 C5: ; on of th numri kys is prss in pus mo; lr th ; tnths-of-s iit n shift in th numri ky vlu from ; th riht: (tns s iit) <-- (s iit) <-- (ky vlu) CLR LDAA STAA Diit1 Diit2 Diit3 ; tt ky0 prss (hk in Row4 still in fft from bov) BRCLR PortD,X,$04,C6 LDAA #0 C6: ; hk for ky prss in Row1 of th mtrix kyp: BSET PortA,X,$80 ; PA7 <-- 1 (Row1) BCLR PortD,X,$20 ; PD5 <-- 0 (Row2) BCLR PortD,X,$10 ; PD4 <-- 0 (Row3) BCLR PortD,X,$08 ; PD3 <-- 0 (Row4) ; tt ky1 prss: BRCLR PortD,X,$04,C7 LDAA #1 C7: ; tt ky2 prss: BRCLR PortD,X,$02,C8 LDAA #2 C8: ; tt ky3 prss: BRCLR PortD,X,$01,C9 LDAA #3 C9: ; hk for ky prss in Row2 of th mtrix kyp: BCLR PortA,X,$80 ; PA7 <-- 0 (Row1) BSET PortD,X,$20 ; PD5 <-- 1 (Row2) BCLR PortD,X,$10 ; PD4 <-- 0 (Row3) BCLR PortD,X,$08 ; PD3 <-- 0 (Row4) ; tt ky4 prss: BRCLR PortD,X,$04,C10 LDAA #4 C10: ; tt ky5 prss: BRCLR PortD,X,$02,C11 LDAA #5 C11: ; tt ky6 prss: BRCLR PortD,X,$01,C12 LDAA #6
10 C12: ; hk for ky prss in Row3 of th mtrix kyp: BCLR PortA,X,$80 ; PA7 <-- 0 (Row1) BCLR PortD,X,$20 ; PD5 <-- 0 (Row2) BSET PortD,X,$10 ; PD4 <-- 1 (Row3) BCLR PortD,X,$08 ; PD3 <-- 0 (Row4) ; tt ky7 prss: BRCLR PortD,X,$04,C13 LDAA #7 C13: ; tt ky8 prss: BRCLR PortD,X,$02,C14 LDAA #8 C14: ; tt ky9 prss: BRCLR PortD,X,$01,Quit_Tsk3 LDAA #9 Quit_Tsk3: BSET DDRD,X,$07 ; rturn PD2...PD0 to output mo ;Not: w h turn off both isplys by lrin PA5 n PA6, ; but Tsk2 will rfrsh thm in t most 1/200 s so w n ; not o tht hr. ;inrmnt TOC3 by 1/20 s from its lst vlu: LDD TOC3,X ; D <-- TOC3 ADDD #Inr3 ; D <-- D + Inr3 STD TOC3,X ; TOC3 <-- D LDAA #$20 STAA TFLG1,X ; Clr th TCNT Output Compr 3 fl RTS ; You my opy n pst from n on-lin listin of this subroutin tht is foun t: Your job is to writ th rst of th o n to implmnt this kithn timr, buil th iruit, n monstrt its oprtion to your T.A. Thr will b som flikr in th isply. Cn you xplin why? How woul you sust to limint it? Why wr two output lins it to th ommon tho trminls of th svn smnt isplys, s ompr to only on lin in Exprimnt 5?
ECE Experiment #4 Seven Segment Display Interfacing and Timing
ECE 367 - Exprimnt #4 Svn Smnt Disply Intrfin n Timin Sprin 2006 Smstr Introution This xprimnt rquirs tht you onstrut iruit intrfin th MiroStmp11 moul with svn smnt isply, n writ ssmly lnu o to ontinuously
More information1 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 informationECE 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 informationEE1000 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 informationPresent 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 informationWalk 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 informationDesigning 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 informationSeven-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 informationCSE 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 informationQUESTIONS 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 informationQUESTIONS 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 informationAn 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 informationModule 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 informationCS 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 information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationPhysics 3150, Laboratory 9 Clocked Digital Logic and D/A Conversion
Nots: Physis 0, Lortory Clok Diitl Loi n D/A Convrsion Mrh n 0, 0 By E Eylr n Gor Gison, s in prt on Hys n Horowitz Lst rvis Mrh, 0, y E Eylr () Thr will only on mor orniz l sssion, on April n. Th rst
More informationCSC 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 informationAquauno 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 informationCSE 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 informationCycles 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 informationICM7226A, ICM7226B. 8-Digit, Multi-Function, Frequency Counter/Timer. Features. Description. Applications. Ordering Information.
Auust 99 Smionutor ICMA, ICMB -Diit, Multi-Funtion, Frquny Countr/Timr Fturs CMOS Dsin or Vry Low Powr Output Drivrs Dirtly Driv Both Diits n Smnts o Lr -Diit LED Displys Msurs Frqunis rom DC to 0MHz;
More informationICM7226A ICM7226B 8-Digit Multi-Function Frequency Counter/Timers
Dmr 99 SEMICONDUCTOR ICMA ICMB -Diit Multi-Funtion Frquny Countr/Timrs Fturs CMOS Dsin or Vry Low Powr Output Drivrs Dirtly Driv Both Diits n Smnts o Lr Diit LED Displys Msurs Frqunis rom DC to 0MHz; Prios
More informationModule 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 informationDecimals 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 informationCOMP108 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# 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 informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
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
More informationAlgorithmic 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 informationUsing 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 informationa 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 informationOutline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
More informationICM7216A, ICM7216B ICM7216D 8-Digit Multi-Function Frequency Counter/Timer
Dmr 99 SEMICONDUCTOR ICMA, ICMB ICMD -Diit Multi-Funtion Frquny Countr/Timr Fturs All Vrsions Funtions s Frquny Countr (DC to 0MHz) Four Intrnl Gt Tims: 0.0s, 0.s, s, 0s in Frquny Countr Mo Dirtly Drivs
More informationATMOSPHERIC DISTURBANCE MONITOR MAIN CIRCUIT BOARD V5
P VOL TMOSPHRI ISTURN MONITOR MIN IRUIT OR V5 R 70K IN 0mH 0pF OLLTOR OUT TST.00mF IN 70K mh Q R 0pF OLOR O: R 0mF N9 TRIM N9 K9. SI LIHTNIN TTOR (-) to (+) Pulse Out 5 00mF (+) to (-) Pulse Out 0R *R
More information(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 informationWeighted 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 informationPaths. 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 informationFSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
More informationCase 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, 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 informationb. 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 informationA Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation
A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok
More informationA Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications
Proings of th 6th WSEAS Intrntionl Confrn on Miroltronis, Nnoltronis, Optoltronis, Istnul, Turky, My 27-29, 27 32 A Low Nois n Rlil CMOS I/O Buffr for Mix Low Voltg Applitions HWANG-CHERNG CHOW n YOU-GANG
More informationOpenMx Matrices and Operators
OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationNO RECOMMENDED REPLACEMENT
-Diit, Multi-Funtion, Frquny Countrs/Timrs OBSOLETE PRODUCT NO RECOMMENDED REPLACEMENT ontt our Thnil Support Cntr t www.intrsil.om/ts DATASHEET FN Rv..00 Jn 7, 00 Th ICM7B is ully intrt Timr Countrs with
More informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES EZ SERVO EZSV17 WIRING DIAGRAM FOR BLDC MOTOR
0V TO 0V SUPPLY GROUN +0V TO +0V RS85 ONVRTR 9 TO OM PORT ON P TO P OM PORT US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. OPTO SNSOR # GROUN +0V TO +0V GROUN RS85 RS85 OPTO SNSOR # PHOTO TRNSISTOR TO OTHR
More informationd e c b a d c b a d e c b a a c a d c c e b
FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationGraphs. 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 informationExam 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 informationCS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
More informationSAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings
PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry
More informationLast 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 informationCS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
More informationExperiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor
EE2L - Introution to Diitl Ciruits Exprimnt # 3 Exprimnt # 3 Introution to Diitl Loi Simultion n Xilinx Smti Eitor. Synopsis: Tis l introus CAD tool (Computr Ai Dsin tool) ll Xilinx Smti Eitor, wi is us
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
More information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationEE 209 Lab 3 Mind over Matter
EE 09 L 3 Min ovr Mttr 1 Introution In this l you will us th Xilinx CAD tools to omplt th sin o kis m ommonly rrr to s Mstrmin (simplii or sy implmnttion). In prtiulr, you will sin muxs, ristrs with nls,
More informationOutline. 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 informationMath 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 informationDUET 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 informationGraphs. 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 information12/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 information5/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 informationBasis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]
Powr istriution Short-iruit withstn strngth to EC Short-iruit withstn strngth to EC 439-1 Typ tsting to EC 439-1 During th ours of systm typ-tsting, th following tsts wr onut on th Rittl usr systms n on
More informationMinimum 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 information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More information0 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
n r t d n 20 22 0: T P bl D n, l d t z d http:.h th tr t. r pd l 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.
More informationWhy 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 informationTOPIC 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 informationLinear Algebra Existence of the determinant. Expansion according to a row.
Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit
More informationCS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
More informationGraph 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 information10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms
0/0/ CS/ENGRD 0 Ojt- Orint Prormmin n Dt Strutur Fll 0 Dou Jm Ltur 9: DFS, BFS & Shortt Pth Toy Rhility Dpth-Firt Srh Brth-Firt Srh Shortt Pth Unwiht rph Wiht rph Dijktr lorithm Rhility Alorithm Dpth Firt
More information22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r n. H v v d n f
n r t d n 20 2 : 6 T P bl D n, l d t z d http:.h th tr t. r pd l 22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r
More information46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th
n r t d n 20 0 : T P bl D n, l d t z d http:.h th tr t. r pd l 46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l
More informationAim To manage files and directories using Linux commands. 1. file Examines the type of the given file or directory
m E x. N o. 3 F I L E M A N A G E M E N T Aim To manag ils and dirctoris using Linux commands. I. F i l M a n a g m n t 1. il Examins th typ o th givn il or dirctory i l i l n a m > ( o r ) < d i r c t
More informationn r t d n :4 T P bl D n, l d t z d th tr t. r pd l
n r t d n 20 20 :4 T P bl D n, l d t z d http:.h th tr t. r pd l 2 0 x pt n f t v t, f f d, b th n nd th P r n h h, th r h v n t b n p d f r nt r. Th t v v d pr n, h v r, p n th pl v t r, d b p t r b R
More informationSection 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 informationCONTINUITY 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 informationCS200: 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 informationA prefix word in each of these sentences is incorrect. Rewrite the prefix words correctly.
Spring Trm 2 Cirl th possssiv pronoun: Th hilrn wr thrill tht th i tht h n hosn or th inl prout ws thirs. Rwrit this sntn with th vril phrs t th ginning. Don t orgt omm! Thr wsn t on pi o pizz lt tr th
More informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES A
7V TO 0V SUPPLY +7V TO +0V RS85 ONVRTR TO P OM PORT OR US US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. 9 TO OM PORT ON P TO OTHR Z SRVOS OR Z STPPRS OPTO SNSOR # OPTO SNSOR # PHOTO TRNSISTOR OPTO SNSOR
More informationUNCORRECTED 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 informationSolutions 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 informationTHE EFFECT OF SEED AND SOIL APPLIED SYSTEMIC INSECTICIDES ON APHIDS IN SORGHUM. Texas Agricultural Experiment Station, Nueces County, 2000
THE EFFECT OF SEED AND SOIL APPLIED SYSTEMIC INSECTICIDES ON APHIDS IN SORGHUM Txs Agriulturl Exprimnt Sttion, Nus County, 2000 Roy D. Prkr Extnsion Entomologist Corpus Cristi, Txs SUMMARY: Grnug, yllow
More informationIn order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.
Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to
More informationLecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
More informationFormal Concept Analysis
Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst
More informationN=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
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
More information4 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
n r t d n 20 2 :24 T P bl D n, l d t z d http:.h th tr t. r pd l 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
More informationDEVELOPING 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 informationNumbering 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 informationAnalysis for Balloon Modeling Structure based on Graph Theory
Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo
More informationSimilarity 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 informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationH SERIES. Decimals. Decimals. Curriculum Ready ACMNA: 103, 128, 129, 130, 152, 154,
Dimls H SERIES Dimls Curriulum Ry ACMNA: 0, 8, 9, 0,,, www.mthltis.om Copyriht 009 P Lrnin. All rihts rsrv. First ition print 009 in Austrli. A tlou ror or this ook is vill rom P Lrnin Lt. ISBN 978--98--9
More informationMultipoint Alternate Marking method for passive and hybrid performance monitoring
Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro
More information