| Ques 1 (i): The complement of the Boolean expression (A • B') + (B' • C) is: | (C)(A'+B) • (В +C') |
| Ques 1 (ii): Given below are two statements marked, Assertion and Reason. Read the two statements carefully and choose the correct option. Assertion: The expression ~ (X V Y) is logically equivalent to (~X ^ ~Y) Reason: The commutative property of logical operators states that the order of the operands does not change the result of a binary operation. | (B) Both Assertion and Reason are true but Reason is not the correct explanation for assertion |
| Ques 1 (iii): According to the Principle of Duality, the Boolean equation (1 + Y) • (X + Y) = Y + X' will be equivalent to: | (D) (1 . Y) + (1 . X) = Y . X' |
| Ques 1 (iv): The Associative Law states that: | (C) A+(B+C)=(A+B)+C |
| Ques 1 (v): Which of the following statements are valid for the given code? - I : The keyword this in the constructor refers to the current instance of the class. II : The keyword this differentiates between the instance variable age and the parameter age. III: The keyword this can be used only in constructors. | (A) Only I and II |
| Ques 1 (vi): Given below are two statements marked, Assertion and Reason. Read the two statements carefully and choose the correct option. Assertion: The break statement prevents fall through effect in switch caseconstruct. Reason: The break statement enables unnatural exit from the loop. | (B) Both Assertion and Reason are true but Reason is not the correct explanation |
| Ques 1 (vii): The canonical expression of F(P, Q, R) = n (2, 5, 7) is: | (B) (P . Q' . R) + (P' . Q . R') + (P' . Q' . R') |
| Ques 1 (viii): Study the given propositions and the statements marked, Assertion and Reason that follow it. Choose the correct option on the basis of your analysis. P- Iy is a Holiday Q- It is a Sunday Assertion: If it is not a Sunday, then it is not a holiday. (Q'=> P') Reason: Inverse is formed when antecedent and consequent are interchanged, | (C) Assertion is true and Reason is false. |
| Ques 1 (ix): For the given code segment, write Big O notation for worst case complexity. for (int i=1; i<=P; i++) { Statements; for (int j=1; j<=P; ++j) for (int k=1; k<=@; k++) { Slatements / | O (P x Q) |
| Ques 1 (x): Write the minters in canonical form for the Boolean Function X (A, B), from the | A'B' + AB |
POST YOUR COMMENT