Introduction to AI Important questions:

1. Briefly explain about Informed search algorithm with advantages and disadvantages
2. Explain about Greedy Local Search Algorithm
3.
a) Explain the move ordering in Aplha -Beta pruning
b) Write the pseudo code for Aplha-Beta pruning.
4. Explain about Propositional Logic and basic facts about propositional logic
5. Explain about Forward Chaining and Backward Chaining with its properties.
6. Explain about predicate logic with fundamentals
7. What is an Agent ? Explain rules for an Agent with structure
8. Briefly explain about Blind search Algorithm
9. Explain about Games utility Function usingAlpha-Beta pruning
10. Describe about Constraint Propagation with example.
11. Explain about Knowledge-based Agent in AI.
12. Explain about semantics of First Order Logic
13. Briefly explain about history of AI
a) Describe the goals of Artificial intelligence
b) Describe the advantages and disadvantages of AI
14. What is mean by Constraint Satisfaction Problem in Artificial Intelligence.
15. Explain about types of constraints in CSP with kinds of resolution methodologies.
16. Explain about optimal decision making in Games
17. Explain about syntax of First Order Logic

1.Whichof the following search strategies is not optimal? [ ]

a)A* Search b) Breadth-First Search c) Depth-First Search d) Uniform Cost Search

2. Which of the following is a drawback of the Greedy Search Algorithm? [ ]

a) It always finds the shortest path b) It may get stuck in local optima c) It guarantees an optimal
solution d) It considers both actual and estimated costs
3. What is the evaluation function used in A* Search? [ ]
a) f(n) = g(n) b) f(n) = g(n) - h(n) c) f(n) = h(n) d) f(n) = g(n) + h(n)
4. Which of the following is not a type of Hill Climbing algorithm? [ ]
a) Steepest Ascent Hill Climbing b) Simulated Annealing c) Simple Hill Climbing
d) Stochastic Hill Climbing
5.What is the best-case time complexity of Minimax with Alpha-Beta Pruning? [ ]
a)O(b^d) b) O(b^(d/2)) c) O(d^b) d) O(log b^d)
6. Which algorithm is commonly used to solve CSPs efficiently? [ ]
a) A* Search b) Backtracking c) Dijkstra’s Algorithm d) Minimax Algorithm
7. What is the purpose of the forward checking technique in CSPs? [ ]
 a) To assign values randomly b) To eliminate inconsistent values from domains ahead of time
c)To increase the number of constraints d) To reduce the number of variables
8. Which inference rule states that if "P → Q" and "P" are true, then "Q" must also be true?[ ]
a) Modus Tollens b)Modus Ponens c) Resolution d)Universal Instantiation
9. What is the main function of an inference engine in AI? [ ]
a) Storing data b) Collecting user inputs
c) Making logical deductions and conclusions d) Displaying graphics
10. Which of the following is an example of a well-formed formula (WFF) in FOL? [ ]
a)∀x (Human(x) → Mortal(x))
b) Human(x) → ∃y (Loves(x, y))
c) ∃x Human(x) ∧ Mortal(x)
d) All of the above

ii) Fill in The Blanks (10*1/2=5 Marks)

1. _______________________ is an agent which has clear preferrences.

2. An uninformed search doesnot contain any ________________________ knowledge,
3. Intelligent Agents will have same ________________ .
4. The most famous artificial environment is the __________________ environment.
5. The initial value of alpha is __________ .
6. The min player will only update the value of _________ .
7. In _______________________ ordering alpha-beta pruning doesnot prune any of the leaves of the tree.
8. Inference means deriving ___________________________________.
9. Knowledge base is a collection of ___________________.
10. Notation of addition________________________.

1. Which search algorithm uses a heuristic function to find the optimal path? [ ]
a) Depth-First Search (DFS) b) Uniform Cost Search c) A* Search d) Breadth-First Search
2. What is the main characteristic of the Greedy Search Algorithm? [ ]
a) It always finds the shortest path b) It expands the node with the lowest cost from the start
c) It expands the node with the lowest heuristic value d) It guarantees an optimal solution
3. Which of the following is true about A* Search? [ ]
a) It is both complete and optimal b) It is complete but not optimal c)
It is optimal but not complete d) It is neither complete nor optimal
4. What is the primary goal of the Hill Climbing algorithm? [ ]
a) To find the global optimum
b) To find the local maximum or minimum
c) To explore all possible solutions before deciding
d) To use both actual cost and heuristic values
5. What is the purpose of Alpha-Beta Pruning in the Minimax algorithm? [ ]
a) To make the game fairer b) To reduce the number of nodes evaluated
c) To improve the accuracy of the heuristic function d) To check if the opponent is cheating
6. Which evaluation function is used in Minimax for a game like chess? [ ]
a) Random selection of moves b) A heuristic function based on board position
c) Simple counting of pieces d) Depth-First Search without evaluation
7. Which of the following is not a key component of a CSP? [ ]
a) Variables b) Constraints c) Cost function d) Domain of values
8. Which of the following is NOT a type of reasoning used by knowledge-based agents? [ ]
 a) Deductive reasoning b) Inductive reasoning c) Abductive reasoning d)
