CSC 215 Exam 2 Name Fatema 1. Design a combinational circuit that converts a four-bit Gray code A, B, C, D (a binary numeral system where two successive values differ in only one bit, shown as table blow) to a bit four-binary number w, x, y, z. ABCD wxyz 0000 0000 0001 0001 0011 0010 4 0010 0011 0110 0100 4 0111 0101 g 0101 0110 6 0100 0111 1100 1000 1101 1001 1111 1010 1110 1011 1010 1100 1011 1101 b) Do the circuit (5 1001 1110 1000 1111 1x2 a) Using Karnaugh maps, obtain a minimum sum-of-products form w, x, y, and z. (20 points) 0:1 1.0 10 00 h map for W 92 92 90 2 9-21 10 O 0 0 D 0 ωχ 6.1. ド 0 1 1 1

(For thought) a. A token of a computer language is any sequence of characters, with no intervening characters or white space, that taken as a unit has a unique meaning. Using this definition of a token, determine whether escape sequences, function names, and the keywords listed in Table 2.1 are tokens of the C++ language. b. Discuss whether adding white space to a message alters the message and whether messages can be considered tokens of C++. c. Using the definition of a token in Exercise 4a, determine whether the following statement is true: “Except for tokens of the language, C++ ignores all white space.”

___________ occurs when the result of an arithmetic operation exceeds the number of bits available to store it.