UGC NET Computer Science Paper III Re-test September 2013 - Part 4

31.       Which of the following electronic component is not found in IC’s?
(A) Diode
(B) Resistor
(C) Transistor
(D) Inductor
Answer: D
32.       A given memory chip has 14 address pins and 8 data pins. It has the following number of locations.
(A) 28
(B) 214
(C) 26
(D) 212
Answer: B
33.       The instruction: MOV CL, [BX] [DI] + 8 represents the ............... addressing mode.
(A) Based Relative
(B) Based Indexed
(C) Indexed Relative
(D) Register Indexed
Answer: B
34.       The power dissipation of a flip-flop is 3 mW. The power dissipation of a digital system with 4 flip-flops is given by
(A) 34 mW
(B) 43 mW
(C) 4/3 mW
(D) 12 mW
Answer: D
35.       An astable multivibrator using the 555 timer to generate a square wave of 5 KHz with 70% duty cycle will have
(A) RA = 40.4 KΩ, RB = 17.25 KΩ,
C = 2000 pF
(B) RA = 17.25 KΩ, RB = 40.4 KΩ,
C = 2000 pF
(C) RA = 40.4 KΩ, RB = 17.25 KΩ,
C = 5000 pF
(D) RA = 17.25 KΩ, RB = 40.4 KΩ,
C = 5000 pF
Answer: Marks given to all

36.       A binary ripple counter is required to count up to 16383. How many flip-flops are required?
(A) 16382
(B) 8191
(C) 512
(D) 14
Answer: D
37.       The time complexity of recurrence relation
T(n) = T(n/3) + T(2n/3) + O(n) is
(A) O(Ig n)
(B) O(n)
(C) O(n Ig n)
(D) O(n2 )
Answer: C
38.       How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year?
(A) At least 23
(B) At least 183
(C) At least 366
(D) At least 730
Answer: A
39.       The number of possible parenthesizations of a sequence of n matrices is
(A) O(n)
(B) θ(n Ig n)
(C) Ω(2n)
(D) None of the above
Answer: C
40.    The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
(A) O(n)
(B) O(n Ig n)
(C) O(n2)
(D) None of the above
Answer: B


Post a Comment

0 Comments