Question 1 |

Choose the correct alternatives (More than one may be correct).

Two NAND gates having open collector outputs are tied together as shown in below figure.

The logic function Y, implemented by the circuit is,

Two NAND gates having open collector outputs are tied together as shown in below figure.

The logic function Y, implemented by the circuit is,

Y=ABC + DE | |

Y=\overline{ABC + DE} | |

Y=ABC.DE | |

Y=\overline{ABC.DE} |

Question 1 Explanation:

Question 2 |

Choose the correct alternatives (More than one may be correct).

Indicate which of the following statements are true:

A relational database which is in 3NF may still have undesirable data redundancy because there may exist:

Indicate which of the following statements are true:

A relational database which is in 3NF may still have undesirable data redundancy because there may exist:

Transitive functional dependencies | |

Non-trivial functional dependencies involving prime attributes on the right-side. | |

Non-trivial functional dependencies involving prime attributes only on the left-side. | |

Non-trivial functional dependencies involving only prime attributes. |

Question 2 Explanation:

Question 3 |

Choose the correct alternatives (More than one may be correct).

The number of rooted binary trees with n nodes is,

The number of rooted binary trees with n nodes is,

Equal to the number of ways of multiplying (n+1) matrices. | |

Equal to the number of ways of arranging n out of 2 n distinct elements. | |

Equal to \frac{1}{(n+1)}\binom{2n}{n}. | |

Equal to n!. |

Question 3 Explanation:

Question 4 |

Choose the correct alternatives (More than one may be correct).

The total external path length, EPL, of a binary tree with n external nodes is, \Sigma _w=Iw, where I_{w} is the path length of external node w),

The total external path length, EPL, of a binary tree with n external nodes is, \Sigma _w=Iw, where I_{w} is the path length of external node w),

\leq n^{2} always. | |

\geq n \log_{2} n always. | |

Equal to n^{2} always. | |

O(n) for some special trees. |

Question 4 Explanation:

Question 5 |

Choose the correct alternatives (More than one may be correct).

The complexity of comparision based sorting algorithms is:

The complexity of comparision based sorting algorithms is:

\Theta (n \log n) | |

\Theta (n) | |

\Theta \left(n^2\right) | |

\Theta (n\sqrt n) |

Question 5 Explanation:

There are 5 questions to complete.