AI - Data Science & Artificial Intelligence Previous Year Questions

Match the items in Column 1 with the items in Column 2 in the following table:

Let \(p\) and \(q\) be any two propositions. Consider the following propositional statements.
\(S_1 : p \rightarrow q, \quad S_2 : \neg p \wedge q, \quad S_3 : \neg p \vee \bar{q}, \quad S_4 : \neg p \vee \neg q,\)
where \(\wedge\) denotes conjunction (AND operation), \(\vee\) denotes disjunction (OR operation), and \(\neg\) denotes negation (NOT operation). Which one of the following options is correct?
(Note: \(\equiv\) denotes logical equivalence)

Which of the following algorithms is NOT an example of uninformed search?

Which of the following statements is/are correct in a Bayesian network?

Which of the following statements is NOT true?
(The names of the predicates are intuitive.)