Question 1 |

The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from same suit is

3 | |

8 | |

9 | |

12 |

Question 1 Explanation:

Question 2 |

An n \times n array v is defined as follows:

v\left[i,j\right] = i - j for all i, j, i \leq n, 1 \leq j \leq n

The sum of the elements of the array v is

v\left[i,j\right] = i - j for all i, j, i \leq n, 1 \leq j \leq n

The sum of the elements of the array v is

0 | |

n-1 | |

n^2 - 3n +2 | |

n^2 \frac{\left(n+1\right)}{2} |

Question 2 Explanation:

Question 3 |

The determinant of the matrix

\begin{bmatrix}2 &0 &0 &0 \\ 8& 1& 7& 2\\ 2& 0&2 &0 \\ 9&0 & 6 & 1 \end{bmatrix}

\begin{bmatrix}2 &0 &0 &0 \\ 8& 1& 7& 2\\ 2& 0&2 &0 \\ 9&0 & 6 & 1 \end{bmatrix}

4 | |

0 | |

15 | |

20 |

Question 3 Explanation:

Question 4 |

Let S and T be languages over \Sigma=\{a.b\} represented by the regular expressions (a+b^*)^* \text{ and } (a+b)^*, respectively. Which of the following is true?

S \subset T | |

T \subset S | |

S = T | |

S \cap T = \phi |

Question 4 Explanation:

Question 5 |

Let L denote the languages generated by the grammar S \to 0S0 \mid 00.
Which of the following is TRUE?

L = 0^+ | |

L is regular but not 0^+ | |

L is context free but not regular | |

L is not context free |

Question 5 Explanation:

There are 5 questions to complete.