1
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
Answer: Option [A]
Questions
2
The pure object oriented programming language with extensive metadata available and modifiable at run time is
Answer: Option [B]
3
The syntax of capturing events method for document object is
Answer: Option [D]
4
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.
Answer: Option [A]
5
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.
Answer: Option [B]
6
Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is
Answer: Option [B]
7
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?
Answer: Option [B]
8
The given maximization assignment problem can be converted into a minimization problem by
Answer: Option [B]
9
Given the following equalities : E1 : nK+∈ + nK lg n = θ(nK+∈) for all fixed K and ∈, K > 0 and ∈ > 0. E2 : n32n + 6n23n = O(n32n) Which of the following is true ?
Answer: Option [B]
10
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 =
Answer: Option [B]
11
The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively)
Answer: Option [A]
12
The solution of the recurrence relation of T(n) = 3T floor n 4 + n is
Answer: Option [B]
13
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
Answer: Option [D]
14
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 ∈ A
=
∑x
x ∈
– A
Which of the following is true ?
Answer: Option [A]
15
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.
Answer: Option [B]
16
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 ?
Answer: Option [B]
17
Which of the following is used in the options field of IPv4 ?
Answer: Option [B]
18
Which layers of the OSI reference model are host-to-host layers ?
Answer: Option [B]
19
A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle ?
Answer: Option [B]
20
Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?
Answer: Option [B]
