MEWAR UNIVERSITY, CHITTORGARH SET-1

DEPARTMENT OF COMPUTER APPLICATION

END TERM EXAMINATION: APR-2025
COURSE : YEAR : 2nd SEM : 4th

PAPER NAME & CODE : Artificial Intelligence

MAX MARKS: 85 TIME : 3:00 HRS

PART 1

Note : Attempt all Questions. All Question Carry 1 Marks. [CO1 – CO5]

1. What is Artificial Intelligence?

a) Artificial Intelligence is a field that aims to make humans more intelligent
b) Artificial Intelligence is a field that aims to improve the security
c) Artificial Intelligence is a field that aims to develop intelligent machines
d) Artificial Intelligence is a field that aims to mine the data

2. Which of the following is the branch of Artificial Intelligence?

a) Machine Learning b) Cyber forensics
c) Full-Stack Developer d) Network Design

3. Which of the following is a component of Artificial Intelligence?

a) Learning b) Training
c) Designing d) Puzzling

4. Which of the following are the 5 big ideas of AI?

a) Perception b) Human-AI Interaction
c) Societal Impact d) All of the above

5. Depth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node
c) Deepest d) Minimum cost

6. uniform-cost search expands the node n with the __________

a) Lowest path cost b) Heuristic cost
c) Highest path cost d) Average path cost

7. What is the other name of informed search strategy?

a) Simple search b) Heuristic search
c) Online search d) None of the mentioned

8. Which search is implemented with an empty first-in-first-out queue?

a) Depth-first search b) Breadth-first search
c) Bidirectional search d) None of the mentioned

9. LIFO is ______ where as FIFO is ________

a) Stack, Queue b) Queue, Stack
c) Priority Queue, Stack d) Stack. Priority Queue

10. Breadth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node
c) Deepest d) Minimum cost
11. 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

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

a) Progression planning b) Regression planning
c) Test planning d) None of the mentioned

13. Which agent deals with happy and unhappy states?

a) Simple reflex agent b) Model based agent
c) Learning agent d) Utility based agent

14. Natural language understanding is used in _____________

a) natural language interfaces b) natural language front ends
c) text understanding systems d) all of the mentioned

15. 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

16. Neural Networks are complex ______________ with many parameters.

a) Linear Functions b) Non linear Functions
c) Discrete Functions d) Exponential Functions

17. The fundamental unit of network is

a) brain b) nucleus
c) neuron d) axon

18. What is ART in neural networks?

a) automatic resonance theory b) artificial resonance theory
c) adaptive resonance theory d) none of the mentioned

19. What is the name for information sent from robot sensors to robot controllers?
a) temperature b) pressure
c) feedback d) signal

20. Which search implements stack operation for searching the states?
a) Depth-limited search b) Depth-first search
c) Breadth-first search d) None of the mentioned

21. Heuristic function h(n) is ________

a) Lowest path cost b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node d) Average path cost

22. Which type of machine learning algorithm falls under the category of “unsupervised learning”?
a) Linear Regression b) K-means Clustering
c) Decision Trees d) Random Forest

23. Which one of the following models is a generative model used in machine learning?
a) Support vector machines b) Naïve Bayes
c) Logistic Regression d) Linear Regression

24. Which algorithm is best suited for a binary classification problem?

a) K-nearest Neighbors b) Decision Trees
c) Random Forest d) Linear Regression
25. A plan that describe how to take actions in levels of increasing refinement and specificity is
____________
a) Problem solving b) Planning
c) Non-hierarchical plan d) Hierarchical plan

26. Which kind of planning consists of successive representations of different levels of a plan?
a) hierarchical planning b) non-hierarchical planning
c) project planning d) all of the mentioned

27. What is state space?

a) The whole problem b) Your Definition to a problem
c) Problem you design d) Representing your problem with variable and parameter

28. The action ‘STACK(A, B)’ of a robot arm specify to _______________

a) Place block B on Block A
b) Place blocks A, B on the table in that order
c) Place blocks B, A on the table in that order
d) Place block A on block B

29. A Horn clause is a clause with _______ positive literal.

a) At least one b) At most one
c) None d) All
30. What is the evaluation function in greedy approach?
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

31. ___________ trees can be used to infer in Horn clause systems.

a) Min/Max Tree b) And/Or Trees
c) Minimum Spanning Trees d) Binary Search Trees

32. Where is the n-queens problem implemented?

a) carom b) chess
c) ludo d) cards

33. The procedure to incrementally update each of weights in neural is referred to as?
a) synchronisation b) learning law
c) learning algorithm d) both learning algorithm & law

34. How can output be updated in neural network?

a) synchronously b) asynchronously
c) both synchronously & asynchronously d) none of the mentioned

