0% found this document useful (0 votes)
67 views3 pages

Module 3 IMLAUs QB

aiml

Uploaded by

hrts4vizla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
67 views3 pages

Module 3 IMLAUs QB

aiml

Uploaded by

hrts4vizla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Intelligent Systems and Machine Learning Algorithms(BEC515A) Question Bank – Module 3

MODULE - 3
Informed Search Strategies & Heuristic
Functions Logical Agents:
Q. No. Questions COs CL Marks

1 Define informed search strategies in the context of AI. How do they CO3 L1 6M
differ from uninformed search strategies?

2 Compare and contrast informed search with uninformed search. CO3 L2 5M


Provide examples of scenarios where each is more suitable.

3 Explain the role of heuristics in informed search strategies. How do CO3 L2 8M

heuristics contribute to finding optimal solutions?

4 Define heuristic functions and explain their significance in problem- CO3 L1 8M

solving. Provide examples of common heuristics used in AI.

5 Discuss the trade-offs involved in selecting or designing heuristic CO3 L2 10M

functions. How can a well-designed heuristic impact the efficiency


of search algorithms?

6 Develop a scenario and design a heuristic function for a specific CO3 L3 6M


problem. Justify your choices.

7 Construct and describe the principles of greedy best-first search as CO3 L3 10M
an informed search strategy. How does it make use of heuristic
information?

8 Discuss the advantages and limitations of greedy best-first search. CO3 L2 10M
Provide examples of scenarios where it is effective or inefficient.

9 Compare and contrast greedy best-first search with other informed CO3 L2 7M

Department of ECE, Vemana IT Prepared by: Chandra Prabha Nagarajan


Page 1 of 3
Intelligent Systems and Machine Learning Algorithms(BEC515A) Question Bank – Module 3

and uninformed search strategies.

10 Explain the A* search algorithm, emphasizing the role of heuristic CO3 L2 10M

functions in its operation.

11 Discuss the properties of an admissible heuristic. How does an CO3 L2 8M


admissible heuristic contribute to the optimality of A* search?

12 Analyze a problem and design a suitable heuristic for A* search. CO3 L4 8M

Discuss the impact of the heuristic on the algorithm's performance.

13 Define knowledge-based agents and explain their role in AI systems. CO3 L1 10M
How do they differ from other types of intelligent agents?

14 Discuss the advantages and challenges associated with CO3 L2 5M


implementing knowledge-based agents in real-world applications.

15 Provide examples of scenarios where knowledge-based agents excel CO3 L2 5M


in decision-making.

16 Describe the Wumpus World environment and its significance in AI. CO3 L2 10M
What challenges does the Wumpus World pose for intelligent
agents?

17 Develop a knowledge-based agent for navigating and solving CO3 L3 10M


problems in the Wumpus World. Discuss the considerations in
designing such an agent.

18 Define propositional logic and its role in representing knowledge in CO3 L1 8M


AI systems. How does propositional logic differ from other logic
systems?

19 Discuss the strengths and limitations of using propositional logic for CO3 L2 7M

Department of ECE, Vemana IT Prepared by: Chandra Prabha Nagarajan


Page 2 of 3
Intelligent Systems and Machine Learning Algorithms(BEC515A) Question Bank – Module 3

knowledge representation in AI.

20 Construct examples of real-world applications where propositional CO3 L3 8M


logic is effectively employed.

21 Explain the common reasoning patterns used in propositional logic. CO3 L2 5M

22 Provide examples of how these reasoning patterns can be applied in CO3 L2 7M

problem-solving and decision-making.

23 Analyze a scenario and demonstrate the application of reasoning CO3 L4 10M


patterns in propositional logic to derive conclusions.

24 Construct the syntax and semantics of propositional logic by the CO3 L3 8M


way in which the truth of sentences is determined with the truth
table.

Course Faculty
1. Dr. Suneeta
2. Chandraprabha N
3. Raghuveer C M

Department of ECE, Vemana IT Prepared by: Chandra Prabha Nagarajan


Page 3 of 3

You might also like