The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
301 views

Answer the following:

Which one of the following statements (s) is/are FALSE?

  1. Overlaying is used to run a program, which is longer than the address space of the computer.
  2. Optimal binary search tree construction can be performed efficiently by using dynamic programming.
  3. Depth first search cannot be used to find connected components of a graph.
  4. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
asked in DS by Veteran (42.9k points)
retagged by | 301 views
what is overlaying concept???

1 Answer

+3 votes

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.

answered by Veteran (10.8k points)
i think first is also true as we use overlay to run programms that can't fit completely in memory at the same time hence we swap parts of program
yes I too think A) and B) both true

https://gateoverflow.in/2464/gate1994-1-21

it will clear why a) is false



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,138 questions
36,959 answers
92,024 comments
34,802 users