Start
Q1
Question 1: __________ problems usually have well-defined steps.
Simple
Defined
Complex
Refined
Q2
Question 2: In Adversarial search there may occur such a scenario where two opponents also called __________ are searching for a goal.
Adversaries
Friend
Players
Intruders
Q3
Question 3: In backward chaining terminology, the hypothesis to prove is called the __________.
Proof
Goal
Plan
None of the given
Q4
Question 4: In Breadth First Search the node with the largest value of height will be at the __________ priority to be picked.
Zero
Minimum
Maximum
None of the given
Q5
Question 5: General stages of ESDLC includes.
Spiral model
Linear model
Beta system (tested by users)
Design coding
Q6
Question 6: If the true output of a concept [c(xi)] is 1 or 0 for an instance, then the output by our hypothesis [h(xi)] is 1 or 0 as well, respectively.
Q7
Question 7: Identify the correct statement to list facts numbers 1 through 10
clips> (facts 1 10)
clips> (facts 1 to 10)
clips> (facts 10)
clips> (facts 1)
Q8
Question 8: Hypothesis space uses the __________ of the attributes.
Conjunctions (AND)
Negation (NOR)
Disjunctions (OR)
None of the given
Q9
Question 9: A proposition is the statement of a __________.
Equation
Action
Theorem
Fact
Q10
Question 10: A statement in conjunctive normal form (CNF) consists of __________.
ANDs of Ors.
ANDs
Ors
Ors of ANDs