1) Consider an undirected random graph of eight vertices. The probability that thereis an edge between a pair of vertices is ½. What is the expected number ofunordered cycles of length three?(A) 1/8 (B) 1 (C) 7 (D) 8 Ans—C

2) Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even.(A) P only (B) Q only (C) Both P and Q (D) Neither P nor Q Ans—C

3) Which of the following statements are TRUE?(1) The problem of determining whether there exists a cycle in an undirectedgraph is in P.(2) The problem of determining whether there exists a cycle in an undirectedgraph is in NP.(3) If a problem A is NP-Complete, there exists a non-deterministic polynomialtime algorithm to solve A.(A) 1,2 and 3 (B) 1 and 2 only (C) 2 and 3 only (D) 1 and 3 only Ans—A

4) An index is clustered, if(A) it is on a set of fields that form a candidate key.(B) it is on a set of fields that include the primary key.(C) the data records of the file are organized in the same order as the dataentries of the index.(D) the data records of the file are organized not in the same order as the dataentries of the index. Ans—C

5) Assume that source S and destination D are connected through two intermediaterouters labeled R. Determine how many times each packet has to visit thenetwork layer and the data link layer during a transmission from S to D.(A) Network layer – 4 times and Data link layer-4 times(B) Network layer – 4 times and Data link layer-3 times(C) Network layer – 4 times and Data link layer-6 times(D) Network layer – 2 times and Data link layer-6 timesS R R D Ans—C

6) The transport layer protocols used for real time multimedia, file transfer, DNSand email, respectively are(A) TCP, UDP, UDP and TCP (B) UDP, TCP, TCP and UDP(C) UDP, TCP, UDP and TCP (D) TCP, UDP, TCP and UDP Ans—c

7) Match the problem domains in Group I with the solution technologies in GroupII.Group I Group II(p) Services oriented computing (1) Interoperability(q) Heterogeneous communicating systems (2) BPMN(R) Information representation (3) Publish-find bind(S) Process description (4) XML(A) P – 1, Q – 2, R – 3, S – 4 (B) P – 3, Q – 4, R – 2, S – 1(C) P – 3, Q – 1, R – 4, S – 2 (D) P – 4, Q – 3, R – 2, S – 1 Ans—C

8) A scheduling algorithm assigns priority proportional to the waiting time of aprocess. Every process starts with priority zero(the lowest priority). Thescheduler re-evaluates the process priorities every T time units and decides thenext process to schedule. Which one of the following is TRUE if the processes

have no I/O operations and all arrive at time zero?(A) This algorithm is equivalent to the first-come-first-serve algorithm.(B) This algorithm is equivalent to the round-robin algorithm.(C) This algorithm is equivalent to the shortest-job-first algorithm.(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm. Ans—B

9) Which one of the following is the tightest upper bound that represents the timecomplexity of inserting an object into a binary search tree of n nodes?(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n) Ans—c

10) In the following truth table, V = 1 if and only if the input is valid.Inputs OutputsD0 D1 D2 D3 X0 X1 V0 0 0 0 X X 01 0 0 0 0 0 10 1 0 0 1 11 X 1 0 0 1X X X 1 1 1 1

What function does the truth table represent?(A) Priority encoder (B) Decoder(C) Multiplexer (D) Demultiplexer Ans—A

11) A binary operation on a set of integers is defined as 2 2 x y x y . Which oneof the following statements is TRUE about?(A) Commutative but not associative (B) Both commutative and associative(C) Associative but not commutative (D) Neither commutative nor associative Ans—A

12) The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23,39, 35, 42. Which one of the following is the postorder traversal sequence of thesame tree?(A) 10,20,15,23,25,35,42,39,30 (B) 15,10,25,23,20,42,35,39,30(C) 15,20,10,23,25,42,35,39,30 (D) 15,10,23,25,20,35,42,39,30 Ans—D

13) In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of totallength is 400 and the fragment offset value is 300. The position of the datagram,the sequence numbers of the first and the last bytes of the payload, respectivelyare(A) Last fragment, 2400 and 2789 (B) First fragment, 2400 and 2759(C) Last fragment, 2400 and 2759 (D) Middle fragment, 300 and 689 Ans—C

14) Complete the sentence:Universalism is to particularism as diffuseness is to ________(A) specificity (B) neutrality (C) generality (D) adaptation Ans—A

15) Choose the grammatically INCORRECT sentence:(A) He is of Asian origin(B) They belonged to Africa(C) She is an European(D) They migrated from India to Australia Ans—C

16) Out of all the 2-digit integers between 1 and 100, a 2-digit number has to beselected at random. What is the probability that the selected number is notdivisible by 7?(A) 13/90 (B) 12/90 (C) 78/90 (D) 77/90 Ans—D

17) A tourist covers half of his journey by train at 60 km/h, half of the remainder bybus at 30 km/h and the rest by cycle at 10 km/h. The average of the tourist inkm/h during his entire journey is(A) 36 (B) 30 (C) 24 (D) 18 Ans—C

18)

19)

20)

21)

22)

23)

24)

25)

26)

27)

28)

29)

30)

31)

32)

33)

34)

35)

36)

37)

38)

39)

40)

41)

42)

43)

44)

45)

46)

47)

48)

49)

50)

51)

52)

53)

54)

55)

56)

57)

58)

59)

60)

61)

62)

63)

64)

65)

66)

67)

68)

69)

70)

71)

72)

73)

74)

75)

76)

77)

78)

79)

80)

81)

82)

83)

84)

85)

86)

87)

88)

89)

90)

91)

92)

93)

94)

95)

96)

97)

98)

99)

100)

101)

102)

103)

104)

105)

106)

107)

108)

109)

110)

111)

112)

113)

114)

115)

116)

117)

118)

119)

120)

121)

122)

123)

124)

125)

126)

127)

128)

129)

130)

131)

132)

133)

134)

135)

136)

137)

138)

139)

140)

141)

142)

143)

144)

145)

146)

147)

148)

149)

150)