Scribd
Upload
12 views2 pages

CS 361 Quiz - Model Answer

This document is a quiz for the course AI 361 at Misr University for Science and Technology, focusing on Artificial Neural Networks. It includes true or false questions about artificial intelligence logic and a problem-solving section related to search algorithms. The quiz is scheduled for February 5, 2024, and is worth a total of 20 marks.

Uploaded by

karim.mamdoh125
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

CS 361 Quiz - Model Answer

This document is a quiz for the course AI 361 at Misr University for Science and Technology, focusing on Artificial Neural Networks. It includes true or false questions about artificial intelligence logic and a problem-solving section related to search algorithms. The quiz is scheduled for February 5, 2024, and is worth a total of 20 marks.

Uploaded by

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

Misr University for Science and Technology Course Code: AI 361

College of Information Technology Title: Artificial Neural Network


Quiz1 Date: Thursday 2/5/2024 Instructor: Dr. Mostafa Mohamed
Quiz1 Time: 30 min Exam (1)
Qiuz1 Marks: 20 Marks Semester: Spring 2024

Student Name: Student ID#:

Question 1: -
True or False Questions (10 Marks)

1- A sentence in the context of artificial intelligence logic is a command in a programming language


False
2- Propositional logic uses symbols such as P, Q, and R to represent propositions.

True

3- Logical connectives include symbols like 'not', 'and', 'or', 'implication', and 'biconditional'.

True

4- In propositional logic, a model assigns a truth value to some, but not all, propositional symbols.

False

5- Inference is the process of obtaining old sentences from new ones.

False

1|Page
Question 2: -

Problem solving as search (10 Marks)

Consider the search graph shown on the right. S is the start state and G is the goal state. Edges are
annotated with their cost. The table shows the values for each node for three different heuristic
functions: h1, h2 and h3. give the path that will be returned, or write none if no path will be returned
by the following algorithms

(a) Depth-first graph search (2 Marks)

S-A-G

(b) Breadth-first graph search (2 Marks)

S-A-G

(c) is heuristic h1 admissible? (2 Marks)

YES

(d) is heuristic h2 admissible? (2 Marks)

YES

(d) is heuristic h3 admissible? (2 Marks)

NO

2|Page

You might also like