GATE CSE 2002


Q21.

With regard to the expressive power of the formal relational query languages, which of the following statements is true ?
GateOverflow

Q22.

From the following instance of relation schema R(A,B,C), we can conclude that :
GateOverflow

Q23.

The binary relation S = \phi (empty set) on set A = {1,2,3} is
GateOverflow

Q24.

In the C language
GateOverflow

Q25.

Dynamic linking can cause security concerns because
GateOverflow

Q26.

To evaluate an expression without any embedded function calls
GateOverflow