36. Which of the following statements is not true about disk-arm scheduling algorithms ?
(A) SSTF (shortest seek time first) algorithm increases performance of FCFS.
(B) The number of requests for disk service are not influenced by file allocation method.
(C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements.
(D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.
37. _________ maintains the list of free disk blocks in the Unix file system.
(A) I-node
(B) Boot block
(C) Super block
(D) File allocation table
38. A part of Windows 2000 operating system that is not portable is
(A) Device Management
(B) Virtual Memory Management
(C) Processor Management
(D) User Interface
39. Match the following with reference to Unix shell scripts :
List – I List – II
a. $? i. File name of the current script
b. $# ii. List of arguments
c. $0 iii. The number of arguments
d. $* iv. Exit status of last command
Codes :
a b c d
(A) iii ii i iv
(B) ii iii i iv
(C) iv iii i ii
(D) i iii i iv
40. The advantage of _______ is that it can reference memory without paying the price of having a full memory address in the instruction.
(A) Direct addressing
(B) Indexed addressing
(C) Register addressing
(D) Register Indirect addressing
41. The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G)
(A) A B + C * D + EF + G + /
(B) A B + C D * + E F + G + /
(C) A B + C * D + E F G + +/
(D) A B + C * D + E + F G + /
42. The output of a sequential circuit depends on
(A) present input only
(B) past input only
(C) both present and past input
(D) past output only
43. A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction involving 3 operands and one operator needs a maximum of
(A) 3m bits
(B) m + n bits
(C) 3m + n bits
(D) 3m + n + 30 bits
44. Which of the following flip-flops is free from race condition ?
(A) T flip-flop
(B) SR flip-flop
(C) Master-slave JK flip-flop
(D) None of the above
45. One of the main features that distinguish microprocessor from micro-computers is
(A) words are usually larger in microprocessors.
(B) words are shorter in microprocessors.
(C) microprocessor does not contain I/O devices.
(D) None of the above.
46. The output generated by the LINUX command :
$ seq 1 2 10 will be
(A) 1 2 10
(B) 1 2 3 4 5 6 7 8 9 10
(C) 1 3 5 7 9
(D) 1 5 10
47. All the classes necessary for windows programming are available in the module :
(A) win.txt (B) win.main
(C) win.std (D) MFC
48. Windows 32 API supports
(A) 16-bit Windows
(B) 32-bit Windows
(C) 64-bit Windows
(D) All of the above
49. Superficially the term “objectoriented”, means that, we organize software as a
(A) collection of continuous objects that incorporates both data structure and behaviour.
(B) collection of discrete objects that incorporates both discrete structure and behaviour.
(C) collection of discrete objects that incorporates both data structure and behaviour.
(D) collection of objects that incorporates both discrete data structure and behaviour.
50. The “part-whole”, or “a-part-of”, relationship in which objects representing the components of something associated with an object representing the entire assembly is called as
(A) Association
(B) Aggregation
(C) Encapsulation
(D) Generalisation
51. The pure object oriented programming language with extensive metadata available and modifiable at run time is
(A) Small talk (B) C++
(C) Java (D) Eiffel
52. Match the following interfaces of Java. Servlet package :
List – I List – II
a. Servlet Config i. Enables Servlets to log events
b. Servlet Context ii. Read data from a client
c. Servlet Request iii. Write data to a client
d. Servlet Response iv. To get initialization parameters
Codes :
a b c d
(A) iii iv ii i
(B) iii ii iv i
(C) ii iii iv i
(D) iv i ii iii
53. The syntax of capturing events method for document object is
(A) CaptureEvents()
(B) CaptureEvents(Orgs eventType)
(C) CaptureEvents(eventType)
(D) CaptureEvents(eventVal)
54. Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the ________ attribute and the second with the _________ attribute.
(A) NAME & LINK
(B) LINK & HREF
(C) HREF & NAME
(D) TARGET & VALUE
55. Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires _______ of storage space if the image is not compressed.
(A) one Terabyte
(B) one Megabyte
(C) 8 Megabytes
(D) 8 Terabytes
56. Match the following cryptographic algorithms with their design issues :
List – I List – II
a. DES i. Message Digest
b. AES ii. Public Key
c. RSA iii. 56-bit key
d. SHA-1 iv. 128-bit key
Codes :
a b c d
(A) ii i iv iii
(B) iii i iv ii
(C) iii iv ii i
(D) iv i ii iii
57. Consider a code with five valid code words of length ten :
0000000000, 0000011111, 1111100000, 1110000011, 1111111111
Hamming distance of the code is
(A) 5 (B) 10
(C) 8 (D) 9
58. Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?
(A) Alternate optimality
(B) Infeasibility
(C) Unboundedness
(D) All of the above
59. The given maximization assignment problem can be converted into a minimization problem by
(A) subtracting each entry in a column from the maximum value in that column.
(B) subtracting each entry in the table from the maximum value in that table.
(C) adding each entry in a column from the maximum value in that column.
(D) adding maximum value of the table to each entry in the table.
60. The initial basic feasible solution of the following transportation problem :
Ans: A
61. Given the following equalities :
E1 : nK+є + nK lg n = Ө(nK+є ) for all fixed K and ∈, K ≥ 0 and ∈ > 0.
Which of the following is true ?
(A) E1 is correct and E2 is correct.
(B) E1 is correct and E2 is not correct.
(C) E1 is not correct and E2 is correct.
(D) E1 is not correct and E2 is not correct.
62. Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively)
(A) 40 (B) 38
(C) 32 (D) 30
63. The solution of the recurrence relation of T(n) = 3T ( floor (n/4)) + n is
(A) O(n2) (B) O(nlg n)
(C) O(n) (D) O(l g n)
64. If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is
(A) less than 1
(B) less than lg n
(C) greater than 1
(D) greater than lg n
65. Given the following statements :
S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2.
S2 : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A and A’ = S – A such that
∑x = ∑x
x ∈A x ∈A’
Which of the following is true ?
(A) S1 is NP problem and S2 is P problem.
(B) S1 is NP problem and S2 is NP problem.
(C) S1 is P problem and S2 is P problem.
(D) S1 is P problem and S2 is NP problem.
66. Suppose that the splits at every level of quicksort are in the proportion (1 – α ) to a, where 0 < α ≤ ½ is a constant. The minimum depth of a leaf in the recursion tree is approximately given by
(A) – lgn / lg(1 – α)
(B) – lg (1 – α) / lgn
(C) – lgn / lgα
(D) – lgα / lgn
67. Ten signals, each requiring 3000 Hz, are multiplexed on to a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel ? Assume that the guard bands are 300 Hz wide.
(A) 30,000
(B) 32,700
(C) 33,000
(D) None of the above
68. A terminal multiplexer has six 1200 bps terminals and ‘n’ 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ?
(A) 4 (B) 8
(C) 16 (D) 28
69. Which of the following is used in the options field of IPv4 ?
(A) Strict source routing
(B) Loose source routing
(C) time stamp
(D) All of the above
70. Which layers of the OSI reference model are host-to-host layers ?
(A) Transport, Session, Presentation, Application
(B) Network, Transport, Session, Presentation
(C) Data-link, Network, Transport, Session
(D) Physical, Data-link, Network, Transport
71. A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle ?
(A) 1024 (B) 2048
(C) 4096 (D) 8192
72. Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?
(A) 4 (B) 8
(C) 15 (D) 16
73. Given the following two grammars :
G1 : S —> AB | aaB
A —> a | Aa
B —> b
G2 : S —> a S b S | b S a S | λ
Which statement is correct ?
(A) G1 is unambiguous and G2 is unambiguous.
(B) G1 is unambiguous and G2 is ambiguous.
(C) G1 is ambiguous and G2 is unambiguous.
(D) G1 is ambiguous and G2 is ambiguous.
74. Match the following :
List – I List – II
a. Chomsky Normal form i. S —> b S S | a S | c
b. Greibach Normal form ii. S —> a S b | ab
c. S-grammar iii. S —> AS | a A —> SA | b
d. LL grammar iv. S —> a B S B B —> b
Codes :
a b c d
(A) iv iii i ii
(B) iv iii ii i
(C) iii iv i ii
(D) iii iv ii i
75. Given the following two languages :
L1 = {anbn | n ≥ 1} ∪ {a}
L2 = {w C wR | w ∈{a, b}*}
Which statement is correct ?
(A) Both L1 and L2 are not deterministic.
(B) L1 is not deterministic and L2 is deterministic.
(C) L1 is deterministic and L2 is not deterministic.
(D) Both L1 and L2 are deterministic.