InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
What is the contrapositive of the conditional statement?“The home team misses whenever it is drizzling?”(a) If it is drizzling, then home team misses(b) If the home team misses, then it is drizzling(c) If it is not drizzling, then the home team does not misses(d) If the home team wins, then it is not drizzlingThis question was posed to me during an interview.My doubt is from Logics in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Right option is (d) If the home team WINS, then it is not drizzling |
|
| 52. |
The converse of p → q is the proposition of _______________(a) ¬p → ¬q(b) ¬q → ¬p(c) q → p(d) ¬q → pI got this question during a job interview.This intriguing question comes from Logics in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT CHOICE is (c) Q → p The best explanation: Definition of converse. |
|
| 53. |
The inverse of p → q is the proposition of ____________(a) ¬p → ¬q(b) ¬q → ¬p(c) q → p(d) ¬q → pThis question was addressed to me during an interview for a job.Question is taken from Logics in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct OPTION is (a) ¬p → ¬q |
|
| 54. |
The contrapositive of p → q is the proposition of ____________(a) ¬p → ¬q(b) ¬q → ¬p(c) q → p(d) ¬q → pThis question was posed to me in final exam.I'd like to ask this question from Logics topic in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT answer is (b) ¬q → ¬p Easiest EXPLANATION: Definition of contrapositive. |
|
| 55. |
A → (A ∨ q) is a __________(a) Tautology(b) Contradiction(c) Contingency(d) None of the mentionedThis question was addressed to me during an online interview.My doubt stems from Logics topic in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT ANSWER is (a) Tautology |
|
| 56. |
(A ∨ F) ∨ (A ∨ T) is always _________(a) True(b) FalseI have been asked this question in a job interview.The above asked question is from Logics topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT CHOICE is (a) True The BEST I can EXPLAIN: ≡ (A ∨ F) ∨ (A ∨ T) ≡ A ∨ T ≡ T. |
|
| 57. |
A ∧ ¬(A ∨ (A ∧ T)) is always __________(a) True(b) FalseThe question was posed to me by my college professor while I was bunking the class.This key question is from Logics topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT ANSWER is (B) False |
|
| 58. |
(A ∨ ¬A) ∨ (q ∨ T) is a __________(a) Tautology(b) Contradiction(c) Contingency(d) None of the mentionedI got this question during an interview for a job.This intriguing question comes from Logics topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT OPTION is (a) Tautology |
|
| 59. |
¬ (A ∨ q) ∧ (A ∧ q) is a ___________(a) Tautology(b) Contradiction(c) Contingency(d) None of the mentionedI had been asked this question in my homework.This intriguing question comes from Logics topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT option is (B) Contradiction For EXPLANATION I WOULD SAY: ≡ (¬A ∧ ¬q) ∧ (A ∧ q) ≡ (¬A ∧ A) ∧ (¬q ∧ q) ≡ F ∧ F ≡ F. |
|
| 60. |
A compound proposition that is neither a tautology nor a contradiction is called a ___________(a) Contingency(b) Equivalence(c) Condition(d) InferenceI got this question in final exam.My query is from Logics topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT OPTION is (a) CONTINGENCY |
|
| 61. |
If A is any statement, then which of the following is a tautology?(a) A ∧ F(b) A ∨ F(c) A ∨ ¬A(d) A ∧ TThis question was addressed to me in an interview for internship.My query is from Logics topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT ANSWER is (C) A ∨ ¬A Explanation: A ∨ ¬A is ALWAYS TRUE. |
|
| 62. |
If A is any statement, then which of the following is not a contradiction?(a) A ∧ ¬A(b) A ∨ F(c) A ∧ F(d) None of mentionedThis question was addressed to me in an interview for internship.My enquiry is from Logics in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
| Answer» | |
| 63. |
A compound proposition that is always___________ is called a contradiction.(a) True(b) FalseThis question was addressed to me during an interview for a job.This intriguing question comes from Logics topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct CHOICE is (b) FALSE |
|
| 64. |
A compound proposition that is always ___________ is called a tautology.(a) True(b) FalseThe question was posed to me by my school teacher while I was bunking the class.The query is from Logics in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT CHOICE is (a) True For EXPLANATION: Tautology is ALWAYS true. |
|
| 65. |
If P is always against the testimony of Q, then the compound statement P→(P v ~Q) is a __________(a) Tautology(b) Contradiction(c) Contingency(d) None of the mentionedThe question was posed to me in unit test.Asked question is from Logics and Proofs topic in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Right choice is (a) Tautology |
|
| 66. |
If the truth value of A v B is true, then truth value of ~A ∧ B can be ___________(a) True if A is false(b) False if A is false(c) False if B is true and A is false(d) None of the mentionedI have been asked this question in an online quiz.I'm obligated to ask this question of Logics and Proofs topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Right choice is (a) True if A is false |
|
| 67. |
Which of the following satisfies commutative law?(a) ∧(b) v(c) ↔(d) All of the mentionedI got this question in class test.My question comes from Logics and Proofs in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT OPTION is (d) All of the mentioned |
|
| 68. |
Negation of statement (A ∧ B) → (B ∧ C) is _____________(a) (A ∧ B) →(~B ∧ ~C)(b) ~(A ∧ B) v ( B v C)(c) ~(A →B) →(~B ∧ C)(d) None of the mentionedI have been asked this question in examination.My question is based upon Logics and Proofs topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct CHOICE is (a) (A ∧ B) →(~B ∧ ~C) |
|
| 69. |
~ A v ~ B is logically equivalent to?(a) ~ A → ~ B(b) ~ A ∧ ~ B(c) A → ~B(d) B V AThis question was posed to me in examination.The doubt is from Logics and Proofs in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct option is (C) A → ~B |
|
| 70. |
What is the dual of (A ∧ B) v (C ∧ D)?(a) (A V B) v (C v D)(b) (A V B) ^ (C v D)(c) (A V B) v (C ∧ D)(d) (A ∧ B) v (C v D)This question was posed to me in an online interview.The question is from Logics and Proofs in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT CHOICE is (b) (A V B) ^ (C v D) |
|
| 71. |
Which of the following is De-Morgan’s law?(a) P ∧ (Q v R) Ξ (P ∧ Q) v (P ∧ R)(b) ~(P ∧ R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧ ~R(c) P v ~P Ξ True, P ∧ ~P Ξ False(d) None of the mentionedI have been asked this question during an interview.My doubt stems from Logics and Proofs in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT OPTION is (b) ~(P ∧ R) Ξ ~P V ~R, ~(P v R) Ξ ~P ∧ ~R For explanation I would SAY: Definition of De–Morgan’s Law. |
|
| 72. |
The compound statement A v ~(A ∧ B).(a) True(b) FalseThis question was addressed to me at a job interview.This intriguing question comes from Logics and Proofs in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT answer is (a) True Explanation: APPLYING De-Morgan’s LAW we GET A V ~ A Ξ Tautology. |
|
| 73. |
Which of the following represents: ~A (negation of A) if A stands for “I like badminton but hate maths”?(a) I hate badminton and maths(b) I do not like badminton or maths(c) I dislike badminton but love maths(d) I hate badminton or like mathsThe question was asked in homework.This is a very interesting question from Logics and Proofs in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct choice is (d) I HATE BADMINTON or like maths |
|
| 74. |
The given circuit can work if the switches P and Q be ___________(a) P: True, Q: False(b) P: True, Q: True(c) P: False, Q: False(d) All of the mentionedThis question was addressed to me by my school teacher while I was bunking the class.This interesting question is from Logic Circuits topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT answer is (d) All of the mentioned The explanation is: If Q is false, then the CIRCUIT will be complete irrespective of the value of P. Also, if P is true and Q is also true, then also the circuit will be complete. Hence, all the CHOICES are correct. |
|
| 75. |
If in a for it to be complete it is necessary for switch A to be closed and either of switch B or C to be closed, then which can be true?(a) Switch A shouldin parallel with B and C is series to them(b) Switch A should be in series with a parallel circuit of B and C(c) All of the mentioned(d) None of the mentionedI had been asked this question at a job interview.Question is from Logic Circuits topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT choice is (b) Switch A should be in series with a parallel circuit of B and C The BEST I can explain: Switch A is in series and since there is ‘or’ between B and C therefore they MUST be in parallel. |
|
| 76. |
Which of the following statements is the negation of the statements “4 is odd or -9 is positive”?(a) 4 is even or -9 is not negative(b) 4 is odd or -9 is not negative(c) 4 is even and -9 is negative(d) 4 is odd and -9 is not negativeI have been asked this question during an interview for a job.My question comes from Logics and Proofs topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Right option is (C) 4 is even and -9 is negative |
|
| 77. |
The ten switches A,B,C,D,E,F,G,H,N,M are placed in the given circuit (all are open at given time). If you close one switch you need to pay 1 unit cost. What is the cost you need to pay to glow this Lamp?(a) 1 unit(b) 2 units(c) 3 units(d) 4 unitsThe question was asked in a job interview.Enquiry is from Logic Circuits topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct choice is (a) 1 unit |
|
| 78. |
The circuit depend on which switch/switches state to be complete?(a) P(b) Q(c) Both P and Q(d) None of the mentionedThe question was asked by my school teacher while I was bunking the class.This interesting question is from Logic Circuits topic in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT choice is (a) P Explanation: The circuit will be COMPLETE if (P) is TRUE, Q v ~Q will always be true. |
|
| 79. |
If it is given that switch R is closed and Q is closed then lamp will glow if _________(a) P: Open, S: Closed(b) P: Open, S: Open(c) P: Closed, S: Closed(d) None of the mentionedI had been asked this question during an interview for a job.This is a very interesting question from Logic Circuits in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct answer is (a) P: Open, S: Closed |
|
| 80. |
Which statement should be true in order for lamp to glow?(a) (R ∧ (~(P ∧ Q))(b) P∧R∧Q(c) P ∧ (Q ∧ ~R)(d) None of the mentionedThis question was addressed to me during an interview.My query is from Logic Circuits in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT CHOICE is (a) (R ∧ (~(P ∧ Q)) |
|
| 81. |
In this circuit shown the lamp will be glowing if _________(a) P: True, Q: True, R: False(b) P: True, Q: True, R: True(c) P: False, Q: False, R: True(d) None of the mentionedI have been asked this question in an international level competition.My question is taken from Logic Circuits in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct CHOICE is (c) P: False, Q: False, R: TRUE |
|
| 82. |
In the circuit shown the lamp will be glowing if _________(a) P: True, Q: False(b) P: True, Q: True(c) P: False, Q: False(d) None of the mentionedI have been asked this question by my college professor while I was bunking the class.Query is from Logic Circuits in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT answer is (a) P: True, Q: False Explanation: The circuit will be COMPLETE if P is true and Q is false. |
|
| 83. |
If there are ‘M’ switches in parallel numbered from 1, 2, …, M. For circuit to be complete and bulb to glow which of the following is necessary(a) 1∧ 2∧ 3 ∧ … ∧M should be on(b) 1∧ 2∧ 3 ∧ … ∧M should be off(c) 1 v 2 v 3 v … v M should be on(d) None of the mentionedI had been asked this question by my college director while I was bunking the class.Enquiry is from Logic Circuits in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct ANSWER is (c) 1 v 2 v 3 v … v M should be on |
|
| 84. |
If there are ‘M’ switches in series numbered from 1, 2, …, M. For circuit to be complete and bulb to glow which of the following is necessary?(a) 1∧ 2∧ 3 ∧ … ∧M should be on(b) 1∧ 2∧ 3 ∧ … ∧M should be off(c) 1 v 2 v 3 v … v M should be on(d) None of the mentionedThis question was addressed to me in exam.This key question is from Logic Circuits topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT choice is (a) 1∧ 2∧ 3 ∧ … ∧M should be on For EXPLANATION: All should be on in-order to complete the CIRCUIT. |
|
| 85. |
Let P, Q, R be true, false, false, respectively, which of the following is true?(a) P∧(Q∧~R)(b) (P->Q)∧~R(c) Q(P∧R)(d) P(QvR)The question was posed to me by my college professor while I was bunking the class.This question is from Logics topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT option is (c) Q<->(P∧R) The explanation: For a bi-conditional to be TRUE both inputs should be the same. |
|
| 86. |
The statement (~PQ)∧~Q is true when?(a) P: TrueQ: False(b) P: True Q: True(c) P: False Q: True(d) P: False Q: FalseI had been asked this question in an online interview.This key question is from Logics topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct OPTION is (a) P: TrueQ: False |
|
| 87. |
“Match will be played only if it is not a humid day.” The negation of this statement is?(a) Match will be played but it is a humid day(b) Match will be played or itis a humid day(c) All of the mentioned statement are correct(d) None of the mentionedThe question was posed to me in an online interview.Question is taken from Logics in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT CHOICE is (a) Match will be played but it is a HUMID day To explain I would say: NEGATION of P->Q is P∧~Q. |
|
| 88. |
Let P, Q, R be true, falsetrue, respectively, which of the following is true?(a) P∧Q∧R(b) P∧~Q∧~R(c) Q->(P∧R)(d) P->(Q∧R)This question was addressed to me in an interview for internship.This is a very interesting question from Logics topic in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct CHOICE is (c) Q->(P∧R) |
|
| 89. |
The statement which is logically equivalent to A∧ (and) B is?(a) A->B(b) ~A ∧ ~ B(c) A ∧ ~B(d) ~(A->~B)I got this question in an internship interview.This is a very interesting question from Logics topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct answer is (d) ~(A->~B) |
|
| 90. |
The compound statement A-> (A->B) is false, then the truth values of A, B are respectively _________(a) T, T(b) F, T(c) T, F(d) F, FI have been asked this question by my college professor while I was bunking the class.The query is from Logics topic in portion The Foundation: Logics and Proofs of Discrete Mathematics |
| Answer» | |
| 91. |
What is the negation of the statement A->(B v(or) C)?(a) A ∧ ~B ∧ ~C(b) A->B->C(c) ~A ∧ B v C(d) None of the mentionedThe question was asked in a national level competition.This is a very interesting question from Logics topic in division The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Right choice is (a) A ∧ ~B ∧ ~C |
|
| 92. |
Let P and Q be statements, then PQ is logically equivalent to __________(a) P~Q(b) ~PQ(c) ~P~Q(d) None of the mentionedI have been asked this question during an interview for a job.The query is from Logics topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct answer is (c) ~P<->~Q |
|
| 93. |
Let A: “010101”, B=?, If { A (Ex-or) B } is a resultant string of all ones then which of the following statement regarding B is correct?(a) B is negation of A(b) B is 101010(c) {A (and) B} is a resultantstring having all zeroes(d) All of the mentionedThe question was asked in my homework.Question is taken from Logic and Bit Operations in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT OPTION is (d) All of the mentioned To EXPLAIN I would say: In Ex-or both if both the inputs are the same then OUTPUT is 0 otherwise 1. |
|
| 94. |
If in a bits string of {0,1}, of length 4, such that no two ones are together. Then the total number of such possible strings are?(a) 1(b) 5(c) 7(d) 4This question was posed to me in an interview for job.My enquiry is from Logic and Bit Operations topic in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Right CHOICE is (c) 7 |
|
| 95. |
What is the 2’s complement of this string “01010100”?(a) 10101010(b) 00110100(c) 10101100(d) 10101001This question was posed to me in exam.Origin of the question is Logic and Bit Operations in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The CORRECT option is (c) 10101100 |
|
| 96. |
What is the one’s complement of this string “01010100”?(a) 10101010(b) 00110101(c) 10101011(d) 10101001I have been asked this question in semester exam.Question is taken from Logic and Bit Operations in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT choice is (c) 10101011 Easiest EXPLANATION: NEGATE every BIT in ONE’s complement. |
|
| 97. |
The Ex-nor of this string “01010101” with “11111111” is?(a) 10101010(b) 00110100(c) 01010101(d) 10101001The question was asked by my school teacher while I was bunking the class.Question is from Logic and Bit Operations in chapter The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» RIGHT option is (C) 01010101 For EXPLANATION I would say: In Ex-nor if both the inputs are same then output is 1 OTHERWISE 0. |
|
| 98. |
If a bit string contains {0, 1} only, having length 5 has no more than 2 ones in it. Then how many such bit strings are possible?(a) 14(b) 12(c) 15(d) 16This question was addressed to me by my school principal while I was bunking the class.This interesting question is from Logic and Bit Operations in section The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» The correct choice is (d) 16 |
|
| 99. |
If A is “001100” and B is “010101” then what is the value of A (Ex-or) B?(a) 000000(b) 111111(c) 001101(d) 011001I got this question in my homework.The above asked question is from Logic and Bit Operations topic in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» Correct ANSWER is (d) 011001 |
|
| 100. |
How many bits string of length 4 are possible such that they contain 2 ones and 2 zeroes?(a) 4(b) 2(c) 5(d) 6I got this question by my college director while I was bunking the class.Enquiry is from Logic and Bit Operations in portion The Foundation: Logics and Proofs of Discrete Mathematics |
|
Answer» CORRECT choice is (d) 6 The explanation: The strings are {0011, 0110, 1001, 1100, 1010 and 0101}. |
|