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.

81. A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles.
a. n-2, n-1
b. n-3, n-2
c. n-1, n
d. n-2, n-2
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).n-3, n-2

82. Implicit return type of a class constructor is:
a. not of class type itself
b. class type itself
c. a destructor of class type
d. a destructor not of class type
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).class type itself

83. It is possible to define a class within a class termed as nested class. There are ............ types of nested classes.
a. 2
b. 3
c. 4
d. 5
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).4

84. Which of the following statements is correct?
a. Aggregation is a strong type of association between two classes with full ownership.
b. Aggregation is a strong type of association between two classes with partial ownership.
c. Aggregation is a weak type of association between two classes with partial ownership.
d. Aggregation is a weak type of association between two classes with full ownership.
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Aggregation is a weak type of association between two classes with partial ownership.

85. Which of the following statements is correct?
a. Every class containing abstract method must not be declared abstract.
b. Abstract class cannot be directly initiated with ‘new’ operator.
c. Abstract class cannot be directly initiated with ‘new’ operator.
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Abstract class cannot be directly initiated with ‘new’ operator.

86. When one object reference variable is assigned to another object reference variable then
a. a copy of the object is created
b. a copy of the reference is created
c. a copy of the reference is not created
d. it is illegal to assign one object reference variable to another object reference variable
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).a copy of the reference is created

87. Which of the following statement(s) is/are false?

(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.
(c) A complete graph (Kn) has a Hamilton Circuit whenever n≥3
(d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
a. (a) only
b. (b) and (c)
c. (c) only
d. (d) only
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).(d) only

88. A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?
graceful tree
a. (a) and (b)
b. (b) and (c)
c. (a) and (c)
d. (a), (b) and (c)
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).(a), (b) and (c)

89. Consider the following two statements:

(a) A publicly derived class is a subtype of its base class.
(b) Inheritance provides for code reuse.

Which of the above statements is correct?
a. Both the statements (a) and (b) are correct
b. Neither of the statements (a) and (b) are correct
c. Statement (a) is correct and (b) is incorrect
d. Statement (a) is incorrect and (b) is correct
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Both the statements (a) and (b) are correct

90. In general, in a recursive and non-recursive implementation of a problem (program):
a. Both time and space complexities are better in recursive than in non-recursive program
b. Both time and space complexities are better in non-recursive than in recursive program
c. Time complexity is better in recursive version but space complexity is better in non-recursive version of the program
d. Space complexity is better in recursive version but time complexity is better in non-recursive version of the program
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Both time and space complexities are better in non-recursive than in recursive program