adplus-dvertising

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.

frame-decoration

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 19 of 20

Explore more Topics under GATE CSE Exam

Q181.
How many Boolean functions are possible with 3 Boolean variables such that the number of min terms are either one or two?

a.

18

b.

8

c.

26

d.

36

Discuss
Answer: (d).36
Q182.
Which of the following statement is FALSE regarding functionally completeness, (FC).

a.

A Boolean function is said to be FC if it realizes all the basic operations (AND, OR, NOT)

b.

A function can be FC if it reduces to another function i.e.., already known as FC

c.

All the universal operations are FC

d.

None of the above

Discuss
Answer: (d).None of the above
Q183.
Which of the following is the minimization expression for A+A'B+A'B'C+A'B'C'D?

a.

ABCD

b.

A+B) (C+D)

c.

A+B+C+D

d.

1

Discuss
Answer: (c).A+B+C+D
Q184.
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?

a.

3

b.

8

c.

9

d.

16

Discuss
Answer: (c).9
Q185.
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”.

a.

(11,9)

b.

(9,13)

c.

(9,10)

d.

(11,11)

Discuss
Answer: (c).(9,10)
Q186.
What are the essential prime implicants of the following Boolean functions?

F (a, b, c) = a'c + ac' + b'c

a.

a'c and ac'

b.

a'c and b'c

c.

a'c only

d.

ac' and b'c

Discuss
Answer: (a).a'c and ac'
Q187.
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.

a.

4 time units

b.

6 time units

c.

10 time units

d.

12 time units

Discuss
Answer: (b).6 time units
Q188.
Consider a Boolean function f(w,x,y,z). Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors i₁=⟨w₁,x₁,y₁,z₁⟩ and i₂=⟨w₂,x₂,y₂,z₂⟩ , we would like the function to remain true as the input changes from i₁ to i₂ (i₁ and i₂ differ in exactly one bit position) without becoming false momentarily. Let f(w,x,y,z)=∑(5,7,11,12,13,15) . Which of the following cube covers of f will ensure that the required property is satisfied?

a.

w’xz, wxy’, xy’z, wyz

b.

wxy, w’xz, wyz

c.

wxy’z’, xz, wx’yz

d.

wxy’,wyz,wxz,w’xz,xy’z,xyz

Discuss
Answer: (d).wxy’,wyz,wxz,w’xz,xy’z,xyz
Q189.
Define the connective * for the Boolean variable X and Y as :

X * Y = XY + X'Y'.

Let Z = X * Z.Consider the following expression P, Q and R.
P : X = Y * Z
q : Y = X * Z
R : X * Y * Z = 1

Which of the following is true?

a.

Only P and Q are valid.

b.

Only Q and R are valid.

c.

Only P and R are valid.

d.

All P, Q, R are valid.

Discuss
Answer: (d).All P, Q, R are valid.
Q190.
If P,Q,R are boolean variables, then (P+Q’)(PQ’+PR)(P’R’+Q’) simplifies to

a.

PQ’

b.

PR’

c.

PQ’ + R

d.

PR’ + Q

Discuss
Answer: (a).PQ’
Page 19 of 20

Suggested Topics

Are you eager to expand your knowledge beyond Computer Architecture? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...