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:

Question 6 |

The truth table

represents the Boolean function

represents the Boolean function

X | |

X + Y | |

X \bigoplus Y | |

Y |

Question 6 Explanation:

Question 7 |

The decimal value 0.5 in IEEE single precision floating point representation has

fraction bits of 000...000 and exponent value of 0 | |

fraction bits of 000...000 and exponent value of -1 | |

fraction bits of 100...000 and exponent value of 0 | |

no exact representation |

Question 7 Explanation:

Question 8 |

A process executes the code

fork();

fork();

fork();

The total number of child processes created is

fork();

fork();

fork();

The total number of child processes created is

3 | |

4 | |

7 | |

8 |

Question 8 Explanation:

Question 9 |

Consider the function f(x)=sin(x) in the interval x \in [\pi/4, 7\pi/4]. The number and location(s) of the local minima of this function are

One, at \pi/2 | |

One, at 3\pi/2 | |

Two, at \pi/2 and 3\pi/2 | |

Two, at \pi/4 and 3\pi/2 |

Question 9 Explanation:

Question 10 |

The protocol data unit (PDU) for the application layer in the Internet stack is

Segment | |

Datagram | |

Message | |

Frame |

Question 10 Explanation:

There are 10 questions to complete.