35. What is asynchronous update in neural networks?

a) output units are updated sequentially b) output units are updated in parallel fashion
c) can be either sequentially or in parallel fashion d) none of the mentioned
 PART- 2
NOTE: Attempt Five Question at least One Question from Each Section. All Question Carry Equal
Marks.

SECTION-A (CO1)
Q 1. Explain the following search strategies
i) best first search
ii) A* search
Q 2. Explain the following uninformed search strategies with examples.
(a) Uniform Cost Search
(b) Depth First Search

SECTION-B (CO2)
Q 3. Define AI ? And What is meant by Turing test?
Q 4. You have Given two Jugs, a 5 Litre one and 3 Litre one , a pump which has unlimited water
which you can use to fill the Jug and the Ground on which water may be poured. Neither Jug has
any measuring mark on it. How can you get exactly 4 Litre of Water in 5 Litre of Jug ?

SECTION-C (CO3)
Q 5. Define n-Queen Problem. And Solve 4-queen Problem with Suitable Example.
Q 6. Define Linear and Non Linear Planning. And also Define Partial Order Planning.

SECTION-D (CO4)
Q 7. Define Frame and Script with Suitable Example.
Q 8. What is Semantic Network Representation? Give Suitable example.

SECTION-E (CO5)
Q 9. Explain with algorithm and example:
i. Minimax algorithm
ii. Alpha-Beta Pruning
Q 10. Write short notes on Expert systems. Explain Advantages of Expert systems. And list some
Expert System.

MEWAR UNIVERSITY, CHITTORGARH SET-2

 DEPARTMENT OF COMPUTER APPLICATION
END TERM EXAMINATION: APR-2025
COURSE : YEAR : 2nd SEM : 4th

PAPER NAME & CODE : [] & Artificial Intelligence

MAX MARKS: 85 TIME : 3:00 HRS

PART 1

Note : Attempt all Questions. All Question Carry 1 Marks. [CO1 – CO5]

1. What is the goal of Artificial Intelligence?

a) To solve artificial problems b) To extract scientific causes
c) To explain various sorts of intelligence d) To solve real-world problems

2. LIFO is ______ where as FIFO is ________

a) Stack, Queue b) Queue, Stack
c) Priority Queue, Stack d) Stack. Priority Queue

3. Breadth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node
c) Deepest d) Minimum cost

4. Where is the n-queens problem implemented?

a) carom b) chess
c) ludo d) cards

5. Which of the following is an application of Artificial Intelligence?

a) It helps to exploit vulnerabilities to secure the firm
b) Language understanding and problem-solving (Text analytics and NLP)
c) Easy to create a website
d) It helps to deploy applications on the cloud

6. The fundamental unit of network is

a) brain b) nucleus
c) neuron d) axon

7. What is ART in neural networks?

a) automatic resonance theory b) artificial resonance theory
c) adaptive resonance theory d) none of the mentioned

8. Which of the following is a component of Artificial Intelligence?

a) Learning b) Training
c) Designing d) Puzzling

9. What is the space complexity of Depth-first search?

a) O(b) b) O(bl)
c) O(m) d) O(bm)

10. Which instruments are used for perceiving and acting upon the environment?
a) Sensors and Actuators b) Sensors
c) Perceiver d) None of the mentioned

11. Which is used to improve the agents performance?

a) Perceiving b) Learning
c) Observing d) None of the mentioned
12. For general graph, how one can get rid of repeated states?
a) By maintaining a list of visited vertices
b) By maintaining a list of traversed edges
c) By maintaining a list of non-visited vertices
d) By maintaining a list of non-traversed edges

13. Which of the following are the 5 big ideas of AI?

a) Perception b) Human-AI Interaction
c) Societal Impact d) All of the above

14. Which search is implemented with an empty first-in-first-out queue?

a) Depth-first search b) Breadth-first search
c) Bidirectional search d) None of the mentioned

15. 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

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

a) 10 states b) 8 States
c) 6 States d) Any depth

17. Which search implements stack operation for searching the states?
a) Depth-limited search b) Depth-first search
c) Breadth-first search d) None of the mentioned

18. 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

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

a) Progression planning b) Regression planning
c) Test planning d) None of the mentioned

20. Heuristic function h(n) is ________

a) Lowest path cost b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node d) Average path cost

21. What is the evaluation function in greedy approach?

a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

22. General games involves ____________

a) Single-agent b) Multi-agent
c) Neither Single-agent nor Multi-agent d) Only Single-agent and Multi-agent

23. Which search uses the problem specific knowledge beyond the definition of the problem?
a) Informed search b) Depth-first search
c) Breadth-first search d) Uninformed search

