All mock tests are FREE till 31 December — register to save your progress
Paper 2 CS · UNIT 02 · MOCK TEST

Computer System Architecture — Mock Test 6

25 questions · about 30 minutes. Press End Mock any time to see your score and the correct answers.

0 / 25 answered 00:00
Q1.

Match List I with List II. List I: A. (100110011)₂, B. Complements, C. Parity bits, D. Variable-length instruction. List II: I. Error detection code; II. CISC; III. Negative number; IV. (133)₁₆.

Q2.

Which of the following are not data manipulation instructions? A. Call B. Load C. And D. Increment E. Shift

Q3.

Which of the following do not represent memory-reference instructions? A. mode = 1, opcode = 010 B. mode = 0, opcode = 111 C. mode = 1, opcode = 111 D. mode = 1, opcode = 110 E. mode = 1, opcode = 001

Figure
Q4.

Consider the number (45)ᵧ, where y is the base. Some possible values of y are: (A) 5 (B) 6 (C) 7 (D) 8

Q5.

Find the correct sequence of the storage devices in descending order based on their access time.

(A) Registers

(B) Magnetic Disk

(C) Magnetic Tapes

(D) Main memory

(E) Optical Disk

Q6.

Match List - I with List - II.

Figure
Q7.

Consider the following statements regarding combinational and sequential circuits.

(A) Output of combinational circuits depends on the only current input.

(B) Output of combinational circuit depends on the both current input and previous output.

(C) Output of sequential circuit depends on the current input.

(D) Output of sequential circuit depends on both current input and previous output.

Q8.

Match List - I with List - II.

Figure
Q9.

Arrange the given steps required for a Direct Memory Access (DMA) transfer in the correct order.

(A) Initiate DMA transfer request

(B) Transfer data directly between peripheral and memory

(C) Processor grants DMA control over the system bus

(D) DMA controller completes data transfer and signals completion

Q10.

The instruction LD ADR (X) which is equivalent to ← AC M[ADR+XR] is in :

Q11.

Match the List-I and List-II

Figure
Q12.

For making a memory of size 2048 x 8 bytes, by using the chips of size 128 x 4 bytes, the number of chips required is :

Q13.

Which of the following are sequential circuits?

A. Flip flop

B. Multiplexer

C. Counter

D. Decoder

E. Adder

Q14.

Techniques for performing I/O :

A. Programmed I/O

B. Interrupt-driven I/O

C. Rotational I/O

D. Direct memory access

E. Channelized I/O

Q15.

The interface(s) that provide(s) I/0 transfer of data directly to and from the memory unit peripheral is/are termed as:

(A) DMA (Direct Memory Access)

(B) IOP (Input-Output Processor)

(C) Serial Interface

(D) Parallel Interface

Q16.

Which of the following(s) are main memory?

(A) Virtual memory

(B) Cache memory

(C) RAM

(D) SSD

Q17.

Match List - I with List - II.

List - I List - II

(a) SZA (I) Increment M and skip it zero

(b) SKI (II) Skip if AC is negative

(c) SNA (III) Skip if input flag is on

(d) ISZ (IV) Skip if AC is Zero

Q18.

In most general case, the computer needs to process each instruction with the following sequence of steps:

(A) Calculate the effective address

(B) Execute the instruction

(C) Fetch the instruction from memory

(D) Fetch the operand from memory

(E) Decode the instruction

Q19.

What is the 4+4 bit binary fixed-point equivalent of −(3.72)₁₀?

Q20.

Let ⊕ denote XOR, and 1 and 0 the binary constants. F(P, Q) = ((1 ⊕ P) ⊕ (P ⊕ Q)) ⊕ ((P ⊕ Q) ⊕ (Q ⊕ 0)). Which of the following is equivalent to F?

Q21.

A processor chip is used for application in which 30 % of execution time is spent on floating point addition. For the new model of the processor, the design team has come up with redesign the floating point adder to make it twice as fast. What will be possible maximum speed up by this redesign?

Q22.

256 Mb DRAM is organized as a 16 K × 16 K memory externally and as a square array internally. Each row must be refreshed at least once every 50 mili second to forestall loss of data; refreshing one row takes 100 nanoseconds. What fraction of the total memory bandwidth is lost to refresh cycles?

Q23.

In 16-bit 2's Complementation representation, the decimal number 28 is

Q24.

Simplify using a K-map: F(A, B, C, D) = Σ(3, 4, 5, 6, 7, 11, 15)

Q25.

Consider a 3-bit counter designed using T flip-flops as shown (Tp = R, Tq = P′, Tr = Q′, all clocked together). If the initial state PQR is 000, what are the next three states?

Figure