1. Represent -29.3125 in binary system. 16 bits. 9 for mantissa, 1 for sign, 5 for exponet, 1 for sign of exponet.
2. Write the data list that results from the shuffle-left algorithm to clen the following: 3, 0, 0,2, 6, 7, 0, 0, 5, 1.(include steps)
3. Assume a=1, b=2 c=3. What is the value of each Boolean expression?(true or false) (Show all steps).
a. [(a+b)]>c] AND (b>=c)
b. NOT[(a=b) AND (b=c)]
4.What numbers are compared to 72 if sequential search is used; 2, 5, 7, 9, 11, 17, 18, 21, 28, 30, 45, 54, 65, 69, 72. Also draw the binary tree.
5. What is the funtion of a multiplexor? Draw a multiplexor with 2^3 input lines and 1 output. How will you select the 4th input line?
6. What is the funtion of a decoder? Draw a 3 to 2^3 decoder circuit. What will happen if the binary values on input line are 101?
7. What is the maximum value(decimal) that can be represented using 5 bits of binary number?
