Olete.in
Articles
Mock Tests
🧪 Algorithm MCQ Quiz Hub
Algorithm Mcq Set 1
Choose a topic to test your knowledge and improve your Algorithm skills
1. The word ______comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi.
Flowchart
Flow
Algorithm
Syntax
2. This characteristic often draws the line between what is feasible and what is impossible.
Performance
System Evaluation
Modularity
Reliability
3. The time that depends on the input: an already sorted sequence that is easier to sort.
Process
Evaluation
Running
Input
4. Which of the following is incorrect? Algorithms can be represented:
as pseudo codes
as syntax
as programs
as flowcharts
5. When an algorithm is written in the form of a programming language, it becomes a _________
Flowchart
Program
Pseudo code
Syntax
6. A system wherein items are added from one and removed from the other end.
Stack
Queue
Linked List
Array
7. Another name for 1-D arrays.
Linear arrays
Lists
Horizontal array
Vertical array
8. A data structure that follows the FIFO principle.
Queue
LL
Stack
Union
9. ________ is a straightforward method of representing positive and negative numbers.
Radix
Complement
Sign Magnitude
Encode
10. The 1’s complement of 1 in 4 bits is _____
0001
0
1001
1110
11. The binary number 111 in its 2’s complement form is ______
010
001
000
111
12. The sign magnitude representation of -9 is _______
00001001
11111001
10001001
11001
13. If you are given a word of size n bits, the range of 2’s complement of binary numbers is ________
-2n+1 to +2n+1
-2n-1 to +2n-1
-2n-1 to +2n+1
-2n-1 to +2n-1-1
14. In both signed magnitude and 2’s complement , positive and negative numbers are separated using ______
LSB
MSB
0
1
15. Single Precision format comprises of _________ bits
4
8
16
32
16. If m is the 2’s complement and n is the binary number, then ______
m=n’
m=n’+1
m=n’-1
m=n
17. The possible number of bit patterns with 8 bits _______
128
8
24
256
18. Which of the following is used for binary multiplication?
Restoring Multiplication
Booth’s Algorithm
Pascal’s Rule
Digit-by-digit multiplication
19. The binary number obtained after applying RSC on 11010 will be _____
11101
10100
01101
01000
20. The result of >> of 11001 by 3-bits will be _____
01000
01111
00011
11111111
21. Booth’s Algorithm is applied on ______
decimal numbers
binary numbers
hexadecimal numbers
octal Numbers
22. If Booth’s Multiplication is performed on the numbers 22*3, then what is 3 referred to as _______
accumulator
multiplicand
quotient
multiplier
23. What is the default value of accumulator in booth’s multiplication of two 4-bit binary numbers?
0
1
0000
00000
24. What is the value of n in multiplication of 110* 1000?
2
3
4
0
25. What will be the value obtained after multiplication of (-2) * (-3) using Booth’s Algorithm?
6
-6
-2
-3
26. What does the data transfer instruction STA stand for?
Store Accumulator
Send Accumulator
Send Action
Store Action
27. What is the 1’s complement of 11010?
11010
11011
00110
00101
28. The 10’s complement of 562 is ______
4
3
7
8
29. The 9’s complement of 6578 is ______
1234
3421
3124
3420
30. >> operator is used to denote _________
left shift
right shift
greater than
less than
31. The subtraction using 1’s complement of 110 – 100 will give the result ______
-011
011
010
-010
32. The result obtained on subtraction using 2’s complement of 1111-0010 will be _____
11101
11011
1101
1011
33. The 1’s complement of 1111111110.101 is ______
1.010
0000000000.010
1111111110.101
1.101
34. 7’s complement of 432 is _______
432
543
345
777
35. The 16’s complement of 74E will be ______
8B2
F8B2
2B8
8C2
36. Binary addition of 1 + 1 gives the result _______
0
1
2
10
37. The result of 0 – 1 in binary is _______
0
1
11
10
38. The complement of any number can be given by a general term ______
Bn – 1 – N
Bn -1 + N
Bn +1 – N
Bn +1 + N
39. The IEEE standard followed by almost all the computers for floating point arithmetic _____
IEEE 260
IEEE 488
IEEE 754
IEEE 610
40. Which of the following is often called the double precision format?
64-bit
8-bit
32-bit
128-bit
41. What is NaN in IEEE standards?
Not arithmetic
Not arithmetic
Not a number
Not a Node
42. The result that is smaller than the smallest number obtained is referred to as _____
NaN
Underflow
Smallest
Mantissa
43. The number of sign bits in a 32-bit IEEE format _________
1
11
9
23
44. Express the decimal format of the signed binary number (101010)2 .
10
12
-12
-10
45. The multiplication of 110 * 111 is performed. What is a general term used for 111?
Dividend
Quotient
Multiplicand
Multiplier
46. What do you call the intermediate terms in binary multiplication?
Multipliers
Mid terms
Partial Products
Multiplicands
47. The number of sign bits in a 32-bit IEEE format is _______
1
11
9
23
48. Perform binary addition of 1101 + 0010 is ________
1110
1111
0111
1,1101
49. The result of 0*1 in binary is ______
0
1
invalid
10
Submit