CS 360 Exam 2 Fall 2014 Name


 Lauren Hunt
 1 years ago
 Views:
Transcription
1 CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singlylinke list n stk. Write three ifferent O(n)time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output the t ontine within the noes of the list in reverse orer, tht is, from k to front. Exmple: if the list ontins elements [4, 9, 1, 6] then the output shoul e lss Noe { int t; Noe next; } lss List { Noe he; voi reverse_print( ); } lss Stk { Stk( ); oolen isempty( ); voi push (int x); int pop( ); }. Use stk s n uxiliry t struture. Do not use ny other t struture, o not use reursion, n o not moify the linke list. [5 points]. Use reursion. Do not use n expliit stk or ny other t struture, n o not moify the linke list. Hint: use helper funtion tht is reursive. [5 points]
2 . Do not use stk or ny other t struture, n o not use reursion. You my use only O(1) extr spe eyon the linke list. Your metho my temporrily moify the linke list, ut when the metho ens, the linke list must e ore extly the sme s it ws efore the metho ws lle. Hint: reverse the list in ple. [10 points] 2. Drw one inry tree tht yiels ll three of the trversls s shown elow. [8 points] Preorer: Postorer: Inorer: L G Z J T X C M P R A N Y E B H V T J M C P X Z G Y B E N V H A R L G T J Z C M X P L Y N B E A H V R
3 3. A stnr Queue implementtion is provie elow. Complete the lss MultipleQueues, whih represents ritrrily mny queues, y using one instne Q of lss Queue s shown. In lss MultipleQueues, istint queues re hieve y speifying istint qnum vlues. The expete ehvior of methos enqueue n equeue is illustrte in n exmple elow. The enqueue metho must tke O(1) time, ut equeue my tke ω(1) time. [15 points] lss Queue { Queue( ); int size ( ); voi enqueue (int z); int equeue( ); } lss MultipleQueues { Queue Q; MultipleQueues( ) { Q = new Queue( ); } voi enqueue (int qnum, int z); // write this metho int equeue (int qnum); // write this metho } MultipleQueues M = new MultipleQueues( ); M.enqueue (7, 30); M.enqueue (2, 40); M.enqueue (7, 50); M.enqueue (2, 60); print (M.equeue (2)); print (M.equeue (2)); // outputs: print (M.equeue (7)); print (M.equeue (7)); // outputs: 30 50
4 4. Answer the following questions out running times of list opertions. [25 points]. Stte the worstse θ running time for n effiient implementtion of eh list opertion shown elow, when using eh speifie t struture. (x is vlue, n p is position.) Fin (x) After (p) Before (p) Insert (x) InsertAfter (p,x) InsertBefore (p,x) InsertFirst (x) InsertLst (x) Remove (x) Remove (p) RemoveFirst ( ) RemoveLst ( ) Unsorte singlylinke list, with link to he ut no link to til noe Unsorte oulylinke list, with links to oth he n til noes Unsorte nonirulr rry, where rry inex k yiels the rnk k element. For whih opertion(s) oes the θ running time hnge if we use singlylinke list with links to oth he n til noes, rther thn singlylinke list with link to only the he noe? Also stte eh suh opertions running time for singlylinke list with links to oth he n til noes.. For whih opertion(s) oes the θ running time hnge if we use irulr rry rther thn nonirulr rry? Also stte eh suh opertions running time for irulr rry.. Whih opertion(s) shoul not e provie if the elements in the t struture must e mintine in sorte orer? e. For whih opertion(s) oes the θ running time hnge if we use sorte rry rther thn n unsorte rry? Also stte eh suh opertions running time for sorte rry.
5 5. Consier hsh tle with N slots, where N 5. [6 points]. Use liner proing n insert 2 rnom keys. Determine the proility tht these 2 keys will oupy 2 jent slots (possily with wrproun).. Use liner proing n insert 3 rnom keys. Determine the proility tht these 3 keys will oupy 3 jent slots (possily with wrproun).. Use seprte hining n insert 3 rnom keys. Determine the proility tht ll 3 keys re ple in the sme hin.. Use seprte hining n insert 3 rnom keys. Determine the proility tht ll 3 keys re ple in ifferent hins. e. Use seprte hining n insert 3 rnom keys. Determine the proility tht extly 2 of these 3 keys re ple in the sme hin.
6 6. Strt with the lk tree shown elow whih hs keys 3, 4, 5. First insert keys 6, 7, 8, 9, 10, 11, 12 (in tht orer) n rw the tree fter eh insert. Next remove keys 3, 4, 5, 6, 7 (in tht orer) n rw the tree fter eh remove. Clerly inite the olor of eh noe (=lk, r=). Mke sure tht eh tree you rw is properly forme lk tree. If you rw ny intermeite steps, irle the trees tht shoul e gre. [12 points] 4 3 r 5 r
7 7. Strt with the AVL tree shown elow whih hs keys 5, 10. First insert keys 6, 7, 8, 9, 0, 4, 3, 2, 1 (in tht orer) n rw the tree fter eh insert. Next remove keys 3, 10, 9 (in tht orer) n rw the tree fter eh remove. It is permitte ut not requi to show the height of eh noe. Mke sure tht eh tree you rw is properly forme AVL tree. If you rw ny intermeite steps, irle the trees tht shoul e gre. [12 points] 5 10
8 8. Strt with the sply tree shown elow whih hs key 5. First insert keys 6, 3, 4, 1, 2, 9, 7, 8 (in tht orer) n rw the tree fter eh insert. Next remove keys 1, 9, 6, 7 (in tht orer) n rw the tree fter eh remove. Mke sure tht eh tree you rw is properly forme sply tree. If you rw ny intermeite steps, irle the trees tht shoul e gre. [12 points] 5
9 Insertion into lk tree Getting strte: Rehing the root: 0. x 3. root root lef lef lef Restruturing (single or oule rottion): Reoloring:
10 Removl from lk tree Getting strte: 0. x lef 0. x lef efiient lef lef lef lef 0. x w 0. x y w lef lef lef lef y lef lef lef lef lef lef Restruturing (single or oule rottion): 1. ny sme ny 1. sme efiient efiient 1. ny sme 1. ny sme e efiient e e efiient e `
11 Removl from lk tree (ontinue) Reoloring: efiient efiient 2. efiient 2. efiient efiient efiient Ajustment (single rottion): efiient efiient efiient efiient [Alwys followe y 1, 1, 1, 1, 2, or 2] Rehing the root: 4. root efiient root
12 AVL tree: insertion n removl 1. Y, h+3 1. U, h+3 Right rotte t Y U, h+2 Z, h T, h Y, h+2 Left rotte t U T, h+1 W W Z, h+1 2. Y, h+3 Left rotte t U, 2. U, h+3 Right rotte t Y, U, h+2 Z, h h Right rotte t Y T, h Y, h+2 th Left rotte t U T, h W, h+1 W, h+1 Z, h Sply tree: insertion n removl 1. Zig root X P Right rotte t P 1. Zg root P X Left rotte t P 2. G P Right rotte t G, 2. Zigzig Zgzg G P Left rotte t G, then Left rotte t P X Right rotte then t P X 3. P G X Left rotte t P, Right th rotte t G 3. Zigzg Zgzig G X P Right rotte t P, th Left rotte t G
Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
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 onetoone n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 2942 9/11/04 Quntum Ciruit Model, SolovyKitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits  Universl Gte Sets A lssil iruit implements multioutput oolen funtion f : {0,1}
More informationNONDETERMINISTIC FSA
Tw o types of nondeterminism: NONDETERMINISTIC FS () Multiple strtsttes; strtsttes S Q. The lnguge L(M) ={x:x tkes M from some strtstte to some finlstte nd ll of x is proessed}. The string x = is
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More informationIdentifying and Classifying 2D Shapes
Ientifying n Clssifying D Shpes Wht is your sign? The shpe n olour of trffi signs let motorists know importnt informtion suh s: when to stop onstrution res. Some si shpes use in trffi signs re illustrte
More informationData Structures (INE2011)
Dt Strutures (INE2011) Eletronis nd Communition Engineering Hnyng University Hewoon Nm Leture 7 INE2011 Dt Strutures 1 Binry Tree Trversl Mny inry tree opertions re done y perorming trversl o the inry
More informationPreLie algebras, rooted trees and related algebraic structures
PreLie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A prelie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers
More informationAutomata and Regular Languages
Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moellnguge reltionship hs multiple levels. We shll explore the simplest level,
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More informationChapter 4 StateSpace Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 StteSpe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationThe DOACROSS statement
The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows proueronsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationCS 310 (sec 20)  Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20)  Winter 2003  Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationLet s divide up the interval [ ab, ] into n subintervals with the same length, so we have
III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris
More informationfor all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx
Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion
More informationGraph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or MultiGrph We llow loops n multiple eges. G = (V, E.ψ)
More informationConnectivity in Graphs. CS311H: Discrete Mathematics. Graph Theory II. Example. Paths. Connectedness. Example
Connetiit in Grphs CSH: Disrete Mthemtis Grph Theor II Instrtor: Işıl Dillig Tpil qestion: Is it possile to get from some noe to nother noe? Emple: Trin netork if there is pth from to, possile to tke trin
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More informationAPPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line
APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationFormula for Trapezoid estimate using Left and Right estimates: Trap( n) If the graph of f is decreasing on [a, b], then f ( x ) dx
Fill in the Blnks for the Big Topis in Chpter 5: The Definite Integrl Estimting n integrl using Riemnn sum:. The Left rule uses the left endpoint of eh suintervl.. The Right rule uses the right endpoint
More informationNFA DFA Example 3 CMSC 330: Organization of Programming Languages. Equivalence of DFAs and NFAs. Equivalence of DFAs and NFAs (cont.
NFA DFA Exmple 3 CMSC 330: Orgniztion of Progrmming Lnguges NFA {B,D,E {A,E {C,D {E Finite Automt, con't. R = { {A,E, {B,D,E, {C,D, {E 2 Equivlence of DFAs nd NFAs Any string from {A to either {D or {CD
More informationGlobal alignment. Genome Rearrangements Finding preserved genes. Lecture 18
Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re
More information( x) ( ) takes at the right end of each interval to approximate its value on that
III. INTEGRATION Economists seem much more intereste in mrginl effects n ifferentition thn in integrtion. Integrtion is importnt for fining the expecte vlue n vrince of rnom vriles, which is use in econometrics
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 004 Exerise  0509 Exerise  093 Exerise  3 45 Exerise  4 6 Answer Key 78 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationNon Right Angled Triangles
Non Right ngled Tringles Non Right ngled Tringles urriulum Redy www.mthletis.om Non Right ngled Tringles NON RIGHT NGLED TRINGLES sin i, os i nd tn i re lso useful in nonright ngled tringles. This unit
More informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationOnLine Construction. of Suffix Trees. Overview. Suffix Trees. Notations. goo. Suffix tries
OnLine Cnstrutin Overview Suffix tries f Suffix Trees E. Ukknen Online nstrutin f suffix tries in qudrti time Suffix trees Online nstrutin f suffix trees in liner time Applitins 1 2 Suffix Trees A suffix
More informationName Ima Sample ASU ID
Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:359:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to
More informationLecture 11 Binary Decision Diagrams (BDDs)
C 474A/57A ComputerAie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, Kmp, iruit, et
More informationAPPROXIMATION AND ESTIMATION MATHEMATICAL LANGUAGE THE FUNDAMENTAL THEOREM OF ARITHMETIC LAWS OF ALGEBRA ORDER OF OPERATIONS
TOPIC 2: MATHEMATICAL LANGUAGE NUMBER AND ALGEBRA You shoul unerstn these mthemtil terms, n e le to use them ppropritely: ² ition, sutrtion, multiplition, ivision ² sum, ifferene, prout, quotient ² inex
More informationChapter Five  Eigenvalues, Eigenfunctions, and All That
Chpter Five  Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl
More informationOutline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression
52 Dt Strutures n Algorithms Dt Compression n Huffmn s Algorithm th Fe 2003 Rjshekr Rey Outline Dt ompression Lossy n lossless Exmples Forml view Coes Definition Fixe length vs. vrile length Huffmn s
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higherdimensionl nlogues) with the definite integrls
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationChapter 4 Regular Grammar and Regular Sets. (Solutions / Hints)
C K Ngpl Forml Lnguges nd utomt Theory Chpter 4 Regulr Grmmr nd Regulr ets (olutions / Hints) ol. (),,,,,,,,,,,,,,,,,,,,,,,,,, (),, (c) c c, c c, c, c, c c, c, c, c, c, c, c, c c,c, c, c, c, c, c, c, c,
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationMCH T 111 Handout Triangle Review Page 1 of 3
Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:
More informationExam 2 Solutions ECE 221 Electric Circuits
Nme: PSU Student ID Numer: Exm 2 Solutions ECE 221 Electric Circuits Novemer 12, 2008 Dr. Jmes McNmes Keep your exm flt during the entire exm If you hve to leve the exm temporrily, close the exm nd leve
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationCS241 Week 6 Tutorial Solutions
241 Week 6 Tutoril olutions Lnguges: nning & ontextfree Grmmrs Winter 2018 1 nning Exerises 1. 0x0x0xd HEXINT 0x0 I x0xd 2. 0xend HEXINT 0xe I nd ER  MINU  3. 1234120x INT 1234 INT 120 I x 4.
More informationParticle Lifetime. Subatomic Physics: Particle Physics Lecture 3. Measuring Decays, Scatterings and Collisions. N(t) = N 0 exp( t/τ) = N 0 exp( Γt/)
Sutomic Physics: Prticle Physics Lecture 3 Mesuring Decys, Sctterings n Collisions Prticle lifetime n with Prticle ecy moes Prticle ecy kinemtics Scttering cross sections Collision centre of mss energy
More informationILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS
ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu
More informationSolutions to Assignment 1
MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove
More informationexpression simply by forming an OR of the ANDs of all input variables for which the output is
2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output
More informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More informationAlgebra 2 Semester 1 Practice Final
Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers
More informationData Structures LECTURE 10. Huffman coding. Example. Coding: problem definition
Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt
More information2.1 ANGLES AND THEIR MEASURE. y I
.1 ANGLES AND THEIR MEASURE Given two interseting lines or line segments, the mount of rottion out the point of intersetion (the vertex) required to ring one into orrespondene with the other is lled the
More informationNondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA
Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn
More informationLesson 55  Inverse of Matrices & Determinants
// () Review Lesson  nverse of Mtries & Determinnts Mth Honors  Sntowski  t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b)  () B () B (e) B n
More informationCS 311 Homework 3 due 16:30, Thursday, 14 th October 2010
CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w
More informationCalculus Cheat Sheet. Integrals Definitions. where F( x ) is an antiderivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx
Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous AntiDerivtive : An ntiderivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.
More informationCS 330 Formal Methods and Models
CS 0 Forml Methods nd Models Dn Richrds, George Mson University, Fll 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Septemer 8 1. Prove q (q p) p q p () (4pts) with truth tle. p q p q p (q p) p q
More informationIntroduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 278 Dr. Hden KwokH So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
More information10. AREAS BETWEEN CURVES
. AREAS BETWEEN CURVES.. Ares etween curves So res ove the xxis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in
More information= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationMA 513: Data Structures Lecture Note Partha Sarathi Mandal
MA 513: Dt Structures Lecture Note http://www.iitg.ernet.in/psm/indexing_m513/y09/index.html Prth Srthi Mndl psm@iitg.ernet.in Dept. of Mthemtics, IIT Guwhti Tue 9:009:55 Wed 10:0010:55 Thu 11:0011:55
More information2. Properties of Functions
2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is onetoone (short han is 1 1) or injetive if preimages are unique.
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationMore Properties of the Riemann Integral
More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl
More informationMining Frequent Web Access Patterns with Partial Enumeration
Mining Frequent We Aess Ptterns with Prtil Enumertion Peiyi Tng Deprtment of Computer Siene University of Arknss t Little Rok 2801 S. University Ave. Little Rok, AR 72204 Mrkus P. Turki Deprtment of Computer
More informationH (2a, a) (u 2a) 2 (E) Show that u v 4a. Explain why this implies that u v 4a, with equality if and only u a if u v 2a.
Chpter Review 89 IGURE ol hord GH of the prol 4. G u v H (, ) (A) Use the distne formul to show tht u. (B) Show tht G nd H lie on the line m, where m ( )/( ). (C) Solve m for nd sustitute in 4, otining
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd AmGm inequlity 2. Elementry inequlities......................
More informationComputing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt
Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:
More informationMATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.
MATH 409 Advned Clulus I Leture 22: Improper Riemnn integrls. Improper Riemnn integrl If funtion f : [,b] R is integrble on [,b], then the funtion F(x) = x f(t)dt is well defined nd ontinuous on [,b].
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More informationMatrix & Vector Basic Linear Algebra & Calculus
Mtrix & Vector Bsic Liner lgebr & lculus Wht is mtrix? rectngulr rry of numbers (we will concentrte on rel numbers). nxm mtrix hs n rows n m columns M x4 M M M M M M M M M M M M 4 4 4 First row Secon row
More informationCOMP 250. Lecture 20. tree traversal. Oct. 25/26, 2017
COMP 250 Lecture 20 tree trversl Oct. 25/26, 2017 1 2 Tree Trversl How to visit (enumerte, iterte through, trverse ) ll the nodes of tree? 3 depthfirst (root){ // preorder if (root is not empty){ visit
More informationy = c 2 MULTIPLE CHOICE QUESTIONS (MCQ's) (Each question carries one mark) is...
. Liner Equtions in Two Vriles C h p t e r t G l n e. Generl form of liner eqution in two vriles is x + y + 0, where 0. When we onsier system of two liner equtions in two vriles, then suh equtions re lle
More informationLecture 1  Introduction and Basic Facts about PDEs
* 18.15  Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1  Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV
More informationDEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS
3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive
More informationSPECIALIST MATHEMATICS
Victorin Certificte of Euction 07 SUPERVISOR TO ATTACH PROCESSING LABEL HERE Letter STUDENT NUMBER SPECIALIST MATHEMATICS Written emintion Thursy 8 June 07 Reing time:.00 pm to.5 pm (5 minutes) Writing
More information(Lec 4) Binary Decision Diagrams: Manipulation
(Le 4) Binry Deision Digrms: Mnipultion Wht you know Bsi BDD t struture DAG representtion How vrile orering + reution = nonil A few immeite pplitions eg, trivil tutology heking Wht you on t know Algorithms
More informationMcCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König
1. Introution MCreight s Suffix Tree Constrution Algorithm Milko Izamski B.S. Informatis Instrutor: Barbara König The main goal of MCreight s algorithm is to buil a suffix tree in linear time. This is
More informationPhysics 9 Fall 2011 Homework 2  Solutions Friday September 2, 2011
Physics 9 Fll 0 Homework  s Fridy September, 0 Mke sure your nme is on your homework, nd plese box your finl nswer. Becuse we will be giving prtil credit, be sure to ttempt ll the problems, even if you
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, section 003, George Mson University, Fll 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Septemer 7 1. Prove (p q) (p q), () (5pts) using truth tles. p q
More informationCS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation
CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes
More informationSection IV.6: The Master Method and Applications
Sectio IV.6: The Mster Method d Applictios Defiitio IV.6.1: A fuctio f is symptoticlly positive if d oly if there exists rel umer such tht f(x) > for ll x >. A cosequece of this defiitio is tht fuctio
More informationFormal languages, automata, and theory of computation
Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:1018:30 Techer: Dniel Hedin, phone 021107052 The exm
More informationLecture 9: LTL and Büchi Automata
Lecture 9: LTL nd Büchi Automt 1 LTL Property Ptterns Quite often the requirements of system follow some simple ptterns. Sometimes we wnt to specify tht property should only hold in certin context, clled
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationRegular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15
Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll
More informationProportions: A ratio is the quotient of two numbers. For example, 2 3
Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)
More information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
More informationFormal Methods in Software Engineering
Forml Methods in Softwre Engineering Lecture 09 orgniztionl issues Prof. Dr. Joel Greenyer Decemer 9, 2014 Written Exm The written exm will tke plce on Mrch 4 th, 2015 The exm will tke 60 minutes nd strt
More informationLine Integrals and Entire Functions
Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series
More informationYear 11 Matrices. A row of seats goes across an auditorium So Rows are horizontal. The columns of the Parthenon stand upright and Columns are vertical
Yer 11 Mtrices Terminology: A single MATRIX (singulr) or Mny MATRICES (plurl) Chpter 3A Intro to Mtrices A mtrix is escribe s n orgnise rry of t. We escribe the ORDER of Mtrix (it's size) by noting how
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More information5. Every rational number have either terminating or repeating (recurring) decimal representation.
CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More informationObstructions to chordal circulararc graphs of small independence number
Ostrutions to horl irulrr grphs of smll inepenene numer Mthew Frnis,1 Pvol Hell,2 Jurj Stho,3 Institute of Mth. Sienes, IV Cross Ro, Trmni, Chenni 600 113, Ini Shool of Comp. Siene, Simon Frser University,
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More information