Question 1 |

Consider the following logical inferences.

I1: If it rains then the cricket match will not be played.

The cricket match was played.

Inference: There was no rain.

I2: If it rains then the cricket match will not be played.

It did not rain.

Inference: The cricket match was played.

Which of the following is TRUE?

I1: If it rains then the cricket match will not be played.

The cricket match was played.

Inference: There was no rain.

I2: If it rains then the cricket match will not be played.

It did not rain.

Inference: The cricket match was played.

Which of the following is TRUE?

Both I1 and I2 are correct inferences | |

I1 is correct but I2 is not a correct inference | |

I1 is not correct but I2 is a correct inference | |

Both I1 and I2 are not correct inferences |

Question 1 Explanation:

Question 2 |

Which of the following is TRUE?

Every relation in 3NF is also in BCNF | |

A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R | |

Every relation in BCNF is also in 3NF | |

No relation can be in both BCNF and 3NF |

Question 2 Explanation:

Question 3 |

What will be the output of the following C program segment?

```
char inChar = 'A' ;
switch ( inChar ) {
case 'A' : printf ("Choice A\ n") ;
case 'B' :
case 'C' : printf ("Choice B") ;
case 'D' :
case 'E' :
default : printf ( " No Choice" ) ; }
```

No Choice | |

Choice A | |

Choice A Choice B No Choice | |

Program gives no output as it is erroneous |

Question 3 Explanation:

Question 4 |

Assuming P \neq NP, which of the following is TRUE?

NP-complete = NP | |

NP-complete \cap P = \phi | |

NP-hard = NP | |

P = NP-complete |

Question 4 Explanation:

Question 5 |

The worst case running time to search for an element in a balanced binary search tree with n2^{n} elements is

\Theta (n log n) | |

\Theta n2^{n} | |

\Theta (n) | |

\Theta (log n) |

Question 5 Explanation:

There are 5 questions to complete.