Blog

Select the statement that best describes Flash memory.

Convert 7.062510 to a Q4.4 fixed-point binary number.  Show all 8 bits and the binary point (ex: “0001.1000”). Note: 1/16 = 0.0625; 2/16 = 0.125; 3/16 = 0.1875; 4/16 = 0.25; 5/16 = 0.3125; 6/16 = 0.375; 7/16 = 0.4375; 8/16 = 0.5; 9/16 = 0.5625; 10/16 = 0.625; 11/16 = 0.6875; 12/16 = 0.75; 13/16 = 0.8125; 14/16 = 0.875; 15/16 = 0.9375

Given: A = 10010011. What is the result of A LSL 4 (logical shift left)? Enter your answer in binary (ex: “00110101”).

Given:  A is an integer in a program that stores a temperature reading in degrees F, using an implied decimal point with one digit to the right of the decimal point (x.x).  If the temperature reading is 98.6 degrees F, what value should be stored in A?

Given: A finite state machine has 31 states. What is the minimum number of flip-flops required if one-hot encoding is used to encode the state?

Given: 01000011001100000000000000000000 is an IEEE-754 single precision floating-point number. What is the actual exponent (not the biased exponent; ex: “-8”, “7”)?

Given: A is an integer in a program that stores a weight measurement in pounds, using an implied decimal point with one digit to the right of the decimal point (x.x). If the value stored in A is 1658, what is the weight measurement in pounds?

A state transition diagram for a finite state machine is given. The clock input is 100 MHz. Suppose the FSM is currently in state S2 and the inputs are AB = 01.  What will the state be after the next clock edge?  What will the output be?

REQUIRED: Please respond to each part of this question that deals with cash. (Hint:  These items were discussed in class numerous times!) 1. Why is cash significant to the audit, even if it is considered immaterial?   2. Name a audit procedure that must always be done for cash, even if it is immaterial? (Hint: not a bank reconcilation).   3. Name and briefly descibe two different controls for cash.  (Hint: not a bank reconcilation).  

True or False: Integer multipliers are generally slower than floating-point multipliers