Document information
- University
- Politecnico di Milano
- Degree programme
- Computer Engineering
- Subject
- Reti Logiche
- Classification
- Exercises · By topic
- Original format
- Text
- Searchable text
Study material for Reti Logiche, shared by the Studwiz community and reviewed by moderators.
Study material for Reti Logiche, shared by the Studwiz community and reviewed by moderators.
Import quality: text was extracted directly from the original document.
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
p = q = r = s = x = y = z = u = Costo(RETE) s q j q r p p k p = bc + bde0 + a0c0 + ade0 + a0e 12 q = dc0 + b0ce + a0e + de + a0c0 11 r = eb0 + adb + c0b0 7 s = a0 + d 2 32 a b c d e p = bc + bde’ + a’c’ + ade’ + a’e q = dc’ + b’ce + a’e + de + a’c’ s = a’ + d r = eb’ + adb + c’b’ x y z u s q q s q = c0(d + a0) + e(d + a0) + b0ce c0s + es + b0ce 7 32 ) 28 Costo(q)= 7 Costo(RETE)= 28 < 32 a b c d e p = bc + bde’ + a’c’ + ade’ + a’e q = c’s + es + b’ce s = a’ + d r = eb’ + adb + c’b’ x y z u Si mostrano solo le connessioni relative a Q j q,r,p q,r,p 2 664 r=adb+b0(c0+e) q=s(c0+e)+b0ce p=bc+bde0+a0(c0+e)+ade0 j=f(a,b,c,d,e)(dadeterminare) 3 775 2 664 r=adb+b0j q=sj+b0ce p=bc+bde0+a0j+ade0 j=c0+e 3 775 r=adb+b0j 5 q=sj+b0ce 5 p=bc+bde0+a0j+ade0 10 s=a0+d 2 j=c0+e 2 28)24 Costo(RETE)=24<28 a b c d e p = bc + bde’ + a’j + ade’ q = js + b’ce s = a’ + d r = adb + jb’ x y z u Si mostrano solo le connessioni che subiscono cambiamento j = c’ + e p k p=bc+bde0+a0j+ade=bc+a0j+de0(b+a), p=bc+a0j+de0k 7 k=b+a 2 24)23 Costo(RETE)=23<24 a b c d e p = bc + a’j + kde’ q = js + b’ce s = a’ + d r = adb + jb’ x y z u Si mostrano solo le connessioni che subiscono cambiamento k = b + a j = c’ + e f(a, b, c, d)= a0b0cd0 + a0b0cd + a0bc0 + a0bc0d + abcd0 + abc0d + ab0cd0 + ab0cd f a, b f(a, b, c, d)= a0b0 · f(0, 0, c, d)+ a0 · bf(0, 1, c, d)+ ab0 · f(1, 0, c, d)+ ab · f(1, 1, c, d) Costoprima(f)= 31 f (0, 0, c, d)= cd0 + cd = c(d0 + d)= c f (0, 1, c, d)= c0 + c0d = c0 f (1, 0, c, d)= cd0 + cd = c(d0 + d)= c f (1, 1, c, d)= cd0 + c0d f(a, b, c, d)= a0b0c0 + a0bc0 + ab0c + abcd0 + abc0d Costodopo(f)= 17 Costo = 14 Reti Logiche A - Prova di mercoledì 17 novembre 2004 Esercizio n. 6 -- pagina 7 di 10 Esercizio n. 6 p=a’ f1=dea + r +ab’ f2= b’cp+ac’+depc f1 f2 r=pbc+b’cd+b’c f1 f2 a,b,c,d,e Data la…
First page of the document.