

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
This exam paper is very helpful for the student of discrete mathematics. The major points in these exam paper are: Boolean Algebra, Boolean Equality, N-Bit Binary Numbers, Complement Representations, Boolean Expression, N-Digit System, Sum of Products, Boolean Transform, Proof of Consensus Theorem, Recursive Function
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Only final answers available. Solutions and proofs not included. Proofs for recursive sequences please refer to questions 6.34 and 6.35in Shaum’s series. For each sequence, the RANK for the first number is 0.
Definition Range [− 5 − ×x 10 ⇒n (^) − (^101) , n 5 −× x 10 n− (^1) − 1] Arithmetic − 21610 + 65 10 = 10^6 − 216 + 65 = 999849 3.Definition −x ⇒ 8 n (^) − x Range [− 4 × 8 n−^1 , 4 × 8 n−^1 − 1] Arithmetic 86 − 120 − 1208 − 278 = 777660 8 + 8^6 −^278 = 17776318 8 + 777751 =^8 = 77763181
1.(a) 591 (b) 324561 2.(a) H(6, S, E, G) ⇒ H H(5(4, E, S, G, S, E, G)) ⇒⇒ H H(3(2, S, G, E, G, S, E)) ⇒⇒
G −→^2 E (b) G −→^2 E S(4, 1), E(3), G(6, 5 , 2) (c) GS(4) −→^1 , E S(3), G(6, 5 , 2 , 1)
(d) S −→^1 E