๐ซ National Institute of Technology Silchar
Click to view the Question Paper

| Question | Details | Marks | CO |
|---|---|---|---|
| 1 | Let F(x, y) be the statement โx can fool y,โ where the domain consists of all people in the world. Use quantifiers to express each of these statements. (a) Nancy can fool exactly two people. (b) No one can fool both Fred and Jerry. | 1 1 | CO1 |
| 2 | Let Q(x, y) be the statement โx + y = x - y,โ x โ Z and y โ Z. Determine the truth value of โyโxQ(x, y). | 1 | CO1 |
| 3 | Anita, Boris, and Carmen are inhabitants of an island โXโ. The inhabitants of the island โXโ are either knights (who always tell the truth) or knaves (who always lie). What are Anita, Boris, and Carmen if Anita says โI am a knave and Boris is a knightโ and Boris says โExactly one of the three of us is a knightโ? | 2 | CO1 |
| 4 | (a) Determine the premise and conclusion in โWhen I stay up late, it is necessary that I sleep until noon.โ and write the converse of the statement. (b) Determine the premise and conclusion in โTo be a citizen of this country, it is sufficient that you were born in Indiaโ and write the inverse of the statement. | 3 3 | CO1 |
| 5 | (a) What relevant conclusion or conclusions can be drawn from: โIf I take the day off, it either rains or snows.โ โI took Tuesday off or I took Thursday off.โ โIt was sunny on Tuesday.โ โIt did not snow on Thursday.โ (b) Determine whether this argument is valid: โA student in this class has not read the book.โ โEveryone in this class passed the first exam.โ implies the conclusion โSomeone who passes the first exam has not read the book.โ | 2 2 | CO1 |
| 6 | (a) Prove the correctness of the decryption algorithm in the RSA algorithm.(b) Define primitive root modulo prime p. (c) Use Miller Rabin test to check 177 is composite or a strong pseudo-prime. | 2 2 3 | CO4 |
| 7 | (a) Find x such that x โก -2/11 mod 7.(b) Compute ฯ(121).(c) Determine the parity bits to be added on the data 11010 in a Hamming code. | 3 2 3 | CO4 |



