Artificial Intelligence MCQ (Multiple Choice Questions) - SchoolingAxis

Artificial Intelligence MCQ (Multiple Choice Questions)

 Que- Which data structure is used to give better heuristic estimates? 

a. Forwards state-space 

b. Backward state-space 

c. Planning graph algorithm 

d. None of the mentioned   


Ans- Planning graph algorithm  


Que- Which is used to extract solution directly from the planning graph? 

a. Planning algorithm 

b. Graphplan 

c. Hill-climbing search 

d. All of the mentioned   


Ans- Graphplan  


Que- What are present in the planning graph? 

a. Sequence of levels 

b. Literals 

c. Variables 

d. Heuristic estimates   


Ans- Sequence of levels  


Que- What is the starting level of planning graph? 

a. Level 3 

b. Level 2 

c. Level 1 

d. Level 0   


Ans- Level 0    


Que- What are present in each level of planning graph? 

a. Literals 

b. Actions 

c. Variables 

d. Both Literals & Actions   


Ans- Both Literals & Actions    


Que- Which kind of problem are suitable for planning graph? 

a. Propositional planning problem 

b. Planning problem 

c. Action problem 

d. None of the mentioned   


Ans- Propositional planning problem  


Que- What is meant by persistence actions? 

a. Allow a literal to remain false 

b. Allow a literal to remain true 

c. Allow a literal to remain false & true 

d. None of the mentioned   


Ans- Allow a literal to remain true  


Que- When will further expansion is unnecessary for planning graph? 

a. Identical 

b. Replicate 

c. Not identical 

d. None of the mentioned   


Ans- Identical  


Que- How many conditions are available between two actions in mutex relation? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 3  


Que- What is called inconsistent support? 

a. If two literals are not negation of other 

b. If two literals are negation of other 

c. Mutually exclusive 

d. None of the mentioned   


Ans- If two literals are negation of other  


Que- The process by which the brain orders actions needed to complete a specific task is referred as, 

a. Planning problem 

b. Partial order planning 

c. Total order planning 

d. Both Planning problem & Partial order planning  


Ans- Both Planning problem & Partial order planning   


Que- The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of 

a. Planning problem 

b. Partial Order planning problem 

c. Total order planning 

d. None of the mentioned  


Ans- Planning problem  


Que- To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. 

a. Stacks 

b. Queue 

c. BST (Binary Search Tree) 

d. Planning Graphs  


Ans- Planning Graphs   


Que- Planning graphs consists of 

a. a sequence of levels 

b. a sequence of levels which corresponds to time steps in the plan 

c. a sequence of actions which corresponds to the state of the system 

d. none of the mentioned  


Ans- a sequence of levels which corresponds to time steps in the plan  


Que- Planning graphs works only for prepositional planning problems. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristi

c. 

a. BFS/DFS 

b. A* 

c. Graph-Plan 

d. Greedy  


Ans- Graph-Plan  


Que- Planning problem can be described as a propositional logi

c. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- What is the other name of each plan resulted in partial order planning? 

a. Polarization 

b. Linearization 

c. Solarization 

d. None of the mentioned  


Ans- Linearization  


Que- Planning problem combines the two major aspects of AI 

a. Search & Logic 

b. Logic & Knowledge Based Systems 

c. FOL & Logic 

d. Knowledge Based Systems  


Ans- Search & Logic  


Que- __________ algorithm translates a planning problem in to prepositional axioms. 

a. GraphPlan 

b. SatPlan 

c. Greedy 

d. None of the mentioned  


Ans- SatPlan  


Que- ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. 

a. GraphPlan 

b. Hierarchical task network (HTN) 

c. SatPlan 

d. None of the mentioned  


Ans- Hierarchical task network (HTN)  


Que- Standard planning algorithms assumes environment to be 

a. Deterministic 

b. Fully observable 

c. Single agent 

d. Stochastic  


Ans- Deterministic  


Que- Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- A re planning agent uses execution monitoring and splices in repairs as neede

d. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. 

a. Conditional Plan 

b. Conformant Planning 

c. Execution monitoring 

d. Both Conditional Plan & Execution monitoring  


Ans- Execution monitoring  


Que- A Hybrid Bayesian network contains 

a. Both discrete and continuous variables 

b. Only Discrete variables 

c. Only Discontinuous variable 

d. Both Discrete and Discontinuous variable  


Ans- Both discrete and continuous variables  


Que- How is Fuzzy Logic different from conventional control methods? 

a. IF and THEN Approach 

b. FOR Approach 

c. WHILE Approach 

d. DO Approach  


Ans- IF and THEN Approach  


Que- If a hypothesis says it should be positive, but in fact it is negative, we call it 

a. A consistent hypothesis 

b. A false negative hypothesis 

c. A false positive hypothesis 

d. A specialized hypothesis  


Ans- A false positive hypothesis  


Que- The primitives in probabilistic reasoning are random variables. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- TRUE  


Que- Which is true for Decision theory? 

a. Decision Theory = Probability theory + utility theory 

b. Decision Theory = Inference theory + utility theory 

c. Decision Theory = Uncertainty + utility theory 

d. Decision Theory = Probability theory + preference  


Ans- Decision Theory = Uncertainty + utility theory  


Que- A constructive approach in which no commitment is made unless it is necessary to do so, is 

a. Least commitment approach 

b. Most commitment approach 

c. Nonlinear planning 

d. Opportunistic planning  


Ans- Least commitment approach  


Que- What is the extraction of the meaning of utterance? 

a. Syntactic 

b. Semantic 

c. Pragmatic 

d. None of the mentioned   


Ans- Semantic  


Que- What is the process of associating an FOL expression with a phrase? 

a. Interpretation 

b. Augmented reality 

c. Semantic interpretation 

d. Augmented interpretation   


Ans- Semantic interpretation  


Que- What is meant by compositional semantics? 

a. Determining the meaning 

b. Logical connectives 

c. Semantics 

d. None of the mentioned   


Ans- Determining the meaning  


Que- What is used to augment a grammar for arithmetic expression with semantics? 

a. Notation 

b. DCG notation 

c. Constituent 

d. All of the mentioned   


Ans- DCG notation  


Que- What can't be done in the semantic interpretation? 

a. Logical term 

b. Complete logical sentence 

c. Both Logical term & Complete logical sentence 

d. None of the mentioned   


Ans- Both Logical term & Complete logical sentence  


Que- How many verb tenses are there in english language? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 3  


Que- Which is used to mediate between syntax and semantics? 

a. Form 

b. Intermediate form 

c. Grammer 

d. All of the mentioned   


Ans- Intermediate form  


Que- What is meant by quasi-logical form? 

a. Sits between syntactic and logical form 

b. Logical connectives 

c. All of the mentioned 

d. None of the mentioned   


Ans- Sits between syntactic and logical form  


Previous Post Next Post

Responsive Ad