Welcome to the Computer Architecture MCQs Page

Dive deep into the fascinating world of Computer Architecture with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Computer Architecture, a crucial aspect of GATE CSE Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Computer Architecture, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within GATE CSE Exam.

Check out the MCQs below to embark on an enriching journey through Computer Architecture. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Computer Architecture. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Computer Architecture MCQs | Page 3 of 20

Explore more Topics under GATE CSE Exam

01

Networking

02

Operating System

03

Data Structures and Algorithms

04

DBMS

05

Compiler Design

06

Theory of Computation(TOC)

07

Engineering Mathematics

Q21.

A circuit outputs a digit in the form of 4 bits. 0 is represented by 0000, 1 by 0001, ..., 9 by 1001. A combinational circuit is to be designed which takes these 4 bits as input and outputs 1 if the digit ≥ 5, and 0 otherwise. If only AND, OR and NOT gates may be used, what is the minimum number of gates required?

Discuss

Answer: (b).3

Q22.

Which are the essential prime implicants of the following Boolean function? f(a, b, c) = a'c + ac' + b'c

a'c and ac'

a'c and b'c

a'c only

ac' and bc'

Discuss

Answer: (a).a'c and ac'

Q23.

Consider a multiplexer with X and Y as data inputs and Z as control input. Z = 0 selects input X, and Z = 1 selects input Y. What are the connections required to realize the 2-variable Boolean function f = T + R, without using any additional hardware ?

R to X, 1 to Y, T to Z

T to X, R to Y, T to Z

T to X, R to Y, 0 to Z

R to X, 0 to Y, T to Z

Discuss

Answer: (a).R to X, 1 to Y, T to Z

Q24.

A 4-bit carry lookahead 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

Discuss

Answer: (a).4 time units

Q25.

Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is

Θ(1)

Θ(log n)

Θ(n)

Θ(n^2)

Discuss

Answer: (c).Θ(n)

Q26.

A 1-input, 2-output synchronous sequential circuit behaves as follows : Let zk, nk denote the number of 0's and 1's respectively in initial k bits of the input (zk + nk = k). The circuit outputs 00 until one of the following conditions holds.

zk - nk = 2. In this case, the output at the k-th and
all subsequent clock ticks is 10.
nk - zk = 2. In this case, the output at the k-th and
all subsequent clock ticks is 01.

What is the minimum number of states required in the state transition graph of the above circuit?

Discuss

Answer: (a).5

Q27.

Let f(A, B) = A' + B. Simplified expression for function f(f(x + y, y)z) is :

x' + z

xyz

xy' + z

None of these

Discuss

Answer: (c).xy' + z

Q28.

Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is:

0, 1, 3, 7, 15, 14, 12, 8, 0

0, 1, 3, 5, 7, 9, 11, 13, 15, 0

0, 2, 4, 6, 8, 10, 12, 14, 0

0, 8, 12, 14, 15, 7, 3, 1, 0

Discuss

Answer: (d).0, 8, 12, 14, 15, 7, 3, 1, 0

Q29.

A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flipflop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J = K = 1 is the toggle mode and J = K = 0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.

0110110...

0100100...

011101110...

011001100...

Discuss

Answer: (a).0110110...

Q30.

Consider the operations f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X′, Y, Z) = X′YZ + X′YZ′ + XY. Which one of the following is correct?

Both {f} and {g} are functionally complete

Only {f} is functionally complete

Only {g} is functionally complete

Neither {f} nor {g} is functionally complete

Discuss

Answer: (b).Only {f} is functionally complete

Page 3 of 20

Welcome to the Computer Architecture MCQs Page

Computer Architecture MCQs | Page 3 of 20

Explore more Topics under GATE CSE Exam

Networking

Operating System

Data Structures and Algorithms

DBMS

Compiler Design

Theory of Computation(TOC)

Engineering Mathematics

Suggested Topics

Digital Image Processing (DIP)

Computer Hardware

DBMS

Systems Programming

Data Warehousing and OLAP

Management Information Systems

Computer Graphics

Data Structures and Algorithms

Systems Analysis and Design Methods