Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Artificial Intelligence Past Papers, Papers of Artificial Intelligence

University of Gujrat (UG)Artificial Intelligence

This include papers of Artificial Intelligence including mid and final in academic year 2021

Typology: Papers

2020/2021

Available from 08/24/2022

tx-tech
tx-tech 🇵🇰

3 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Mid Term Exam
Artificial Intelligence
Question No-1: Differentiate the following with the help of diagram. Marks [2+2+2=6]
a. Explain the condition with the help of an example.” your heuristic cost should never be
overestimated.”
b. Briefly compare and contrast a depth first search technique with a breadth first search technique under
the following headings: (i) Reaching Optimal Solutions and (ii) Memory Efficiency
c. Distinguish between blind search and adversarial search, indicating the similarities and differences
between these approaches.
Question No-2: Considering the following figure, determine which heuristic is admissible? Marks [4]
Question-3: State the Following Marks [4]
(a)
Figure 1
1. What is the order of states expanded using Depth First Search?
2. What is the order of states expanded using Breadth First Search?
3. What is the order of states expanded using Best First Search?
4. What is the order of states expanded using Iterative deepening Search?
Time allowed: 2:30 Hrs
Maximum Marks: 25
Credit Hours: 3
Course Code: CS-331
pf3

Partial preview of the text

Download Artificial Intelligence Past Papers and more Papers Artificial Intelligence in PDF only on Docsity!

Mid Term Exam

Artificial Intelligence

Question No- 1 : Differentiate the following with the help of diagram. Marks [ 2 +2+2=6] a. Explain the condition with the help of an example.” your heuristic cost should never be overestimated.” b. Briefly compare and contrast a depth first search technique with a breadth first search technique under the following headings: (i) Reaching Optimal Solutions and (ii) Memory Efficiency c. Distinguish between blind search and adversarial search, indicating the similarities and differences between these approaches. Question No-2: Considering the following figure, determine which heuristic is admissible? Marks [ 4 ] Question- 3 : State the Following Marks [ 4 ] (a) Figure 1

  1. What is the order of states expanded using Depth First Search?
  2. What is the order of states expanded using Breadth First Search?
  3. What is the order of states expanded using Best First Search?
  4. What is the order of states expanded using Iterative deepening Search? Time allowed: 2:30 Hrs Maximum Marks: 25 Credit Hours: 3 Course Code: CS- 331

(b) Apply minimax to the game tree in Figure 2. Which move should be chosen if the root is a maximizing player? Which move should be chosen if the root is a minimizing player? Marks [ 4 ] Figure 2 (c) Consider the following game tree in which static scores are from the maximising player’s point of view. Which move should be chosen? Which nodes need not be examined in a left to right alpha-beta pruning? Which nodes need not be examined in a right to left alpha-beta pruning? Marks [ 4 ]