Which of the following can only be used in disproving the statements?

Related MCQs

• The statements that we consider initially are simple statements called _________statements.
• The statements formed from atomic statements are called _________statements.
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• A relation R is defined on the set of integers as xRy if and only if (x+y) is even. Which of the following statement is TRUE?
• Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
• B1: ({0, 1, 2….(n-1)}, xm) where xn stands for “multiplication-modulo-n” and B2: ({0, 1, 2….n}, xn) where xn stands for “multiplication-modulo-m” are the two statements. Both B1 and B2 are considered to be                      
• Min-terms of two statements are formed by introducing the connective _________.
• Max-terms of two statements are formed by introducing the connective _________.
• If a compound statement is made up of three simple statements then the number of rows in the truth table is _______.
• Let p: I will get a job, q: I pass the exam, then the statement form: I will get a job only if I pass the exam, in symbolic from is