Home
MCQS
Gate MCQ Quiz Hub
GATE STUDY MATERIAL /COMPUTER ARCHITECTURE MCQ SET 3
Choose a topic to test your knowledge and improve your Gate skills
1. The register which holds the address of the locating to or from which data are to be transferred is known as
Index register
Instruction register
Memory address register
Memory data register
2. Which one is required while establishing the communication link between CPU and peripherals?
Index register
Instruction register
Memory address register
Memory data register
3. Which of the following data transfer modes takes relatively more time?
DMA
Interrupt initiated I/O
Programmed I/O
Isolated I/O
4. Halt operation comes under ………
Data transfer
Control transfer
Conversion
I/O transfer
5. The CPU initializes the DMA by sending ………
The starting address of the memory blocks where data is available or where data is to be stared
The word count
Control for mode and start the transfer
All of the above
6. In four – address instruction format, the number of bytes required to encode an instruction is (assume each address requires 24 bits, and 1 byte is required for operation code)
9
13
14
12
7. The minimum time delay between the initiations of two independent memory operations is called
Access time
Cycle time
Transfer rate
Latency Time
8. Consider an algebraic system (A,*), where A is a set of all non-zero real numbers and * is a binary operation defined by A* b = ab/4 then (G*) is a
Monoid
Semi group
Group
Abelian group
9. A 2 level memory has an average access time of 30 ns with cache and memory access time as 20 ns and 150 ns respectively. What is the hit ratio?
80%
93%
70%
99%
10. The following are some of the sequences of operations in the instruction cycle, which one is the correct sequence?
PC → address register Data from memory → Data register Data register → IR PC + 1 → PC
Address register →PC Data register → Data from memory Data register → IR PC + 1 → PC
Data from memory → Data register PC →Address register Data register → IR PC + 1 → PC
None of These
11. Horizontal micro construction has which of the following attributes? 1) Short formats 2) Limited ability to express parallel micro-operations 3) Considerable encoding of the control information
1 and 2
2 and 3
1,2 and 3
None of the these
12. The register which keeps track of the execution of a program and which contains the memory address of the instruction currently being executed is known as …………
Index – Register
Memory address register
Program Counter
Instruction registers
13. Consider the following situation and fill in the blanks: The computer starts the tape moving by issuing a command; the processor then monitors the status of the taps by means of a ………….. When the tape is in the correct position, the Processor issues a ……………
Data input, Status, data output command
Data input, Status control command
Control, Status, Data output command
Control, Status, data input Command
14. For interval arithmetic best rounding technique use is ………..
Rounding to plus and minus infinity
Rounding to zero
Rounding to nearest
None of These
15. Assume that the time required for the eight functional units, which operate in each of the eight cycles, are as follows. 5us, 8us, 64s, 10us, 15us, 12us, 6us, 8us Assume that pipe lining adds 1 us, of overhead. Find the speedup versus the single cycle data path.
4.67
4.375
4.44
4.285
16. Assembler directives represent……………… 1) Machine instructions to be included in the object program 2) The allocation of storage for constants or program variable
Only 1
only 2
Both 1 and 2
Neither 1 nor 2
17. The bus system of a machine has the following propagation delay times 40 ns for the signals to propagate through the multiplexers, 90ns to perform the ADD operating in the ALU, 30ns delay in the destination decoder, and 20ns to store the data into the destination register. What is the minimum cycle time that can be used for the clock?
120ns
150ns
960ns
180ns
18. The sequence of events that happen during a typical fetch operation is ?
PC → Mar →Memory → MOR → IR
PC → Memory → MDR → IR
PC → Memory → IR
PC → Mar → Memory → IR
19. In a fully associative cache memory consisting of 256 cache lines of 16 bytes each, a tag field is of 14 bits. Determine the size of cache memory and main memory.
2KB and 128 KB
4kB and 256KB
8KB and 1MB
None of the above
20. If doubling the cache line length reduces the miss rate to 3 percent, by how much it reduces the average memory access time?
27.1ns
25.75ns
22.2ns
4.85ns
21. Consider the following register – transfer language: R₃ ← R₂+ M[R₁ + R₂] Where R₁, R₂ are the CPU registers and M is a memory location in primary memory, which addressing mode is suitable for above register transfer language?
Immediate
Indexed
Direct
Displacement
22. Booth′s algorithm is used in floating – point
Addition
Subtraction
Multiplication
Division
23. A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has a through put of a. 1⁄3 b. 1⁄7 c. 7 d. 3
1/3
1/7
7
3
24. A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has a through put of
1/3
1/7
7
3
25. What is the control unit’s function in the CPU?
To decode program instructions
To transfer data to primary storage
To perform logical operations
To store program instructions
26. In a two-level memory hierarchy, the access time of the memory is 12 nanoseconds and the access time of the main memory is 1.5 microseconds. The hit ratio is 0.98. What is the average access time of the two-level memory system?
13.5n sec
42n sec
7.56n sec
76n sec
27. Consider the following organization of main memory and cache memory. Main memory: 64k ×16 Cache memory: 256 × 16 Memory is word addressable and block size of 8 words. Determine the size of tag field if the direct mapping is used for transforming data from main memory to cache memory.
5 bits
6 bits
7 bits
8 bits
28. A computer system has 4k – word cache organized in a block – set-associative manner, with 4 blocks per set, 64 words per block, memory is word addressable. The number of bits in the SET and WORD fields of the main memory address format is
15, 4
6, 4
7, 6
4, 6
29. Booth's coding in 8 bits for the decimal number −57 is:
0 – 100 + 1000
0 – 100 + 100 – 1
0 – 1 + 100 – 10 + 1
00 – 10 + 100 – 1
30. What is the equivalent decimal representation for the following radix representation? (34.44)₈
(22.56)₁₀
(32.56)₁₀
(28.5625)₁₀
(38.5625)₁₀
31. Find x & y values if the following equality is valid. ( X567 )₈ + ( 2YX5 )₈ = ( 71YX )₈
43
34
45
54
32. How many digits are required to represent 126 bit binary number in decimal?
32 bits
36 bits
42 bits
46 bits
33. Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?
11100111
11100100
11010111
11011011
34. What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding? (113.+−111.)+7.51 113.+(−111.+7.51)
9.51 and 10.0 respectively
10.0 and 9.51 respectively
9.51 and 9.51 respectively
10.0 and 10.0 respectively
35. (1217)₈ is equivalent to
(1217)₁₆
(028F)₁₆
2297)₁₀
(0B17)₁₆
36. P is a 16 – bit signed integer. The 2’s complement representation of P is (F87B)₁₆. The 2’s complement representation of 8 * p is
(C3D8)₁₆
(187B)₁₆
(F878)₁₆
(987B)₁₆
37. Find the radix 5 representation for the following decimal representation: (39)₁₀ = ( ) ₅
(134)₅
(124)₅
(114)₅
(144)₅
38. Find the value of radix r, with the following equality is matached. √(21)ᵣ = (11)ᵣ
8
7
10
>2
39. How many bits are needed to represent 20 digit decimal number in binary?
62bits
60 bits
64bits
66 bits
40. Consider the following subtraction and Identify the correct answer. (C012.25)₄ – (10111001110.101)₈
(135103.412)₈
(564411.412)₈
(564411.205)₈
(135103.205)₈
41. Let A = 11111010 and B = 00001010 be two 8 – bit 2's complement numbers. Their product in 2's complement is
11000100
10011100
10100101
11010101
42. The range of integers that can be represented by an n – bit 2's complement number system is
– 2ⁿ⁻¹ to (2ⁿ⁻¹ -1)
– (2ⁿ⁻¹ -1) to (2ⁿ⁻¹ -1)
– 2ⁿ⁻¹ to 2ⁿ⁻¹
– (2ⁿ⁻¹ +1) to (2ⁿ⁻¹ -1)
43. The switching expression corresponding to f(A, B,C, D) = Σ (1, 4, 5, 9, 11,12) is
BC'D' + A'C'D + AB'D
ABC' + ACD + B'C'D
ACD' + A'BC' + AC'D
A'BD + ACD' + BCD'
44. What is the maximum number of different Boolean functions involving n boolean variables?
n²
2ⁿ
2²ⁿ
2n²
45. How many Boolean functions are possible with 2 trinary variables?
256
512
1024
128
46. How many minimum 2-input nor gates are needed to realize A+BC?
2
3
4
5
47. Which of the following statement is true regarding ‘HAZARD’?
A digital circuit exhibits temporary mal-function. If the i/p’s are having un-even propagation delays.
The permanent mal-function is due to the open circuit (or) short circuit of connection lead to the orbit
The Hazard can be struck at 0 (or) 1
All
48. The min term expansion of f(P,Q,R) = PQ + QR̅ + PR̅ is
m₂+m₄+m₆+m₁
m₀+m₁+m₃+m₅
m₀+m₁+m₆+m₁
m₂+m₃+m₄+m₅
49. How many Boolean functions are possible with 3 Boolean variables such that the number of min terms are either one or two?
18
8
26
36
50. Which of the following statement is FALSE regarding functionally completeness, (FC).
A Boolean function is said to be FC if it realizes all the basic operations (AND, OR, NOT)
A function can be FC if it reduces to another function i.e.., already known as FC
All the universal operations are FC
All the universal operations are FC
51. Which of the following is the minimization expression for A+A'B+A'B'C+A'B'C'D?
ABCD
A+B) (C+D)
A+B+C+D
1
52. Consider a hypothetical k-map in which essential prime implicants covering all the min – terms except two. Each of the left over min – term is covered by 3 different redundant prime implicants. What would be the no of minimal expressions denoted by the map?
3
8
9
16
53. The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (x y + x z) is 4. What are the minimum possible literal counts of the product – of – sum and sum – of – product representations respectively of the function given by the following karnaugh map? Here, x denotes “don’t care”.
(11,9)
(9,13)
(9,10)
(11,11)
54. What are the essential prime implicants of the following Boolean functions? F (a, b, c) = a'c + ac' + b'c
a'c and ac'
a'c and b'c
a'c only
ac' and b'c
55. A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, what is the overall propagation delay of the adder? Assume that the carry network has been implemented using two-level AND-OR logic.
4 time units
6 time units
10 time units
12 time units
Submit