Solutions for Selected Exercises from Introduction to Compiler Design
|
|
- Theodora Cook
- 7 years ago
- Views:
Transcription
1 Solutions for Selected Exercises from Introduction to Compiler Design Torben Æ. Mogensen Lst updte: My 30, Introduction This document provides solutions for selected exercises from Introduction to Compiler Design. Note tht in some cses there cn be severl eqully vlid solutions, of which only one is provided here. If your own solutions differ from those given here, you should use your own judgement to check if your solution is correct. 2 Exercises for chpter 1 Exercise 1.1 ) 0 42 b) The number must either be one-digit number, two-digit number different from 42 or hve t lest three significnt digits: 0 ([0 9] [1 3][0 9] 4[0 1] 4[3 9] [5 9][0 9] [1 9][0 9][0 9] + ) c) The number must either be two-digit number greter thn 42 or hve t lest three significnt digits: 0 (4[3 9] [5 9][0 9] [1 9][0 9][0 9] + ) 1
2 Exercise 1.2 ) 2 ε ε 5 ε ε b 4 b) A = ε-closure({1}) = {1, 2, 3, 4, 5} B = move(a, ) = ε-closure({1, 6}) = {1, 6, 2, 3, 4, 5} C = move(a, b) = ε-closure({6}) = {6} D = move(b, ) = ε-closure({1, 6, 7}) = {1, 6, 7, 2, 3, 4, 5} move(b, b) = ε-closure({6}) = C E = move(c, ) = ε-closure({7}) = {7} move(c, b) = ε-closure({}) = {} F = move(d,) = ε-closure({1,6,7,8}) = {1,6,7,8,2,3,4,5} move(d, b) = ε-closure({6}) = C G = move(e, ) = ε-closure({8}) = {8} move(e, b) = ε-closure({}) = {} move(f, ) = ε-closure({1, 6, 7, 8}) = F move(f, b) = ε-closure({6}) = C move(g, ) = ε-closure({}) = {} move(g, b) = ε-closure({}) = {} Sttes F nd G re ccepting since they contin the ccepting NFA stte 8. In digrm form, we get: 2
3 A B D F b b b b C E G Exercise 1.5 We strt by noting tht there re no ded sttes, then we divide into groups of ccepting nd non-ccepting sttes: We now check if group A is consistent: 0 = {0} A = {1,2,3,4} A b 1 A 2 A 3 A 0 4 A 0 We see tht we must split A into two groups: B = {1, 2} C = {3, 4} And we now check these, strting with B: B b 1 B 2 C So we need to split B into it individul sttes. The only non-singleton group left is C, which we now check: C b 3 C 0 4 C 0 This is consistent, so we cn see tht we could only combine sttes 3 nd 4 into group C. The resulting digrm is: 3
4 0 b b 1 C 2 Exercise 1.7 ) b 0 b 1 b 2 3 b) b 0 b 1 2 b c) 1 b b b 0 2 4
5 Exercise 1.8 ( ( ( ) ) ) Exercise 1.9 ) The number must be 0 or end in two zeroes: b) We use tht reding 0 is the sme s multiplying by 2 nd reding 1 is the sme s multiplying by two nd dding 1. So of we hve reminder m, reding 0 gives us reminder (2m)mod 5 nd reding 1 gives us reminder (2m + 1)mod 5. We cn mke the following trnsition tble: m The stte corresponding to m = 0 is ccepting. We must lso strt with reminder 0, but since the empty string isn t vlid number, we cn t use the ccepting stte s strt stte. So we dd n extr strt stte 0 tht hs the sme trnsitions s 0, but isn t ccepting:
6 c) If n = 2 b, the binry number for n is the number for followed by b zeroes. We cn mke DFA for n odd number in the sme wy we did for 5 bove by using the rules tht reding 0 in stte m gives us trnsition to stte (2m)mod nd reding 1 in stte m gives us trnsition to stte (2m + 1)mod. If we (for now) ignore the extr strt stte, this DFA hs sttes. This is miniml becuse nd 2 (the bse number of binry numbers) re reltive prime ( complete proof requires some number theory). If b = 0, the DFA for n is the sme s the DFA constructed bove for, but with one extr strt stte s we did for the DFA for 5, so the totl number of sttes is + 1. If b > 0, we tke the DFA for nd mke b extr sttes: 0 1, 0 2,..., 0 b. All of these hve trnsitions to stte 1 on 1. Stte 0 is chnged so it goes to stte 0 1 on 0 (insted of to itself). For i = 1,..., b 1, stte 0 i hs trnsition on 1 to 0 (i+1) while 0 b hs trnsition to itself on 0. 0 b is the only ccepting stte. The strt stte is stte 0 from the DFA for. This DFA will first recognize number tht is n odd multiple of (which ends in 1) nd then check tht there re t lest b zeroes fter this. The totl number of sttes is + b. So, if n is odd, the number of sttes for DFA tht recognises numbers divisible by n is n, but if n = 2 b, where is odd nd b > 0, then the number of sttes is + b. Exercise 1.10 ) φ s = s becuse L(φ) L(s) = /0 L(s) = L(s) φs = φ becuse there re no strings in φ to put in front of strings in s sφ = φ becuse there re no strings in φ to put fter strings in s φ = ε becuse φ = ε φφ = ε φ = ε b) ε c) As there cn now be ded sttes, the minimiztion lgorithm will hve to tke these into considertion s described in section Exercise 1.11 In the following, we will ssume tht for the regulr lnguge L, we hve n NFA N with no ded sttes. 6
7 Closure under prefix. When N reds string w L, it will t ech prefix of w be t some stte s in N. By mking s ccepting, we cn mke N ccept this prefix. By mking ll sttes ccepting, we cn ccept ll prefixes of strings in L. So n utomton N p tht ccepts the prefixes of strings in L is mde of the sme sttes nd trnsitions s N, with the modifiction tht ll sttes in N p ccepting. Closure under suffix. When N reds string w L, where w = uv, it will fter reding u be in some stte s. If we mde s the strt stte of N, N would hence ccept the suffix v of w. If we mde ll sttes of N into strt sttes, we would hence be ble to ccept ll suffixes of strings in L. Since we re only llowed one strt stte, we insted dd new strt stte nd ε-trnsitions from this to ll the old sttes (including the originl strt stte, which is no longer the strt stte). So n utomton N s tht ccepts ll suffixes of strings in L is mde of the sme sttes nd trnsitions s N plus new strt stte s 0 tht hs ε-trnsitions to ll sttes in N. Closure under subsequences. A subsequence of string w cn be obtined by deleting (or jumping over) ny number of the letters in w. We cn modify N to jump over letters by for ech trnsition s c t on letter c dd n ε-trnsition s ε t between the sme pir of sttes. So n utomton N b tht ccepts ll subsequences of strings in L is mde of the sme sttes nd trnsitions s N, with the modifiction tht we dd n ε-trnsitions s ε t whenever N hs trnsition s c t. Closure under reversl. We ssume N hs only one ccepting stte. We cn sfely mke this ssumption, since we cn mke it so by dding n extr ccepting stte f nd mke ε-trnsitions from ll the originl ccepting sttes to f nd then mke f the only ccepting stte. We cn now mke N ccept the reverses of the strings from L by reversing ll trnsitions nd swp strt stte nd ccepting stte. So n utomton N r tht ccepts ll reverses of strings in L is mde the following wy: 1. Copy ll sttes (but no trnsitions) from N to N r. 2. The copy of the strt stte s 0 from N is the only ccepting stte in N r. 3. Add new strt stte s 0 to N r nd mke ε-trnsitions from s 0 to ll sttes in N r tht re copies of ccepting sttes from N. 4. When N hs trnsition s c t, dd trnsition t c s to N r, where s nd t re the copies in N r of the sttes s nd t from N. 7
8 3 Exercises for chpter 2 Exercise 2.3 If we t first ignore mbiguity, the obvious grmmr is P P (P) P PP i.e., the empty string, prentesis round blnced sequence nd conctention of two blnced sequences. But s the lst production is both left recursive nd right recursive, the grmmr is mbiguous. An unmbiguous grmmr is: P P (P)P which combines the two lst productions from the first grmmr into one. Exercise 2.4 ) b) S S SbS S bss Explntion: The empty string hs the sme number of s nd bs. If string strts with n, we find b to mtch it nd vice vers. A AA A SS S S SbS S bss Explntion: Ech excess hs (possibly) empty sequences of equl numbers of s nd bs. 8
9 c) d) D A D B A AA A SS B BB B SbS S S SbS S bss Explntion: If there re more s thn bs, we use A from bove nd otherwise we use similrly constructed B. S S SSbS S SbSS S bsss Explntion: If the string strts with n, we find lter mcthing s nd bs, if it strts with b, we find two mtching s. Exercise 2.5 ) B ε B O 1 C 1 B O 2 C 2 O 1 (B O 1 [B)B O 2 [B O 2 O 1 O 1 C 1 )B C 1 (B]B C 2 ]B C 2 C 1 C 1 9
10 B is blnced, O 1 /C 1 re open one nd close one, nd O 2 /C 2 re open two nd close two. b) B O 1 C 1 [ B ) B ( B ] B ε ε ε ε B C 2 O 2 C 1 C 1 [ B ( B ] B ) B ε ε ε ε Exercise 2.6 The string id id hs these two syntx trees: A A A id id A A A id id We cn mke these unmbiguous grmmrs: ) : A A id A B B B B id b) : A A A B B B id B id The trees for the string id id with these two grmmrs re: 10
11 A ) A B B id id b) A A B B id id Exercise 2.9 We first find the equtions for Nullble: This trivilly solves to Nullble(A) = Nullble(BA) Nullble(ε) Nullble(B) = Nullble(bBc) Nullble(AA) Nullble(A) = true Nullble(B) = true Next, we set up the equtions for FIRST: FIRST(A) = FIRST(BA) FIRST(ε) FIRST(B) = FIRST(bBc) FIRST(AA) Given tht both A nd B re Nullble, we cn reduce this to which solve to FIRST(A) = FIRST(B) FIRST(A) {} FIRST(B) = {b} FIRST(A) FIRST(A) = {, b} FIRST(B) = {, b} Finlly, we dd the production A $ nd set up the constrints for FOLLOW: 11
12 {$} FOLLOW(A) FIRST(A) FOLLOW(B) {} FOLLOW(A) {c} FOLLOW(B) FIRST(A) FOLLOW(A) FOLLOW(B) FOLLOW(A) which we solve to FOLLOW(A) = {, b, c, $} FOLLOW(B) = {, b, c} Exercise 2.10 Exercise 2.11 Exp numexp 1 Exp ( Exp ) Exp 1 Exp 1 + Exp Exp 1 Exp 1 Exp Exp 1 Exp 1 Exp Exp 1 Exp 1 / Exp Exp 1 Exp 1 Nullble for ech right-hnd side is trivilly found to be: The FIRST sets re lso esily found: Nullble(Exp2 Exp ) = f lse Nullble(+ Exp2 Exp ) = f lse Nullble( Exp2 Exp ) = f lse Nullble() = true Nullble(Exp3 Exp2 ) = f lse Nullble( Exp3 Exp2 ) = f lse Nullble(/ Exp3 Exp2 ) = f lse Nullble() = true Nullble(num) = f lse Nullble(( Exp )) = f lse 12
13 Exercise 2.12 FIRST (Exp2 Exp ) = {num, (} FIRST (+ Exp2 Exp ) = {+} FIRST ( Exp2 Exp ) = { } FIRST () = {} FIRST (Exp3 Exp2 ) = {num, (} FIRST ( Exp3 Exp2 ) = { } FIRST (/ Exp3 Exp2 ) = {/} FIRST () = {} FIRST (num) = {num} FIRST (( Exp )) = {(} We get the following constrints for ech production (bbreviting FIRST nd FOLLOW to FI nd FO nd ignoring trivil constrints like FO(Exp ) FO(Exp 1 )): Exp Exp$ : $ FO(Exp) Exp numexp 1 : FO(Exp) FO(Exp 1 ) Exp ( Exp ) Exp 1 : ) FO(Exp), FO(Exp) FO(Exp 1 ) Exp 1 + Exp Exp 1 : FI(Exp 1 ) FO(Exp), FO(Exp 1 ) FO(Exp) Exp 1 Exp Exp 1 : FI(Exp 1 ) FO(Exp), FO(Exp 1 ) FO(Exp) Exp 1 Exp Exp 1 : FI(Exp 1 ) FO(Exp), FO(Exp 1 ) FO(Exp) Exp 1 / Exp Exp 1 : FI(Exp 1 ) FO(Exp), FO(Exp 1 ) FO(Exp) Exp 1 : As FI(Exp 1 ) = {+,,, /}, we get Exercise 2.13 FO(Exp) = FO(Exp 1 ) = {+,,, /, ), $} The tble is too wide for the pge, so we split it into two, but for lyout only (they re used s single tble). num + Exp Exp Exp$ Exp Exp numexp 1 Exp 1 Exp 1 +ExpExp 1 Exp 1 Exp 1 ExpExp 1 Exp 1 Exp 1 ExpExp 1 Exp 1 13
14 / ( ) $ Exp Exp Exp$ Exp Exp (Exp)Exp 1 Exp 1 Exp 1 /ExpExp 1 Exp 1 Exp 1 Exp 1 Note tht there re severl conflicts for Exp 1, which isn t surprising, s the grmmr is mbiguous. Exercise 2.14 ) b) c) E nume E E + E E E E E E nume E E Aux E Aux +E Aux E Nullble FIRST E nume f lse {num} E E Aux f lse {num} E true {} Aux +E f lse {+} Aux E f lse { } FOLLOW E {+,, $} E {+,, $} Aux {+,, $} d) num + $ E E nume E E E Aux E E E Aux Aux +E Aux E 14
15 Exercise 2.19 ) We dd the production T T. b) We dd the production T T $ for clculting FOLLOW. We get the constrints (omitting trivilly true constrints): which solves to T T $ : $ FOLLOW(T ) T T : FOLLOW(T ) FOLLOW(T ) T T >T : > FOLLOW(T ) T T T : FOLLOW(T ) T int : c) We number the productions: nd mke NFAs for ech: 0 T A B FOLLOW(T ) = {$} FOLLOW(T ) = {$, >, } 0: T T 1: T T >T 2: T T T 3: T int 1 T C -> D T E F 2 T G * H T I J 3 int K L 15
16 We then dd epsilon-trnsitions: A C E G I ε C, G, K C, G, K C, G, K C, G, K C, G, K nd convert to DFA (in tbulr form): stte NFA sttes int -> * T 0 A, C, G, K s1 g2 1 L 2 B, D, H s3 s4 3 E, C, G, K s1 g5 4 I, C, G, K s1 g6 5 F, D, H s3 s4 6 J, D, H s3 s4 nd dd ccept/reduce ctions ccording to the FOLLOW sets: stte NFA sttes int -> * $ T 0 A, C, G, K s1 g2 1 L r3 r3 r3 2 B, D, H s3 s4 cc 3 E, C, G, K s1 g5 4 I, C, G, K s1 g6 5 F, D, H s3/r1 s4/r1 r1 6 J, D, H s3/r2 s4/r2 r2 d) The conflict in stte 5 on -> is between shifting on -> or reducing to production 1 (which contins ->). Since -> is right-ssocitive, we shift. The conflict in stte 5 on * is between shifting on * or reducing to production 1 (which contins ->). Since * binds tighter, we shift. The conflict in stte 6 on -> is between shifting on -> or reducing to production 2 (which contins *). Since * binds tighter, we reduce. The conflict in stte 6 on * is between shifting on * or reducing to production 2 (which contins *). Since * is left-ssocitive, we reduce. The finl tble is: 16
17 stte int -> * $ T 0 s1 g2 1 r3 r3 r3 2 s3 s4 cc 3 s1 g5 4 s1 g6 5 s3 s4 r1 6 r2 r2 r2 Exercise 2.20 The method from section cn be used with stndrd prser genertor nd with n unlimited number of precedences, but the restructuring of the syntx tree fterwrds is bothersome. The precedence of n opertor needs not be known t the time the opertor is red, s long s it is known t the end of reding the syntx tree. Method ) requires non-stndrd prser genertor or modifiction of generted prser, but it lso llows n unlimited number of precedences nd it doesn t require restructuring fterwrds. The precedence of n opertor needs to be known when it is red, but this knowledge cn be quired erlier in the sme prse. Method b) cn be used with stndrd prser genertor. The lexer hs rule for ll possible opertor nmes nd looks up in tble to find which token to use for the opertor (similr to how, s described in section 2.9.1, identifiers cn looked up in tble to see if they re keywords or vribles). This tble cn be updted s result of prser ction, so like method ), precedence cn be declred erlier in the sme prse, but not lter. The min disdvntge is tht the number of precedence levels nd the ssocitivity of ech level is fixed in dvnce, when the prser is constructed. Exercise 2.21 ) The grmmr describes the lnguge of ll even-length plindromes, i.e., strings tht re the sme when red forwrds or bckwrds. b) The grmmr is unmbiguous, which cn be proven by induction on the length of the string: If it is 0, the lst production is the only tht mtches. If greter thn 0, the first nd lst chrcters in the string uniquely selects the first or second production (or fils, if none mtch). After the first nd lst chrcters re removed, we re bck to the originl prsing problem, but on shorter string. By the induction hypothesis, this will hve unique syntx tree. 17
18 c) We dd strt production A A) nd number the productions: 0: A A 1: A A 2: A b A b 3: A We note tht FOLLOW(A) = {, b, $} nd mke NFAs for ech production: 0 A A B 1 C A D E F 2 b G A H b I J 3 K We then dd epsilon-trnsitions: A D H ε C, G, K C, G, K C, G, K nd convert to DFA (in tbulr form) nd dd ccept/reduce ctions: stte NFA sttes b $ A 0 A, C, G, K s1/r3 s2/r3 r3 g3 1 D, C, G, K s1/r3 s2/r3 r3 g4 2 H, C, G, K s1/r3 s2/r3 r3 g5 3 B cc 4 E s6 5 I s7 6 F r1 r1 r1 7 J r2 r2 r2 18
19 d) Consider the string. In stte 0, we shift on the first to stte 1. Here we re given choice between shifting on the second or reducing with the empty reduction. The right ction is reduction, so r3 on in stte 1 must be preserved. Consider insted the string. After the first shift, we re left with the sme choice s before, but now the right ction is to do nother shift (nd then reduce). So s1 on in stte 1 must lso be preserved. Removing ny of these two ctions will, hence, mke legl string unprseble. So we cn t remove ll conflicts. Some cn be removed, though, s we cn see tht choosing some ctions will led to sttes from which there re no legl ctions. This is true for the r3 ctions in nd b in stte 0, s these will led to stte 3 before reching the end of input. The r3 ction on b in stte 1 cn be removed, s this would indicte tht we re t the middle of the string with n before the middle nd b fter the middle. Similrly, the r3 ction on in stte 2 cn be removed. But we re still left with two conflicts, which cn not be removed: stte b $ A 0 s1 s2 r3 g3 1 s1/r3 s2 r3 g4 2 s1 s2/r3 r3 g5 3 cc 4 s6 5 s7 6 r1 r1 r1 7 r2 r2 r2 4 Exercises for chpter 3 Exercise 3.2 In Stndrd ML, nturl choice for simple symbol tbles re lists of pirs, where ech pir consists of nme nd the object bound to it. The empty symbol tble is, hence the empty list: vl emptytble = []} Binding symbol to n object is done by prepending the pir of the nme nd object to the list: fun bind(nme,object,tble) = (nme,object)::tble} 19
20 Looking up nme in tble is serching (from the front of the list) for pir whose first component is the nme we look for. To hndle the possibility of nme not being found, we let the lookup function return n option type: If nme is bound, we return SOME obj, where obj is the object bound to the nme, otherwise, we return NONE: fun lookup(nme,[]) = NONE lookup(nme,(nme1,obj)::tble) = if nme=nme1 then SOME obj else lookup(nme,tble) Entering nd exiting scopes don t require ctions, s the symbol tbles re persistent. Exercise 3.3 The simplest solution is to convert ll letters in nmes to lower cse before doing ny symbol-tble opertions on the nmes. Error messges should, however, use the originl nmes, so it is bd ide to do the conversion lredy during lexicl nlysis or prsing. 5 Exercises for chpter 5 Exercise 5.3 We use synthesized ttribute tht is the set of exceptions tht re thrown but not cught by the expression. If t S 1 ctch i S 2, i is not mong the exceptions tht S 1 cn throw, we give n error messge. If the set of exceptions tht the top-level sttement cn throw is not empty, we lso give n error messge. Check S (S) = cse S of throw id {nme(id)} S 1 ctch id S 2 thrown 1 = Check S (S 1 ) thrown 2 = Check S (S 2 ) i f nme(id) thrown 1 then (thrown 1 \ {nme(id)}) thrown 2 else error() S 1 or S 2 Check S (S 1 ) Check S (S 2 ) other {} 20
21 CheckTopLevel S (S) = thrown = Check S (S) i f thrown {} then error() 6 Exercises for chpter 6 Exercise 6.1 New temporries re t2,... in the order they re generted. Indenttion shows sub-expression level. t2 := 2 t5 := t0 t6 := t1 t4 := t5+t6 t8 := t0 t9 := t1 t7 := t8*t9 t3 := CALL _g(t4,t7) r := t2+t3 21
22 Exercise 6.9 ) Trns Stt (Stt,vtble, ftble,endlbel) = cse Stt of Stt 1 ; Stt 2 lbel 1 = newlbel() code 1 = Trns Stt (Stt 1,vtble, ftble,lbel 1 ) code 2 = Trns Stt (Stt 2,vtble, ftble,endlbel) code 1 ++[LABEL lbel 1 ]++code 2 id := Exp plce = lookup(vtble, nme(id)) Trns Exp (Exp,vtble, ftble, plce) if Cond lbel 1 = newlbel() then Stt 1 code 1 = Trns Cond (Cond,lbel 1,endlbel,vtble, ftble) code 2 = Trns Stt (Stt 1,vtble, ftble,endlbel) code 1 ++[LABEL lbel 1 ]++code 2 if Cond lbel 1 = newlbel() then Stt 1 lbel 2 = newlbel() else Stt 2 code 1 = Trns Cond (Cond,lbel 1,lbel 2,vtble, ftble) code 2 = Trns Stt (Stt 1,vtble, ftble,endlbel) code 3 = Trns Stt (Stt 2,vtble, ftble,endlbel) code 1 ++[LABEL lbel 1 ]++code 2 ++[GOTO endlbel, LABEL lbel 2 ] ++code 3 while Cond lbel 1 = newlbel() do Stt 1 lbel 2 = newlbel() code 1 = Trns Cond (Cond,lbel 2,endlbel,vtble, ftble) code 2 = Trns Stt (Stt 1,vtble, ftble,lbel 1 ) [LABEL lbel 1 ]++code 1 ++[LABEL lbel 2 ]++code 2 ++[GOTO lbel 1 ] repet Stt 1 lbel 1 = newlbel() until Cond lbel 3 = newlbel() code 1 = Trns Stt (Stt 1,vtble, ftble,lbel 3 ) code 2 = Trns Cond (Cond,endlbel,lbel 1,vtble, ftble) [LABEL lbel 1 ]++code 1 ++[LABEL lbel 3 ]++code 2 b) New temporries re t2,... in the order they re generted. Indenttion follows sttement structure. LABEL l1 t2 := t0 22
23 t3 := 0 IF t2>t3 THEN l2 ELSE endlb LABEL l2 t4 := t0 t5 := 1 t0 := t4-t5 t6 := x t7 := 10 IF t6>t6 THEN l3 ELSE l1 LABEL l3 t8 := t0 t9 := 2 t0 := t8/t9 GOTO l1 LABEL endlb 23
Homework 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 informationBinary Representation of Numbers Autar Kaw
Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationOne Minute To Learn Programming: Finite Automata
Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More informationPROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY
MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive
More informationExample 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.
2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this
More informationJava CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:
Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More informationRegular Languages and Finite Automata
N Lecture Notes on Regulr Lnguges nd Finite Automt for Prt IA of the Computer Science Tripos Mrcelo Fiore Cmbridge University Computer Lbortory First Edition 1998. Revised 1999, 2000, 2001, 2002, 2003,
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationFORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES
FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES Introduction This compendium contins exercises out regulr lnguges for the course Forml Lnguges, Automt nd Theory of Computtion
More informationTreatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.
The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only
More informationExperiment 6: Friction
Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht
More informationAlgebra Review. How well do you remember your algebra?
Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then
More informationflex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A
flex Regulr Expressions nd Lexicl Scnning Using flex to Build Scnner flex genertes lexicl scnners: progrms tht discover tokens. Tokens re the smllest meningful units of progrm (or other string). flex is
More informationSPECIAL PRODUCTS AND FACTORIZATION
MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come
More informationand thus, they are similar. If k = 3 then the Jordan form of both matrices is
Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If
More informationUse Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.
Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd
More informationMathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100
hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by
More informationSection 7-4 Translation of Axes
62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the
More informationLecture 3 Gaussian Probability Distribution
Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike
More information19. The Fermat-Euler Prime Number Theorem
19. The Fermt-Euler Prime Number Theorem Every prime number of the form 4n 1 cn be written s sum of two squres in only one wy (side from the order of the summnds). This fmous theorem ws discovered bout
More informationLINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES
LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply
More informationHelicopter Theme and Variations
Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationSolution to Problem Set 1
CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let
More informationPhysics 43 Homework Set 9 Chapter 40 Key
Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x
More informationMATH 150 HOMEWORK 4 SOLUTIONS
MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive
More informationEcon 4721 Money and Banking Problem Set 2 Answer Key
Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in
More information9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes
The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors
More information1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam
1./1.1 Introduction to Computers nd Engineering Problem Solving Fll 211 - Finl Exm Nme: MIT Emil: TA: Section: You hve 3 hours to complete this exm. In ll questions, you should ssume tht ll necessry pckges
More informationUnit 6: Exponents and Radicals
Eponents nd Rdicls -: The Rel Numer Sstem Unit : Eponents nd Rdicls Pure Mth 0 Notes Nturl Numers (N): - counting numers. {,,,,, } Whole Numers (W): - counting numers with 0. {0,,,,,, } Integers (I): -
More informationFactoring Polynomials
Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles
More information9 CONTINUOUS DISTRIBUTIONS
9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete
More informationRIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS
RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS Known for over 500 yers is the fct tht the sum of the squres of the legs of right tringle equls the squre of the hypotenuse. Tht is +b c. A simple proof is
More information2 DIODE CLIPPING and CLAMPING CIRCUITS
2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of
More informationDlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report
DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of
More informationBabylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity
Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University
More informationEQUATIONS OF LINES AND PLANES
EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint
More informationVectors 2. 1. Recap of vectors
Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms
More informationNovel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm
Bibhudendr chry, Girij Snkr Rth, Srt Kumr Ptr, nd Sroj Kumr Pnigrhy Novel Methods of Generting Self-Invertible Mtrix for Hill Cipher lgorithm Bibhudendr chry Deprtment of Electronics & Communiction Engineering
More informationHow fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS 3343 -- Spring 2009
CS 4 -- Spring 2009 Sorting Crol Wenk Slides courtesy of Chrles Leiserson with smll chnges by Crol Wenk CS 4 Anlysis of Algorithms 1 How fst cn we sort? All the sorting lgorithms we hve seen so fr re comprison
More information10.6 Applications of Quadratic Equations
10.6 Applictions of Qudrtic Equtions In this section we wnt to look t the pplictions tht qudrtic equtions nd functions hve in the rel world. There re severl stndrd types: problems where the formul is given,
More informationBasic Analysis of Autarky and Free Trade Models
Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently
More information4.11 Inner Product Spaces
314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces
More informationNetwork Configuration Independence Mechanism
3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting
More informationRotating DC Motors Part II
Rotting Motors rt II II.1 Motor Equivlent Circuit The next step in our consiertion of motors is to evelop n equivlent circuit which cn be use to better unerstn motor opertion. The rmtures in rel motors
More informationMorgan Stanley Ad Hoc Reporting Guide
spphire user guide Ferury 2015 Morgn Stnley Ad Hoc Reporting Guide An Overview For Spphire Users 1 Introduction The Ad Hoc Reporting tool is ville for your reporting needs outside of the Spphire stndrd
More informationIntegration by Substitution
Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes of revolution, prt ii Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem ) nd the ccumultion process is to determine so-clled volumes of
More informationUnambiguous Recognizable Two-dimensional Languages
Unmbiguous Recognizble Two-dimensionl Lnguges Mrcell Anselmo, Dor Gimmrresi, Mri Mdoni, Antonio Restivo (Univ. of Slerno, Univ. Rom Tor Vergt, Univ. of Ctni, Univ. of Plermo) W2DL, My 26 REC fmily I REC
More informationCS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001
CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic
More informationUNIVERSITY OF OSLO FACULTY OF MATHEMATICS AND NATURAL SCIENCES
UNIVERSITY OF OSLO FACULTY OF MATHEMATICS AND NATURAL SCIENCES Solution to exm in: FYS30, Quntum mechnics Dy of exm: Nov. 30. 05 Permitted mteril: Approved clcultor, D.J. Griffiths: Introduction to Quntum
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationQuick Reference Guide: One-time Account Update
Quick Reference Guide: One-time Account Updte How to complete The Quick Reference Guide shows wht existing SingPss users need to do when logging in to the enhnced SingPss service for the first time. 1)
More informationFAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University
SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility
More informationModule Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials
MEI Mthemtics in Ection nd Instry Topic : Proof MEI Structured Mthemtics Mole Summry Sheets C, Methods for Anced Mthemtics (Version B reference to new book) Topic : Nturl Logrithms nd Eponentils Topic
More informationOr more simply put, when adding or subtracting quantities, their uncertainties add.
Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re
More informationA Visual and Interactive Input abb Automata. Theory Course with JFLAP 4.0
Strt Puse Step Noninverted Tree A Visul nd Interctive Input Automt String ccepted! 5 nodes generted. Theory Course with JFLAP 4.0 q0 even 's, even 's q2 even 's, odd 's q1 odd 's, even 's q3 odd 's, odd
More informationThe Velocity Factor of an Insulated Two-Wire Transmission Line
The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the
More informationWeek 7 - Perfect Competition and Monopoly
Week 7 - Perfect Competition nd Monopoly Our im here is to compre the industry-wide response to chnges in demnd nd costs by monopolized industry nd by perfectly competitive one. We distinguish between
More informationData replication in mobile computing
Technicl Report, My 2010 Dt repliction in mobile computing Bchelor s Thesis in Electricl Engineering Rodrigo Christovm Pmplon HALMSTAD UNIVERSITY, IDE SCHOOL OF INFORMATION SCIENCE, COMPUTER AND ELECTRICAL
More informationProtocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationModule 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur
Module Anlysis of Stticlly Indeterminte Structures by the Mtrix Force Method Version CE IIT, Khrgpur esson 9 The Force Method of Anlysis: Bems (Continued) Version CE IIT, Khrgpur Instructionl Objectives
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationAntiSpyware Enterprise Module 8.5
AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility
More informationSection 5-4 Trigonometric Functions
5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationbody.allow-sidebar OR.no-sidebar.home-page (if this is the home page).has-custom-banner OR.nocustom-banner .IR OR.no-IR
body.llow-sidebr OR.no-sidebr.home-pge (if this is the home pge).hs-custom-bnner OR.nocustom-bnner.IR OR.no-IR #IDENTIFIER_FOR_THIS_SITE div#pge-continer.depends_on_page_ty PE llow-sidebr mens tht there
More informationFundamentals of Analytical Chemistry
Homework Fundmentls of Anlyticl hemistry 7-0,, 4, 8, 0, 7 hpter 5 Polyfunctionl Acids nd Bses Acids tht cn donte more thn proton per molecule Strong cid H SO 4 Severl wek cids Well behved dissocition For
More information2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration
Source: http://www.mth.cuhk.edu.hk/~mt26/mt26b/notes/notes3.pdf 25-6 Second Term MAT26B 1 Supplementry Notes 3 Interchnge of Differentition nd Integrtion The theme of this course is bout vrious limiting
More informationVersion 001 Summer Review #03 tubman (IBII20142015) 1
Version 001 Summer Reiew #03 tubmn (IBII20142015) 1 This print-out should he 35 questions. Multiple-choice questions my continue on the next column or pge find ll choices before nswering. Concept 20 P03
More informationDecision Rule Extraction from Trained Neural Networks Using Rough Sets
Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT
More informationQuick Reference Guide: Reset Password
Quick Reference Guide: Reset Pssword How to reset pssword This Quick Reference Guide shows you how to reset your pssword if you hve forgotten it. There re three wys to reset your SingPss pssword: 1) Online
More informationLecture 5. Inner Product
Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right
More informationBayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationAP STATISTICS SUMMER MATH PACKET
AP STATISTICS SUMMER MATH PACKET This pcket is review of Algebr I, Algebr II, nd bsic probbility/counting. The problems re designed to help you review topics tht re importnt to your success in the clss.
More informationBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University
More informationP.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn
33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of
More informationVendor Rating for Service Desk Selection
Vendor Presented By DATE Using the scores of 0, 1, 2, or 3, plese rte the vendor's presenttion on how well they demonstrted the functionl requirements in the res below. Also consider how efficient nd functionl
More informationffiiii::#;#ltlti.*?*:j,'i#,rffi
5..1 EXPEDTNG A PROJECT. 187 700 6 o 'o-' 600 E 500 17 18 19 20 Project durtion (dys) Figure 6-6 Project cost vs. project durtion for smple crsh problem. Using Excel@ to Crsh Project T" llt ffiiii::#;#ltlti.*?*:j,'i#,rffi
More informationIntegration. 148 Chapter 7 Integration
48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but
More informationWarm-up for Differential Calculus
Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:
More informationChapter. Contents: A Constructing decimal numbers
Chpter 9 Deimls Contents: A Construting deiml numers B Representing deiml numers C Deiml urreny D Using numer line E Ordering deimls F Rounding deiml numers G Converting deimls to frtions H Converting
More informationOn decidability of LTL model checking for process rewrite systems
Act Informtic (2009) 46:1 28 DOI 10.1007/s00236-008-0082-3 ORIGINAL ARTICLE On decidbility of LTL model checking for process rewrite systems Lur Bozzelli Mojmír Křetínský Vojtěch Řehák Jn Strejček Received:
More informationLearning to Search Better than Your Teacher
Ki-Wei Chng University of Illinois t Urbn Chmpign, IL Akshy Krishnmurthy Crnegie Mellon University, Pittsburgh, PA Alekh Agrwl Microsoft Reserch, New York, NY Hl Dumé III University of Mrylnd, College
More informationBasic Research in Computer Science BRICS RS-02-13 Brodal et al.: Solving the String Statistics Problem in Time O(n log n)
BRICS Bsic Reserch in Computer Science BRICS RS-02-13 Brodl et l.: Solving the String Sttistics Prolem in Time O(n log n) Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl Rune
More informationConcept Formation Using Graph Grammars
Concept Formtion Using Grph Grmmrs Istvn Jonyer, Lwrence B. Holder nd Dine J. Cook Deprtment of Computer Science nd Engineering University of Texs t Arlington Box 19015 (416 Ytes St.), Arlington, TX 76019-0015
More informationwww.mathsbox.org.uk e.g. f(x) = x domain x 0 (cannot find the square root of negative values)
www.mthsbo.org.uk CORE SUMMARY NOTES Functions A function is rule which genertes ectl ONE OUTPUT for EVERY INPUT. To be defined full the function hs RULE tells ou how to clculte the output from the input
More informationUNLOCKING TECHNOLOGY IVECO
UNLOCKING TECHNOLOGY IVECO IVECO - CONTENTS PPLICTIONS PGE DS136 IVECO 3 DS177 IVECO CN 3 DIGNOSTIC SOCKETS LOCTIONS IVECO 4 GENERL OPERTION 5 6 TIPS & HINTS 15 2 Version: 2.3 July 2011 Copyright 2009
More informationTwo hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00
COMP20212 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Digitl Design Techniques Dte: Fridy 16 th My 2008 Time: 14:00 16:00 Plese nswer ny THREE Questions from the FOUR questions provided
More informationUNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics STRATEGIC SECOND SOURCING IN A VERTICAL STRUCTURE
UNVERSTY OF NOTTNGHAM Discussion Ppers in Economics Discussion Pper No. 04/15 STRATEGC SECOND SOURCNG N A VERTCAL STRUCTURE By Arijit Mukherjee September 004 DP 04/15 SSN 10-438 UNVERSTY OF NOTTNGHAM Discussion
More informationExponential and Logarithmic Functions
Nme Chpter Eponentil nd Logrithmic Functions Section. Eponentil Functions nd Their Grphs Objective: In this lesson ou lerned how to recognize, evlute, nd grph eponentil functions. Importnt Vocbulr Define
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationFUNCTIONS AND EQUATIONS. xεs. The simplest way to represent a set is by listing its members. We use the notation
FUNCTIONS AND EQUATIONS. SETS AND SUBSETS.. Definition of set. A set is ny collection of objects which re clled its elements. If x is n element of the set S, we sy tht x belongs to S nd write If y does
More informationSection 5.2, Commands for Configuring ISDN Protocols. Section 5.3, Configuring ISDN Signaling. Section 5.4, Configuring ISDN LAPD and Call Control
Chpter 5 Configurtion of ISDN Protocols This chpter provides instructions for configuring the ISDN protocols in the SP201 for signling conversion. Use the sections tht reflect the softwre you re configuring.
More information