Toggle navigation
Schools
Login
Sign Up
All Schools
Stanford University
CSC
Courses in CSC
CSC 106A | Programing Methodology
Documents:
17
Popular Documents from Stanford University
1. In Booth’s non restoring division algorithm, at the end of last cycle, if magnitude of A < 0? a. A=A+M b. A=A-M c. M=A+M d. End of algorithm 2. In Booth’s non restoring division algorithm, at the end of last cycle, if magnitude of A > 0? a. A=A+M
1. In Booth’s bit-pair recoding, what version of multiplicand will be selected if recoded multiplier bits are -1+1? a. 0*M b. +1*M c. -1*M d. +2*M 2. In Booth’s bit-pair recoding, what version of multiplicand will be selected if recoded multiplier bi
1. In Booth’s restoring division algorithm, after performing operations (1) left shift operation on A,Q and (2) A=A-M, if MSB of A is 1? a. Q 0 =0, A=A+M b. A=A+M c. Q 0 =1 d. A=A-M 2. In Booth’s restoring division algorithm, for Dividend=1000 and Di
1. In Booth’s non-restoring division algorithm, after performing left shift operation on A,Q registers, if magnitude of A < 0 then ? a. Q 0 =0, A=A+M b. A=A+M c. Q 0 =1 d. A=A-M 2. In Booth’s non-restoring division algorithm, after performing left sh
1. What is the range of bias exponent in double precision representation of floating point number? a. 0 to 255 b. 0 to 1023 c. 0 to 256 d. 0 to 127 2. What are the values of bias exponent to represent single precision floating point values of exact 0