24. A plan that describe how to take actions in levels of increasing refinement and specificity is
____________
a) Problem solving b) Planning
c) Non-hierarchical plan d) Hierarchical plan

25. The action ‘STACK(A, B)’ of a robot arm specify to _______________

a) Place block B on Block A
b) Place blocks A, B on the table in that order
c) Place blocks B, A on the table in that order
d) Place block A on block B

26. A Horn clause is a clause with _______ positive literal.

a) At least one b) At most one
c) None d) All
27. Which agent deals with happy and unhappy states?
a) Simple reflex agent b) Model based agent
c) Learning agent d) Utility based agent

28. K-Nearest Neighbors (KNN) is classified as what type of machine learning algorithm?
a) Instance-based learning b) Parametric learning
c) Non-parametric learning d) Model-based learning

29. In which category does linear regression belong to?

a) Neither supervised nor unsupervised learning b) Both supervised and unsupervised learning
c) Unsupervised learning d) Supervised learning

31. Natural language understanding is used in _____________

a) natural language interfaces b) natural language front ends
c) text understanding systems d) all of the mentioned

32. Which search is complete and optimal when h(n) is consistent?

a) Best-first search b) Depth-first search
c) Both Best-first & Depth-first search d) A* search

33. A* algorithm is based on ___________

a) Breadth-First-Search b) Depth-First –Search
c) Best-First-Search d) Hill climbing

34. Depth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node
c) Deepest d) Minimum cost

35. What is the other name of informed search strategy?

a) Simple search b) Heuristic search
c) Online search d) None of the mentioned

PART- 2
NOTE: Attempt Five Question at least One Question from Each Section. All Question Carry Equal
Marks.

SECTION-A (CO1)
Q 1. Define Frame and Script with Suitable Example.
Q 2. Explain some of the knowledge representation techniques

SECTION-B (CO2)
Q 3. Explain the following uninformed search strategies with examples.
(a) Uniform Cost Search
(b) Depth First Search
Q 4. Explain the following search strategies
i) best first search
i) A* search

SECTION-C (CO3)
Q 5. Define n-Queen Problem. And Solve 4-queen Problem with Suitable Example.
Q 6. Explain with algorithm and example:
i)). Minimax algorithm
i). Alpha-Beta Pruning

SECTION-D (CO4)
Q 7. Write short notes on Heuristic Functions.
Q 8. You have Given two Jugs, a 5 Litre one and 3 Litre one , a pump which has unlimited water
which you can use to fill the Jug and the Ground on which water may be poured. Neither Jug has
any measuring mark on it. How can you get exactly 4 Litre of Water in 5 Litre of Jug ?

SECTION-E (CO5)
Q 9. Define Linear and Non Linear Planning. And also Define Partial Order Planning.
Q 10. Write short notes on Expert systems. Explain Advantages of Expert systems. And list some
Expert System.

MEWAR UNIVERSITY, CHITTORGARH SET-3

 DEPARTMENT OF COMPUTER APPLICATION
END TERM EXAMINATION: APR-2025
COURSE : YEAR : 2nd SEM : 4th

PAPER NAME & CODE : [] & Artificial Intelligence

MAX MARKS: 85 TIME : 3:00 HRS

PART 1

Note : Attempt all Questions. All Question Carry 1 Marks. [CO1 – CO5]

1. Which of the following is the branch of Artificial Intelligence?

a) Machine Learning b) Cyber forensics
c) Full-Stack Developer d) Network Design

2. What is the goal of Artificial Intelligence?

a) To solve artificial problems b) To extract scientific causes
c) To explain various sorts of intelligence d) To solve real-world problems

3. Which of the following are the 5 big ideas of AI?

a) Perception b) Human-AI Interaction
c) Societal Impact d) All of the above

4. What is the name of Artificial Intelligence which allows machines to handle vague information with a
deftness that mimics human intuition?
a) Human intelligence b) Boolean logic
c) Functional logic d) Fuzzy logic

5. Which search implements stack operation for searching the states?

a) Depth-limited search b) Depth-first search
c) Breadth-first search d) None of the mentioned

6. Which search algorithm imposes a fixed depth limit on nodes?

a) Depth-limited search b) Depth-first search
c) Iterative deepening search d) Bidirectional search

7. For general graph, how one can get rid of repeated states?
a) By maintaining a list of visited vertices
b) By maintaining a list of traversed edges
c) By maintaining a list of non-visited vertices
d) By maintaining a list of non-traversed edges

8. LIFO is ______ where as FIFO is ________

a) Stack, Queue b) Queue, Stack
c) Priority Queue, Stack d) Stack. Priority Queue

9. Depth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node
c) Deepest d) Minimum cost

