ASSIGNMENT – 1
Branch ECE Class/Sem III/VI
Subject code & OCS351 - ARTIFICIAL INTELLIGENCE AND MACHINE Max.
50
Name LEARNING FUNDAMENTALS Marks
Course Outcomes: RBT
CO1 Understand the foundations of AI and the structure of Intelligent Agents U
CO2 Use appropriate search algorithms for any AI problem AP
CO3 Study of learning methods AP
CO4 Solving problem using Supervised learning AP
CO5 Solving problem using Unsupervised AP
learning
RBT CO Marks
Answer All Questions
1 Explain the structure and types of intelligent agents with suitable 1 10
U
diagrams and examples.
2 Describe in detail the Breadth-First Search and Depth-First Search 1 10
algorithms with their advantages, disadvantages, and complexity U
analysis.
3 Discuss the characteristics of an environment. How do these U 1 10
characteristics affect the design of agents? Provide examples.
4 Formulate a real-world problem (e.g., path finding, puzzle solving) as 1 10
a search problem and compare how different uninformed search U
strategies would solve it.
5 Explain Uniform-Cost Search (Dijkstra’s Algorithm) in detail.
Compare it with Breadth-First Search. Include a step-by-step AP 10
1
example.
Faculty In Charge HOD IQAC Director
Branch ECE Class/Sem III/VI
Subject code & OCS351 - ARTIFICIAL INTELLIGENCE AND MACHINE Max.
50
Name LEARNING FUNDAMENTALS Marks
Course Outcomes: RBT
CO1 Understand the foundations of AI and the structure of Intelligent Agents U
CO2 Use appropriate search algorithms for any AI problem AP
CO3 Study of learning methods AP
CO4 Solving problem using Supervised learning AP
CO5 Solving problem using Unsupervised AP
learning
RBT CO Marks
Answer All Questions
1 Explain the structure and types of intelligent agents with suitable 1 10
U
diagrams and examples.
2 Describe in detail the Breadth-First Search and Depth-First Search 1 10
algorithms with their advantages, disadvantages, and complexity U
analysis.
3 Discuss the characteristics of an environment. How do these U 1 10
characteristics affect the design of agents? Provide examples.
4 Formulate a real-world problem (e.g., path finding, puzzle solving) as 1 10
a search problem and compare how different uninformed search U
strategies would solve it.
5 Explain Uniform-Cost Search (Dijkstra’s Algorithm) in detail.
Compare it with Breadth-First Search. Include a step-by-step AP 10
1
example.
Faculty In Charge HOD IQAC Director
