In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)
by

1 Answer

Answer :

(B) (~P∨Q)∧(~Q∨P)
by

Related questions

In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q

Description : In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q 

Last Answer : (B) Q 

Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) (p∧q∨r) ∧ (p∧q∧r) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r)

Description : Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) ... ) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r) 

Last Answer : (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)

The clausal form of the disjunctive normal form ¬A∨¬B∨¬C∨D is: (A) A ∧ B ∧ C ⇒ D (B) A ∨ B ∨ C ∨ D ⇒ true (C) A ∧ B ∧ C ∧ D ⇒ true (D) A ∧ B ∧ C ∧ D ⇒ false

Description : The clausal form of the disjunctive normal form ¬A∨¬B∨¬C∨D is: (A) A ∧ B ∧ C ⇒ D (B) A ∨ B ∨ C ∨ D ⇒ true (C) A ∧ B ∧ C ∧ D ⇒ true (D) A ∧ B ∧ C ∧ D ⇒ false

Last Answer : (A) A ∧ B ∧ C ⇒ D 

Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Description : Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Last Answer : c) Every sentence of first-order logic

The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following? (1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P)) (4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))

Description : The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following? (1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P)) (4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))

Last Answer :  ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) 

What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

Description : What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

Last Answer : b) Separate words into individual morphemes and identify the class of the morphemes

Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic

Description : Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic

Last Answer : a) ILP

Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Description : Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Last Answer : a) First-order logic

What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic

Description : What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic

Last Answer : c) Extension of propositional logic

Planning problem can be described as a propositional logic. a) True b) False

Description : Planning problem can be described as a propositional logic. a) True b) False

Last Answer : a) True

What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly

Description : What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly

Last Answer : a) Reduction to propositional logic, Manipulate rules directly

Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Last Answer : c) Propositional resolution

What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned

Description : What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned

Last Answer : c) Both Objects & Relations

Which of the following is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic d) None of the mentioned

Description : Which of the following is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic d) None of the mentioned

Last Answer : c) Extension of propositional logic

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level

Define AND –Elimination rule in propositional logic

Description : Define AND –Elimination rule in propositional logic

Last Answer : AND elimination rule states that from a given conjunction it is possible to inference any of the conjuncts. 

Define Modus Ponen’s rule in Propositional logic?

Description : Define Modus Ponen’s rule in Propositional logic?

Last Answer : The standard patterns of inference that can be applied to derive chains of conclusions that lead to the desired goal is said to be Modus Ponen’s rule. 

What are the basic Components of propositional logic?

Description : What are the basic Components of propositional logic?

Last Answer : i. Logical Constants (True, False) 

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus 

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level 

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Description : Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Description : If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Last Answer : (C) Skolemization

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Last Answer : (A) In 1NF not in 2NF 

Some research scholars thinks that when a little extension will be made in dissertation, it will be equivalent to the degree of Ph.D. This idea denotes Options: A) The illusions on the part of researcher B) The truth on the part of researcher C) The miserable behaviour of the researcher D) The pitiable behaviour of the researcher

Description : Some research scholars thinks that when a little extension will be made in dissertation, it will be equivalent to the degree of Ph.D. This idea denotes Options: A) The illusions on the ... part of researcher C) The miserable behaviour of the researcher D) The pitiable behaviour of the researcher

Last Answer : A) The illusions on the part of researcher 

The agency that sits between the user and the UNIX system is called the A. logic B. profile C. shell D. erxc E. None of the above

Description : The agency that sits between the user and the UNIX system is called the A. logic B. profile C. shell D. erxc E. None of the above

Last Answer : C. shell

…………… programs can be used to accomplish functions indirectly that an unauthorized user could not accomplish directly. A) Zombie B) Worm C) Trojan Horses D) Logic Bomb

Description : …………… programs can be used to accomplish functions indirectly that an unauthorized user could not accomplish directly. A) Zombie B) Worm C) Trojan Horses D) Logic Bomb

Last Answer : C) Trojan Horses

The …………….. is code embedded in some legitimate program that is set to “explode” when certain conditions are met. A) Trap doors B) Trojan horse C) Logic Bomb

Description : The …………….. is code embedded in some legitimate program that is set to “explode” when certain conditions are met. A) Trap doors B) Trojan horse C) Logic Bomb

Last Answer : C) Logic Bomb

The ……….. is code that recognizes some special sequence of input or is triggered by being run from a certain user ID of by unlikely sequence of events. A) Trap doors B) Trojan horse C) Logic Bomb D) Virus

Description : The ……….. is code that recognizes some special sequence of input or is triggered by being run from a certain user ID of by unlikely sequence of events. A) Trap doors B) Trojan horse C) Logic Bomb D) Virus

Last Answer : A) Trap doors

……………… is a tabular method for describing the logic of the decisions to be taken. A) Decision tables B) Decision tree C) Decision Method D) Decision Data

Description : ……………… is a tabular method for describing the logic of the decisions to be taken. A) Decision tables B) Decision tree C) Decision Method D) Decision Data

Last Answer : A) Decision tables

What will be the output of the following logic diagram? (A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y

Description : What will be the output of the following logic diagram?  (A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y

Last Answer : (C) x NOR y

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c) 

Language model used in LISP is ................. (A) Functional programming (B) Logic programming (C) Object oriented programming (D) All of the above

Description : Language model used in LISP is ................. (A) Functional programming (B) Logic programming (C) Object oriented programming (D) All of the above

Last Answer : (A) Functional programming

Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Description : Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Last Answer : (D) HTML is a programming language.

Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1

Description : Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1

Last Answer : (C) 1 ⊕ 1 ⊕ 0 = 1

Which of the following logic operations is performed by the following given combinational circuit ? Image (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR

Description : Which of the following logic operations is performed by the following given combinational circuit ?  (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR

Last Answer : (A) EXCLUSIVE-OR

ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance

Description : ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance

Last Answer : Answer: 2  Explanation: Emitter-coupled logic (ECL) is the fastest of all logic families and therefore is used in applications where very high speed is essential. High speeds have become ... configuration, in which they are never driven into saturation and thereby the storage time is eliminated.

Unspecified address......................of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Unspecified address......................of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : B) (: : )

Loopback address ....................... of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Loopback address ....................... of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : A) (: : 1)

A …………………….. creates copies during replication that are functionally equivalent but have distinctly different bit patterns. A) Boot Sector Virus B) Polymorphic Virus C) Parasitic Virus D) Macro Virus

Description : A …………………….. creates copies during replication that are functionally equivalent but have distinctly different bit patterns. A) Boot Sector Virus B) Polymorphic Virus C) Parasitic Virus D) Macro Virus

Last Answer : B) Polymorphic Virus

Unspecified address ………………….. of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Unspecified address ………………….. of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : B) (: : )

Loopback address ……………………. of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Loopback address ……………………. of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : A) (: : 1)

What is the output when following statement is executed ? >>>print('new' 'line') a) Error b) Output equivalent to print ‘new\nline’ Page No 22 c) newline d) new line

Description : What is the output when following statement is executed ? >>>print('new' 'line') a) Error b) Output equivalent to print ‘new\nline’ Page No 22 c) newline d) new line

Last Answer : c) newline

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A, A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A, A→α1A | α2A | λ

Description : The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A,  A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

Last Answer : (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