10. uniform-cost search expands the node n with the __________

a) Lowest path cost b) Heuristic cost
c) Highest path cost d) Average path cost
11. General algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms
c) Greedy Search Algorithms d) MIN/MAX Algorithms

12. What is the complexity of minimax algorithm?

a) Same as of DFS b) Space – bm and time – bm
c) Time – bm and space – bm d) Same as BFS

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

a) Progression planning b) Regression planning
c) Test planning d) None of the mentioned

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

a) 10 states b) 8 States
c) 6 States d) Any depth

15. 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

16. A plan that describe how to take actions in levels of increasing refinement and specificity is
____________
a) Problem solving b) Planning
c) Non-hierarchical plan d) Hierarchical plan

17. ___________ trees can be used to infer in Horn clause systems.

a) Min/Max Tree b) And/Or Trees
c) Minimum Spanning Trees d) Binary Search Trees

18. Which instruments are used for perceiving and acting upon the environment?
a) Sensors and Actuators b) Sensors
c) Perceiver d) None of the mentioned

19. What is state space?

a) The whole problem b) Your Definition to a problem
c) Problem you design d) Representing your problem with variable and parameter

20. A search algorithm takes _________ as an input and returns ________ as an output.
a) Input, output b) Problem, solution
c) Solution, problem d) Parameters, sequence of actions

21. Where is the n-queens problem implemented?

a) carom b) chess
c) ludo d) cards

22. The process of adjusting the weight is known as?

a) activation b) synchronisation
c) learning d) none of the mentioned

23. The procedure to incrementally update each of weights in neural is referred to as?
a) synchronisation b) learning law
c) learning algorithm d) both learning algorithm & law

24. What is ART in neural networks?

a) automatic resonance theory b) artificial resonance theory
c) adaptive resonance theory d) none of the mentioned
25. Which type of machine learning algorithm falls under the category of “unsupervised learning”?
a) Linear Regression b) K-means Clustering
c) Decision Trees d) Random Forest

26. Which one of the following models is a generative model used in machine learning?
a) Support vector machines b) Naïve Bayes
c) Logistic Regression d) Linear Regression

27. In which category does linear regression belong to?

a) Neither supervised nor unsupervised learning b) Both supervised and unsupervised learning
c) Unsupervised learning d) Supervised learning

28. What is the Manhattan distance between a data point (9, 7) and a new query instance (3, 4)?
a) 7 b) 9
c) 3 d) 4

29. What is asynchronous update in neural networks?

a) output units are updated sequentially b) output units are updated in parallel fashion
c) can be either sequentially or in parallel fashion d) none of the mentioned

30. Which agent deals with happy and unhappy states?

a) Simple reflex agent b) Model based agent
c) Learning agent d) Utility based agent

31. Natural language understanding is used in _____________

a) natural language interfaces b) natural language front ends
c) text understanding systems d) all of the mentioned

32. The action ‘STACK(A, B)’ of a robot arm specify to _______________

a) Place block B on Block A
b) Place blocks A, B on the table in that order
c) Place blocks B, A on the table in that order
d) Place block A on block B
33. A* algorithm is based on ___________
a) Breadth-First-Search b) Depth-First –Search
c) Best-First-Search d) Hill climbing

34. Heuristic function h(n) is ________

a) Lowest path cost b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node d) Average path cost

35. What is the evaluation function in greedy approach?

a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
 PART- 2
NOTE: Attempt Five Question at least One Question from Each Section. All Question Carry Equal
Marks.

SECTION-A (CO1)
Q 1. Explain the following uninformed search strategies with examples.
(a) Uniform Cost Search
(b) Depth First Search
Q 2. Explain the following search strategies
i) best first search
i) A* search

SECTION-B (CO2)
Q 3. Define Linear and Non Linear Planning. And also Define Partial Order Planning.
Q 4. What is Semantic Network Representation? Give Suitable example.

SECTION-C (CO3)
Q 5. Define n-Queen Problem. And Solve 4-queen Problem with Suitable Example.
Q 6. You have Given two Jugs, a 5 Litre one and 3 Litre one , a pump which has unlimited water
which you can use to fill the Jug and the Ground on which water may be poured. Neither Jug has
any measuring mark on it. How can you get exactly 4 Litre of Water in 5 Litre of Jug ?

SECTION-D (CO4)
Q 7. Define Frame and Script with Suitable Example.
Q 8. Explain with algorithm and example:
i. Minimax algorithm
ii. Alpha-Beta Pruning

SECTION-E (CO5)
Q 9. Explain some of the knowledge representation techniques
Q 10. Write short notes on Expert systems. Explain Advantages of Expert systems. And list some
Expert System.