This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MSU CSE 260 Spring 2011 Exam 2ANSWER Name: This is a closed book exam, with 10 problems on 4 pages totaling 100 points. Integer Division/ Modulo Arithmatic 1. We can add two numbers in base 2 by using the following SUM and CARRY tables. The tables are formed based on mod 2 function; SUM bits correspond to mod 2 of the sum of the two digits and the carry bits are the quotients. SUM CARRY + 2  0 1 +2  0 1  0 1  0 1  1 1  0 1 (a) (5 points) Give the SUM and CARRY tables for base 3 addition. SUM CARRY + 3  0 1 2 + 3  0 1 2  0 1 2  0 1  1 2 1  0 1 2  2 1 2  0 1 1 (b) (5 points) Add the following in base 3: 211 3 +221 3 1202 3 2. (10 points) Perform the indicated conversions. (a) Convert (110101110) 2 to hexadecimal: (1 1010 1110) 2 = (1 AE ) 16 (b) Convert (2 EA 6) 16 to octal: (10 111 010 100 110) 2 = (27246) 8 1 3. (10 points) Complete the following multiplication problem by multiplying and adding the numbers in binary, without converting them to decimal. Show the intermediate products and carry bits. (1 0 1 0 1) 2 (1 0 1 0 1) 2 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 1 1 0 1 1 1 0 0 1 4. (5 points) (a) (5 points) Compute the boolean product of the following two zeroone matrices: 1 1 1 1 1 1 1 = 1 1 1 Functions 5. Consider the sets A = { , 1 , 2 , 3 , 4 } and B = { a, b, c, d, e } ....
View
Full
Document
This note was uploaded on 01/29/2012 for the course CSE 260 taught by Professor Saktipramanik during the Spring '08 term at Michigan State University.
 Spring '08
 SaktiPramanik

Click to edit the document details