DOEACC Society 2006 DOEACC C Level Computer Organization ( ) - Question Paper

C1-R3: COMPUTER ORGANIZATION
NOTE:
1. There are 2 PARTS in this Module/Paper. PART 1 contains FOUR
ques. and PART 2 contains 5 ques..
2. PART 1 is to be answered in the TEAR-OFF ans SHEET only, attached
to the ques. paper, as per the instructions contained therein. PART 1 is
NOT to be answered in the ans book.
3. Maximum time allotted for PART 1 is 1 HOUR. ans book for PART
TWO will be supplied at the table when the ans sheet for PART 1 is
returned. However, candidates, who complete PART 1 earlier than 1 hour,
can collect the ans book for PART 2 immediately after handing over the
ans sheet for PART ONE.
TOTAL TIME: three HOURS TOTAL MARKS: 100
(PART 1 – 40; PART 2 – 60)
PART ONE
(Answer all the questions)
1. every ques. beneath provide a multiple option of answers. select the most
improper 1 and enter in the “tear-off” ans sheet attached to the ques.
paper, subsequent instructions therein. (1 x 10)
1.1 ‘Cycle Stealing’ is associated with
A) Data transfer among registers
B) DMA
C) Pipelining
D) Microprogramming
1.2 The largest integer that can be represented in signed-2’s complement representation
using n bits is
A) 2n-1
B) 2n
C) 2n-1 - 1
D) 2n - 1
1.3 Using an additional NOT gate, a JK flip-flop can be converted into
A) T flip-flop
B) RS flip-flop
C) Master Slave flip-flop
D) D flip-flop
1.4 A microprocessor has a data bus with 64 lines and an address bus with 32 lines. The
maximum number of bits that can be stored in this memory is
A) 32 x 232
B) 32 x 264
C) 64 x 232
C1-R3 Page one of five January, 2006
D) 64 x 264
C1-R3 Page two of five January, 2006
1.5 The expression ‘delayed load’ is used in situation of
A) Processor-printer communication
B) Memory-monitor communication
C) Pipelining
D) Computer Arithmetic
1.6 Break points are used for
A) stopping a program at a desired place
B) manipulating the stack
C) executing every instruction individually
D) calling a subroutine
1.7 A truth table of n variables has _______ minterms.
A) n2
B) (n – 1)2
C) 2n
D) 2n -1
1.8 Which of the subsequent shift operations divide a signed binary number by 2?
A) logical left shift
B) logical right shift
C) arithmetic left shift
D) arithmetic right shift
1.9 The condition to detect overflow during the addition of 2 binary numbers is
A) Cn XOR Cn-1
B) Cn NOR Cn-1
C) Cn OR Cn-1
D) Cn AND Cn-1
where Ci is the carry out of the ith significant bit.
1.10 Dual of a + b • c is
A) (a + b) • (a + c)

Earning:   Approval pending.