Scribd
Upload
8 views4 pages

Question 1 (20 Marks) : A) Select The Correct Answer (4 Marks)

The document consists of exam questions related to search strategies, propositional logic, and semantic networks. It includes multiple-choice questions, true/false statements, and problem-solving tasks involving logical propositions and search algorithms. The exam covers various topics in artificial intelligence and computational logic, requiring students to demonstrate their understanding and application of these concepts.

Uploaded by

ski superhuman
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
8 views4 pages

Question 1 (20 Marks) : A) Select The Correct Answer (4 Marks)

The document consists of exam questions related to search strategies, propositional logic, and semantic networks. It includes multiple-choice questions, true/false statements, and problem-solving tasks involving logical propositions and search algorithms. The exam covers various topics in artificial intelligence and computational logic, requiring students to demonstrate their understanding and application of these concepts.

Uploaded by

ski superhuman
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/ 4

L.

x zo

Question 1{20 marks]


A) Select the correct answer (4 marks)
1- The search strategy which is complete, i.e., always finds a soh:tion if there is one.
a) Breadth -first search b) Depth-first search

2- The search strategy which is optimal, i.e., always finds the best solution.
a) Greedy search b) Uniform search

3- In constraints satisfaction problems, the heuristic which orders the variable to consider is
a) Minimum remainin g value b) Degree heuri stic

4- In game playin g, a function used to evaluate each move "board configuration " to
decide what is the best single move to make next is called
a) Utility function b) heuri stic function

B) Compare between the followin (6 rna rks)


Search Informed search strategies Uninformed search strategies
Strategy
Techniques

Advantage

---
Dis-
advantage

Exam is only 7
pages
B) State True/False (Explain in case of false) [10 marks]
1- The class precedence list i s used by the inference mechanism in semantic network

2- The primary purpose of the OPEN list in search is to produce the path from the goa l node found
back to the initial state

3- A lgorithm A* =U niform Cost Search + Greedy Search

4- In semantic network s, nodes are used to represent relationships between the objects

5- Unlike standard search problem , CSP is consider the state as a "bl ack box"

6- Informed search requires domain-specific know ledge about the probl em

7- The backtrackin g techniqu e used for sol ving a CSP apply breadth first with single variable
assignment at each leve l

8- In order to improve the efficiency of generated and test algorithms, heuristic is used to select
the variables

9- Alpha-Beta is a breath first search algorithm

10- Any knowledge repr esentation language is d e fined by only syntax and sem atic aspects

Exam is only 7
pages
Question 2 [20 marks]
2.1 Find a proposition with three variables p, q, and r that is true when p and r are true
and q is false, and false otherwise. [ 1 marks]

2.2 Find a proposition with three variables p, q, and r that is never true. [1 marks]

2.3 Determin e whether p (q r) and p (q A r) are equivalent . [1 marks)

2.4 Determine whether this proposition is a tautology: ((p _,g) A q) _,p. [2 marks]
2.5 A student is asked to give the negation of ·'all bananas are ripe". [3 marks]
a) The student respond s "no bananas are ripe". Explain why this is not
correct.

b) Another student says that the negation of the statement is "some bananas are
ripe".
Expl ain why this is not correct.

c) Give the correct nega


tion.

2.6 Consider the following sentences:


• The members of Giza Club are Moham ed, Mona, and Iman .
• Mohamed is married to Mona.
• Am ir is !man 's brother.
• The partner (husband/wife) of every married person in the Club is also in the
Club.
• The last meeting was at Mohamed's house.

a) Translate these (premises) sentences into Predicate Logic using the following
predicates: member/ 1. married/2, brother/2, lastmeeting/ 1 [4 marks]

b) Convert the premises into conjunctive normal form (CNF). [4 marks)

c) Prove the following sentence is true given the premise s using Proof by
Resolution : [4 marks]
The last meeting of the Club was at Mona's house.
Note that the sentence should be proved to be true. If you cannot reach this
conclu sion, then add the necessary sentence to your knowledge base and then
construct the proof.

Question 3 [20 marks]


A) In the search tree below, the G node is a goa l node, List the nodes created by:
1- Breadth Depth
2- The iterati ve-deepening algorithm [4
marks]
Exam is only 7
pages
/

v
Bj Apply the minimax algorithm to the partial gam e tree bel ow, where it is the maximum's tum to
pl ay. Write the estimated va lues of the intermediate nod es inside their circles, and indicate the
proper move of the maximum by circling one of the root's outgoing arcs. Then, list leaf nodes
which could be pruned when using Alpha-Beta. [4 marks]

C) Consider the following search space where we want to find a path from the start state
S to the goal state G. The following table shows two different heuristic functions hi and h2.
[12 marks]

5
'"--
[;\/ (? NODE Hi
A 3
H2
5

v y /
2 B 4 2
c 2 5

&.- (rVs
D 5 '>
.)

G 0 0
D
J
Give the solution paths fou nd using each of the heuristic functions, for the following search algorithms:
1- Greedy Best-First
2- Un iform
Cost 3- A *
algorith m

Greedy Best-First

Exam is only 7
pages

You might also like