Question 1 |

Suppose that the expectation of a random variable X is 5. Which of the following statements is true?

There is a sample point at which X has the value 5. | |

There is a sample point at which X has value greater than 5. | |

There is a sample point at which X has a value greater than equal to 5. | |

None of the above |

Question 1 Explanation:

Question 2 |

The number of binary relations on a set with n elements is:

n^2 | |

2^n | |

2^{n^2} | |

None of the above |

Question 2 Explanation:

Question 3 |

The number of binary strings of n zeros and k ones in which no two ones are adjacent is

^{n-1}C_k | |

^nC_k | |

^nC_{k+1} | |

None of the above |

Question 3 Explanation:

Question 4 |

Consider the regular expression (0 + 1) (0+1) ... n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains

n states | |

n+1 states | |

n+2 states | |

None of the above |

Question 4 Explanation:

Question 5 |

Context-free languages are closed under:

Union, intersection | |

Union, Kleene closure | |

Intersection, complement | |

Complement, Kleene closure |

Question 5 Explanation:

There are 5 questions to complete.