Answer the following:
Which one of the following statements (s) is/are FALSE?
A. FALSE according to definition of address space given in the link. whatever memory used by the overlay comes under the address space of computer "https://en.wikipedia.org/wiki/Address_space".
B. TRUE Optimal binary search tree construction can be performed efficiently by using dynamic programming. ref: http://www.geeksforgeeks.org/dynamic-programming-set-24-optimal-binary-search-tree/
C. FLASE Depth first search can be used to find connected components of a graph.
D. FALSE Infix + (postfix or prefix) is req. to construct the binary tree uniquely.
3308 Points
1884 Points
1656 Points
1640 Points
1396 Points
1272 Points
1162 Points
1048 Points
1010 Points
754 Points
742 Points
510 Points
490 Points
304 Points
248 Points
Gatecse