A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

71. Which of the following is/are not true?

(a) The set of negative integers is countable.
(b) The set of integers that are multiples of 7 is countable.
(c) The set of even integers is countable.
(d) The set of real numbers between 0 and 1/2 is countable.
a. (a) and (c)
b. (b) and (d)
c. (b) only
d. (d) only
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).(d) only

72. Consider the graph given below. The two distinct sets of vertices, which make the graph bipartite are:
bipartite graph
a. (v1, v4, v6); (v2, v3, v5, v7, v8)
b. (v1, v7, v8); (v2, v3, v5, v6)
c. (v1, v4, v6, v7); (v2, v3, v5, v8)
d. (v1, v4, v6, v7, v8); (v2, v3, v5)
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).(v1, v4, v6, v7); (v2, v3, v5, v8)

73. A data cube C, has n dimensions, and each dimension has exactly p distinct values in the base cuboid. Assume that there are no concept hierarchies associated with the dimensions. What is the maximum number of cells possible in the data cube, C?
a. p^n
b. p
c. (2^n-1)p+1
d. (p+1)^n
View Answer Report Discuss Too Difficult!
Answer: (d).(p+1)^n

74. Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of persons having meningitis is 1/50000, and that the proportion of people having stiff neck is 1/20. Then the percentage of people who had meningitis and complain about stiff neck is:
a. 0.01%
b. 0.02%
c. 0.04%
d. 0.05%
View Answer Report Discuss Too Difficult!
Answer: (b).0.02%

75. How many solutions are there for the equation x+y+z+u=29 subject to the constraints that x≥1, y≥2, z≥3 and u≥0?
a. 4960
b. 2600
c. 23751
d. 8855
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).2600

76. Given two sequences X and Y:

X = < a, b, c, b, d, a, b >
Y = < b, d, c, a, b, a >

The longest common subsequence of X and Y is:
a. < b, c, a >
b. < c, a, b >
c. < b, c, a, a >
d. < b, c, b, a >
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).< b, c, b, a >

77. If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in:
a. O(d n k)
b. O(d n^k)
c. O((d+n)k)
d. O(d(n+k))
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).O(d(n+k))

78. The solution of the following recurrence relation is:
recurrence relation
a. O(lg n)
b. O(n)
c. O(n lg n)
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).None of the above

79. A bell-shaped membership function is specified by three parameters (a, b, c) as follows:
bell-shaped membership function
a. A
b. B
c. C
d. D
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).B

80. Consider the given graph given below. Its Minimum Cost Spanning Tree is ..................
Minimum Cost Spanning Tree
Minimum Cost Spanning Tree
a. A
b. B
c. C
d. D
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).B

Page 8 of 14