Random reasoning
9. Which of the following is NOT an inference rule in AI? [ ]
a) Modus Ponens b) Modus Tollens c) Resolution d) Gradient Descent
10. In FOL, which quantifier represents "for all"? [ ]
a) ∃ (Existential quantifier) b) ∀ (Universal quantifier) c) ⇒ (Implication) d) ¬ (Negation)
ii) Fill in The Blanks (10*1/2=5 Marks)
1. AI machines are ____________________ and can perform the same action multiple times with high
accuracy.
2. Software agent can have _____________ .
3. __________________ are the devices which affect the environment.
4. Agent =_______________ + _______________
5. Alpha- Beta pruning is an modified version of _______________________.
6. A proposition formula which is always false is called ____________________ .
7. Notation of Disjunctive syllogism _______________________ .
8. Resolution is atheorem proving technique that proceeds by building __________________.
9. Forward chaining is also known as ______________________.
10. Disjunction of literals is called ______________.

1. Agent runs in the cycle of ____________ [ ]

a) perceiving b) thinking c) acting d) all the above
2. ____________ agent is measured by its performance measure. [ ]
a) rationality b) AI Agent c) intelligent agent d) all the above
3. Agent function is used to map a percept to an ____________ [ ]
a) action b) architecture c) sensor d) environment
4. Which of the following is an example of an uninformed search algorithm? [ ]
a) A* Search b) Breadth-First Search (BFS) c) Hill Climbing d) Genetic Algorithm
5 Which algorithm is commonly used to find the optimal decision in two-player turn-based games?
[ ]
a) Greedy Search b) Minimax Algorithm c) A* Search d)Depth-First Search
6.When does Alpha-Beta Pruning stop evaluating a node? [ ]
a) When a better move is already found in a sibling branch
b) When the node has no children
c) When the tree depth is reached
d) When the heuristic function returns zero
7) Which of the following is an example of a Constraint Satisfaction Problem (CSP)? [ ]
a) Finding the shortest path in a graph b) Searching for an item in an unsorted list
c) Sorting a list of numbers d) Solving a Sudoku puzzle
8) What is the main component of a knowledge-based agent? [ ]
a) Perceptron b) Knowledge Base (KB) c) Hidden Markov Model d) Neural Network
9) Inference rules are the templates for generating _________ [ ]
a) valid arguments b) Invalid arguments c) test a condition d) All the above
10) Which of the following is true about First-Order Logic (FOL)? [ ]
a) FOL allows quantification over objects.
b) FOL is less expressive than Propositional Logic.
c) FOL cannot express relationships between objects.
d) FOL is only used for propositional reasoning.
ii) Fill in The Blanks (10*1/2=5 Marks)

1. Artificial Intelligence has been in existence since ____________________ .

2. Artificial Intelligence defines _________________ and _________________ .
3. The agent sense the environment and take action through ______________ .
4. Space complexity of Breadth First Search is_____________ .
5. AI procedural generation also known as ________________________ in game design.
6. The main condition for alpba-beta pruning is______________
7. A proposition formula which is always true is called ____________________ .
8. Automic preposition consists of __________________________ symbol.
9. Notation of Modus Ponens__________________________.
10. The converse of implication means the right hand side proposition goes to ________________________.

Answers:
1. C
2. B
3. D
4. B
5. B
6. B
7. B
8. B
9. C
10. D

Bits:
1. Rational agent
2. Domain
3. Skeleton
4. Turing test
5. -α
6. Beta
7. Worst ordering
8. New senrtence from old.
9. Sentences
10. P/(PvQ).

1. C
2. C
3. A
4. B
5. B
6. B
7. C
8. D
9. D
10. B

Bits:
1. Highly reliable
2. Key strokes
3. Effectors
4. Agent= Architectute + Agent Program
5. Minimax algorithm.
6. Contradiction
7. ((Pvq),¬P)/Q
8. Refutation proofs
9. Forward deduction
10. Clause.

1. D
2. C
3. A
4. B
5. B
6. A
7. D
8. B
9. A
10. A

bits
1. 1955
2. Man made and thinking power
3. Actuators.
4. O(bd)
5. Procedural storytelling
6. α>=β
7. Tautology
8. Single proposition
9. (P->Q,P)/Q
10. Left hand side