>> operator is used to denote _________
1. left shift
2.right shift
3. greater than
4.less than
If Booth’s Multiplication is performed on the numbers 22*3, then what is 3 referred to as _______
1. accumulator
2.multiplicand
3. quotient
4.multiplier
The 16’s complement of 74E will be ______
1. 8B2
2.F8B2
3.2B8
4.8C2
The possible number of bit patterns with 8 bits _______
1.128
2.8
3.24
4.256
The word ______comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi.
1. Flowchart
2.Flow
3.Algorithm
4.Syntax
7’s complement of 432 is _______
1.432
2.543
3.345
4.777
A data structure that follows the FIFO principle.
1.Queue
2. LL
3. Stack
4. Union
A system wherein items are added from one and removed from the other end.
1.Stack
2.Queue
3.Linked List
4.Array
Another name for 1-D arrays.
1.Linear arrays
2.Lists
3.Horizontal array
4.Vertical array
Binary addition of 1 + 1 gives the result _______
1.0
2.1
3.2
4.10
Booth’s Algorithm is applied on ______
1. decimal numbers
2.binary numbers
3.hexadecimal numbers
4.octal Numbers
Express the decimal format of the signed binary number (101010)2 .
1.10
2.12
3.-12
4. -10
If m is the 2’s complement and n is the binary number, then ______
1.m=n’
2. m=n’+1
3. m=n’-1
4.m=n
If you are given a word of size n bits, the range of 2’s complement of binary numbers is ________
1.-2n+1 to +2n+1
2.-2n-1 to +2n-1
3.-2n-1 to +2n+1
4.-2n-1 to +2n-1-1
In both signed magnitude and 2’s complement , positive and negative numbers are separated using ______
1. LSB
2.MSB
3.0
4.1
Perform binary addition of 1101 + 0010 is ________
1. 1110
2.1111
3.0111
4.1,1101
Single Precision format comprises of _________ bits
1.4
2.8
3.16
4.32
The 10’s complement of 562 is ______
1.4
2.3
3. 7
4. 8
The 1’s complement of 1 in 4 bits is _____
1. 0001
2.0
3. 1001
4.1110
The 1’s complement of 1111111110.101 is ______
1. 1.010
2. 0000000000.010
3.1111111110.101
4.1.101
The 9’s complement of 6578 is ______
1. 1234
2.3421
3.3124
4.3420
The binary number 111 in its 2’s complement form is ______
1.010
2.001
3.000
4.111
The binary number obtained after applying RSC on 11010 will be _____
1.11101
2.10100
3. 01101
4. 01000
The complement of any number can be given by a general term ______
1. Bn – 1 – N
2. Bn -1 + N
3.Bn +1 – N
4. Bn +1 + N
The IEEE standard followed by almost all the computers for floating point arithmetic _____
1. IEEE 260
2.IEEE 488
3.IEEE 754
4.IEEE 610
The multiplication of 110 * 111 is performed. What is a general term used for 111?
1.Dividend
2.Quotient
3.Multiplicand
4. Multiplier
The number of sign bits in a 32-bit IEEE format is _______
1. 1
2.11
3.9
4.23
The number of sign bits in a 32-bit IEEE format _________
1.1
2.11
3.9
4.23
The result obtained on subtraction using 2’s complement of 1111-0010 will be _____
1. 11101
2.11011
3. 1101
4. 1011
The result of >> of 11001 by 3-bits will be _____
1.01000
2.01111
3.00011
4.11111111
The result of 0 – 1 in binary is _______
1.0
2.1
3.11
4.10
The result of 0*1 in binary is ______
1. 0
2.1
3.invalid
4.10
The result that is smaller than the smallest number obtained is referred to as _____
1.NaN
2.Underflow
3. Smallest
4.Mantissa
The sign magnitude representation of -9 is _______
1.00001001
2. 11111001
3.10001001
4.11001
The subtraction using 1’s complement of 110 – 100 will give the result ______
1. -011
2. 011
3. 010
4.-010
The time that depends on the input: an already sorted sequence that is easier to sort.
1.Process
2.Evaluation
3.Running
4.Input
This characteristic often draws the line between what is feasible and what is impossible.
1. Performance
2.System Evaluation
3.Modularity
4.Reliability
What do you call the intermediate terms in binary multiplication?
1. Multipliers
2.Mid terms
3.Partial Products
4.Multiplicands
What does the data transfer instruction STA stand for?
1. Store Accumulator
2.Send Accumulator
3. Send Action
4.Store Action
What is NaN in IEEE standards?
1.Not arithmetic
2.Not arithmetic
3. Not a number
4.Not a Node
What is the 1’s complement of 11010?
1.11010
2.11011
3. 00110
4. 00101
What is the default value of accumulator in booth’s multiplication of two 4-bit binary numbers?
1. 0
2. 1
3.0000
4.00000
What is the value of n in multiplication of 110* 1000?
1.2
2.3
3.4
4.0
What will be the value obtained after multiplication of (-2) * (-3) using Booth’s Algorithm?
1.6
2. -6
3.-2
4. -3
When an algorithm is written in the form of a programming language, it becomes a _________
1.Flowchart
2. Program
3.Pseudo code
4.Syntax
Which of the following is incorrect? Algorithms can be represented:
1.as pseudo codes
2.as syntax
3.as programs
4.as flowcharts
Which of the following is often called the double precision format?
1.64-bit
2.8-bit
3.32-bit
4.128-bit
Which of the following is used for binary multiplication?
1.Restoring Multiplication
2.Booth’s Algorithm
3.Pascal’s Rule
4.Digit-by-digit multiplication
________ is a straightforward method of representing positive and negative numbers.
1.Radix
2.Complement
3.Sign Magnitude
4.Encode