adplus-dvertising
frame-decoration

Question

Which of the statements are true?

I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

a.

I, II, III

b.

II, III, V

c.

III, IV, V

d.

I, II, IV

Answer: (d).I, II, IV

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the statements are true? I. Function overloading is done at compile time. II. Protected members are accessible to the member of derived class. III. A derived class...

Similar Questions

Discover Related MCQs

Q. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree?

Q. The number of edges in a complete graph of n vertices is

Q. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like

Q. With regard to linked list, which of the following statement is false?

Q. A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11?

Q. Queue is a ............. list.

Q. In a full binary tree of height k, there are ................. internal nodes.

Q. A binary tree is said to have heap property if the elements along any path:

Q. The graph K3,4 has:

Q. If (rear==maxsize-1) rear=0; else rear=rear+1; is required in:

Q. Which of the following does not define a tree?

Q. The complexity of Kruskal’s minimum spanning tree algorithm on a graph with ‘n’ nodes and ‘e’ edges is :

Q. Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters?

Q. Which of the following can be the sequence of nodes examined in a binary search tree while searching for key 98?

Q. Which of the following is true for a sorted list with ‘n’ elements?

Q. Consider  a  rooted  tree  in  which  every  node  has  at  least  three  children.  What  is  the minimum number of nodes at level i (i > 0) of the tree?  Assume that the root is at level 0:

Q. Which of the following data structure is used to implement recursion?

Q. The height of a binary tree with ‘n’ nodes, in the worst case is:

Q. Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by:

Q. With reference to implementation of different association mining algorithms, identify the correct statement: