Artificial Intelligence MCQ (Multiple Choice Questions) - SchoolingAxis

Artificial Intelligence MCQ (Multiple Choice Questions)

 Que- The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- The complexity of minimax algorithm is 

a. Same as of DFS 

b. Space - bm and time - bm 

c. Time - bm and space - bm 

d. Same as BFS  


Ans- Same as of DFS  


Que- Which is the most straightforward approach for planning algorithm? 

a. Best-first search 

b. State-space search 

c. Depth-first search 

d. Hill-climbing search   


Ans- State-space search  


Que- What are taken into account of state-space search? 

a. Postconditions 

b. Preconditions 

c. Effects 

d. Both Preconditions & Effects   


Ans- Both Preconditions & Effects    


Que- How many ways are available to solve the state-space search? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 2  


Que- What is the other name for forward state-space search? 

a. Progression planning 

b. Regression planning 

c. Test planning 

d. None of the mentioned   


Ans- Progression planning  


Que- How many states are available in state-space search? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 4  


Que- What is the main advantage of backward state-space search? 

a. Cost 

b. Actions 

c. Relevant actions 

d. All of the mentioned   


Ans- Relevant actions  


Que- What is the other name of backward state-space search? 

a. Regression planning 

b. Progression planning 

c. State planning 

d. Test planning   


Ans- Regression planning  


Que- What is meant by consistent in state-space search? 

a. Change in the desired literals 

b. Not any change in the literals 

c. No change in goal state 

d. None of the mentioned   


Ans- Not any change in the literals  


Que- What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? 

a. Success 

b. Error 

c. Compilation 

d. Termination   


Ans- Termination    


Que- Which approach is to pretend that a pure divide and conquer algorithm will work? 

a. Goal independence 

b. Subgoal independence 

c. Both Goal & Subgoal independence 

d. None of the mentioned   


Ans- Subgoal independence  


Que- Which search is equal to minimax search but eliminates the branches that can't influence the final decision? 

a. Depth-first search 

b. Breadth-first search 

c. Alpha-beta pruning 

d. None of the mentioned   


Ans- Alpha-beta pruning  


Que- Which values are independant in minimax search algorithm? 

a. Pruned leaves x and y 

b. Every states are dependant 

c. Root is independant 

d. None of the mentioned   


Ans- Pruned leaves x and y  


Que- To which depth does the alpha-beta pruning can be applied? 

a. 10 states 

b. 8 States 

c. 6 States 

d. Any depth   


Ans- Any depth    


Que- Which search is similar to minimax search? 

a. Hill-climbing search 

b. Depth-first search 

c. Breadth-first search 

d. All of the mentioned   


Ans- Depth-first search  


Que- Which value is assigned to alpha and beta in the alpha-beta pruning? 

a. Alpha = max 

b. Beta = min 

c. Beta = max 

d. Both Alpha = max & Beta = min   


Ans- Both Alpha = max & Beta = min    


Que- Where does the values of alpha-beta search get updated? 

a. Along the path of search 

b. Initial state itself 

c. At the end 

d. None of the mentioned   


Ans- Along the path of search  


Que- How the effectiveness of the alpha-beta pruning gets increased? 

a. Depends on the nodes 

b. Depends on the order in which they are executed 

c. All of the mentioned 

d. None of the mentioned   


Ans- Depends on the nodes  


Que- What is called as transposition table? 

a. Hash table of next seen positions 

b. Hash table of previously seen positions 

c. Next value in the search 

d. None of the mentioned  


Ans- Hash table of previously seen positions  


Que- Which is identical to the closed list in Graph search? 

a. Hill climbing search algorithm 

b. Depth-first search 

c. Transposition table 

d. None of the mentioned   


Ans- Transposition table  


Que- Which function is used to calculate the feasibility of whole game tree? 

a. Evaluation function 

b. Transposition 

c. Alpha-beta pruning 

d. All of the mentioned   


Ans- Evaluation function  


Que- There exist only two types of quantifiers, Universal Quantification and Existential Quantification. 

a. TRUE 

b. FALSE 

c.  Nothing can be said 

d.  None of the mentioned  


Ans- TRUE  


Que- A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formul

a. 

a. Deductive Systems 

b. Inductive Systems 

c. Reasoning with Knowledge Based Systems 

d. Search Based Systems  


Ans- Deductive Systems  


Que- The statement comprising the limitations of FOL is/are 

a. Expressiveness 

b. Formalizing Natural Languages 

c. Many-sorted Logic 

d. All of the mentioned  


Ans- All of the mentioned   


Que- A common convention is:• is evaluated first• and  are evaluated next• Quantifiers are evaluated next• is evaluated last. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- First Order Logic is also known as ___________ 

a. First Order Predicate Calculus 

b. Quantification Theory 

c. Lower Order Calculus 

d. All of the mentioned  


Ans- All of the mentioned   


Que- The adjective "first-order" distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitte

d. 

a. Representational Verification 

b. Representational Adequacy 

c. Higher Order Logic 

d. Inferential Efficiency  


Ans- Higher Order Logic  


Que- Which is created by using single propositional symbol? 

a. Complex sentences 

b. Atomic sentences 

c. Composition sentences 

d. None of the mentioned   


Ans- Atomic sentences  


Que- Which is used to construct the complex sentences? 

a. Symbols 

b. Connectives 

c. Logical connectives 

d. All of the mentioned   


Ans- Logical connectives  


Que- How many proposition symbols are there in artificial intelligence? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 2  


Que- How many logical connectives are there in artificial intelligence? 

a. 2 

b. 3 

c. 4 

d. 5 


Ans- 5  


Que- Which is used to compute the truth of any sentence? 

a. Semantics of propositional logic 

b. Alpha-beta pruning 

c. First-order logic 

d. Both Semantics of propositional logic & Alpha-beta pruning   


Ans- Semantics of propositional logic  


Que- Which are needed to compute the logical inference algorithm? 

a. Logical equivalence 

b. Validity 

c. Satisfiability 

d. All of the mentioned   


Ans- All of the mentioned    


Que- From which rule does the modus ponens are derived? 

a. Inference rule 

b. Module rule 

c. Both Inference & Module rule 

d. None of the mentioned   


Ans- Inference rule  


Que- Which is also called single inference rule? 

a. Reference 

b. Resolution 

c. Reform 

d. None of the mentioned   


Ans- Resolution  


Que- Which form is called as conjunction of disjunction of literals? 

a. Conjunctive normal form 

b. Disjunctive normal form 

c. Normal form 

d. All of the mentioned   


Ans- Conjunctive normal form  


Que- What can be viewed as single lateral of disjunction? 

a. Multiple clause 

b. Combine clause 

c. Unit clause 

d. None of the mentioned   


Ans- Unit clause  


Que- Which is a refutation complete inference procedure for propositional logic? 

a. Clauses 

b. Variables 

c. Propositional resolution 

d. Proposition   


Ans- Propositional resolution  


Que- What kind of clauses are available in Conjunctive Normal Form? 

a. Disjunction of literals 

b. Disjunction of variables 

c. Conjunction of literals 

d. Conjunction of variables   


Ans- Disjunction of literals  


Que- What is the condition of literals in variables? 

a. Existentially quantified 

b. Universally quantified 

c. Quantified 

d. None of the mentioned   


Ans- Universally quantified  


Que- 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   


Ans- Every sentence of first-order logic  


Que- Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? 

a. Search statement 

b. Reading statement 

c. Replaced statement 

d. Original statement   


Ans- Original statement    


Que- Which rule is equal to resolution rule of first-order clauses? 

a. Propositional resolution rule 

b. Inference rule 

c. Resolution rule 

d. None of the mentioned   


Ans- Propositional resolution rule  


Que- At which state does the propositional literals are complementary? 

a. If one variable is less 

b. If one is the negation of the other 

c. All of the mentioned 

d. None of the mentioned   


Ans- If one is the negation of the other  


Que- What is meant by factoring? 

a. Removal of redundant variable 

b. Removal of redundant literal 

c. Addition of redundant literal 

d. Addition of redundant variable   


Ans- Removal of redundant literal  


Que- What will happen if two literals are identical? 

a. Remains the same 

b. Added as three 

c. Reduced to one 

d. None of the mentioned   


Ans- Reduced to one  


Que- When the resolution is called as refutation-complete? 

a. Sentence is satisfiable 

b. Sentence is unsatisfiable 

c. Sentence remains the same 

d. None of the mentioned   


Ans- Sentence is unsatisfiable  


Que- Which condition is used to cease the growth of forward chaining? 

a. Atomic sentences 

b. Complex sentences 

c. No further inference 

d. All of the mentioned   


Ans- No further inference  


Que- Which closely resembles propositional definite clause? 

a. Resolution 

b. Inference 

c. Conjunction 

d. First-order definite clauses   


Ans- First-order definite clauses    


Que- What is the condition of variables in first-order literals? 

a. Existentially quantified 

b. Universally quantified 

c. Both Existentially & Universally quantified 

d. None of the mentioned   


Ans- Universally quantified  


Que- Which are more suitable normal form to be used with definite clause? 

a. Positive literal 

b. Negative literal 

c. Generalized modus ponens 

d. Neutral literal   


Ans- Generalized modus ponens  


Que- Which will be the instance of the class datalog knowledge bases? 

a. Variables 

b. No function symbols 

c. First-order definite clauses 

d. None of the mentioned   


Ans- No function symbols  


Que- Which knowledge base is called as fixed point? 

a. First-order definite clause are similar to propositional forward chaining 

b. First-order definite clause are mismatch to propositional forward chaining 

c. All of the mentioned 

d. None of the mentioned   


Ans- First-order definite clause are similar to propositional forward chaining  


Que- How to eliminate the redundant rule matching attempts in the forward chaining? 

a. Decremental forward chaining 

b. Incremental forward chaining 

c. Data complexity 

d. None of the mentioned   


Ans- Incremental forward chaining  

Previous Post Next Post

Responsive Ad