CSE20 Final Exam June 11, 2012, Exams of Discrete Mathematics

The final exam for the cse20 course, covering topics such as number systems, boolean algebra, and recursive functions. The exam includes problems on one's and two's complement, proving boolean algebra identities, expressing boolean functions in sum-of-products and product-of-sums form, finding the rank of permutations, proving identities using induction, and solving recursive formulas for frog jumping problem.

Typology: Exams

2012/2013

Uploaded on 04/23/2013

sarangapani
sarangapani 🇮🇳

4.5

(10)

62 documents

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE20 Final Exam, June 11, 2012, Name
1. (number systems: one’s complement) Show the operation of 17 + (14) in
one’s complement of binary number system. Assume that each binary number is
represented with 10 bits. (10 points)
2. (number systems: two’s complement) We have defined and learned the idea of
two’s complement for n-bit binary numbers.
2.1. Define the complement (corresponding to two’s) using an n-digit system with
base 8. (5 points)
2.2. Show the arithmetic of xywhere x= 118and y= 178in the complement
representations (corresponding to two’s) using a 5-digit system with base 8. (5
points)
1
Docsity.com
pf3
pf4
pf5

Partial preview of the text

Download CSE20 Final Exam June 11, 2012 and more Exams Discrete Mathematics in PDF only on Docsity!

CSE20 Final Exam, June 11, 2012, Name

  1. (number systems: one’s complement) Show the operation of 17 + (−14) in one’s complement of binary number system. Assume that each binary number is represented with 10 bits. (10 points)
  2. (number systems: two’s complement) We have defined and learned the idea of two’s complement for n-bit binary numbers. 2.1. Define the complement (corresponding to two’s) using an n-digit system with base 8. (5 points)

2.2. Show the arithmetic of x − y where x = 11 8 and y = 17 8 in the complement representations (corresponding to two’s) using a 5-digit system with base 8. ( points)

  1. (Boolean algebra: proof of consensus theorem) Prove the following equality using Boolean algebra laws and theorems. 3.1 Prove the consensus theorem: ab + a′c = ab + a′c + bc. (5 points)

3.2 Prove the Boolean equality (a + b)(a′^ + c) = (a + b)(a′^ + c)(b + c). (5 points)

  1. (recursive function: permutation) Suppose all the permutations on the set of { 1 , 2 , 3 , 4 , 5 , 6 } are listed in lexicographic order from 0 to 6! − 1. 6.1 What is the RANK (order) in the list for 453261? (10 points)

6.2 What permutation will have the RANK 165? (5 points)

  1. (recursive function: induction) Use induction to prove the following identity for any positive integer n: 1 × 2 + 2 × 3 + ... + (n − 1) × n = n(n − 1)(n + 1)/3. ( points)
  2. (recursive function: induction) Prove by induction that any postage of at least 8 cents can be obtained using 3 cents and 5 cents stamps. (10 points)