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 UGC CBSE NET 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 UGC CBSE NET 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 UGC CBSE NET 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 14 of 16

Q131.
IC 74 LS 138 is a:
Discuss
Answer: (b).Decoder
Q132.
A hardware interface that allows for the connection of several peripheral devices to a single PCI board
Discuss
Answer: (a).SCSI
Q133.
Simplified form of the Boolean expression Y=A’BC’D’+ABC’D’+A’BCD’+ABCD’ is:
Discuss
Answer: (c). BD’
Q134.
Which of the following statements are true?

(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.
(ii) Boolean expressions and logic networks correspond to labelled acyclic diagraphs.
(iii) No two Boolean algebras with n atoms are isomorphic.
(iv) Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.
Discuss
Answer: (c).i and ii only
Q135.
In computers, subtraction is generally carried out by
Discuss
Answer: (d).2’s complement
Q136.
Consider the following boolean equations:

(i) wx + w(x+y) + x(x+y) = x + wy
(ii) (wx’(y+xz’) + w’x’)y = x’y

What can you say about the above equations?
Discuss
Answer: (c).Both (i) and (ii) are true
Q137.
Consider the graph shown below. Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is
Discuss
Answer: (b).16
Q138.
Consider the following statements:

(i) Auto increment addressing mode is useful in creating self-relocating code.
(ii) If auto increment addressing mode is included in an instruction set architecture, then an additional ALU is required for effective address calculation.
(iii) In auto incrementing addressing mode, the amount of increment depends on the size of the data item accessed.
Which of the above statements is/are true?
Discuss
Answer: (d).(ii) only
Q139.
A computer uses a memory unit with 256 K words of 32 bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code and a register code part to specify one of 64 registers and an address part. How many bits are there in the operation code, the register code part and the address part?
Discuss
Answer: (a).7,6,18
Q140.
Consider the following x86 – assembly language instructions:

MOV AL, 153
NEG AL

The contents of the destination register AL (in 8-bit binary notation), the status of Carry Flag (CF) and Sign Flag (SF) after the execution of above instructions, are
Discuss
Answer: (d).AL = 0110 0111; CF = 1;SF = 0

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!