‫الذكاء االصطناعي‬

‫‪11:30-12:30‬‬
‫‪17/4/2024‬‬
‫أ‪.‬د‪/‬عبد الرحمن حيدر‬
‫‪Faculty of Computers & Information, Assiut University‬‬
‫‪Course code: CS361‬‬
‫‪3rd Level‬‬
‫‪Midterm Exam‬‬
‫‪Duration: One hour‬‬
‫‪This exam for the following program(s) : CS‬‬

‫* اإلسم الرباعي (بالعربي فقط( ‪1.‬‬

‫إسماعيل محمد إسماعيل القط‬

‫* رقم الجلوس ‪2.‬‬

‫‪162021059‬‬

‫* المستوي ‪3.‬‬

‫االول‬

‫الثاني‬

‫الثالث‬

‫الرابع ‪2014‬‬

‫الرابع ‪2015‬‬

‫الرابع ‪2016‬‬

‫الرابع ‪2017‬‬
 ‫الرابع ‪2018‬‬

‫الرابع ‪2019‬‬

‫الرابع ‪2020‬‬

‫* البرنامج ‪4.‬‬

‫عام‬

‫بايو‬

‫هندسة‬

‫ذكاء صناعي‬

‫* رقم المعمل ‪5.‬‬

‫‪٠‬ج‬

‫‪٠‬د‬

‫‪٠‬هـ‬

‫‪١‬ب‬

‫‪١‬ج‬

‫‪١‬د‬

‫‪١‬هـ‬

‫‪٢‬أ‬

‫‪٢‬ب‬

‫‪٢‬ج‬

‫‪٢‬د‬
 ‫هـ‬٢

‫أ‬٣

‫ب‬٣

‫ج‬٣

‫د‬٣

‫هـ‬٣

‫أ‬٤

‫ب‬٤

‫ج‬٤

‫د‬٤

‫هـ‬٤

6. ‫* رقم الكمبيوتر‬

21

7. (‫* الكود (قد تمت مراجعة بيانات الطالب ورقم الجلوس‬

SXRK

Will be reviewed

8. To study the AI foundation of deriving formal rules to draw valid conclusions needs
background from:

Philosophy

Mathematics
 Economics

Neuroscience

Will be reviewed

9. In Depth-First Search, the time complexity is worth than the space complexity.

True

False

Will be reviewed

10. In passing Turing test, which AI application is related to store and retrieve information
provided before or during interrogation?

Natural language processing

Knowledge representation

Automated reasoning

Machine learning

Will be reviewed

11. IAs can be represented a function from the domain of perception to the range of actions.

True

False

Will be reviewed
12. Give the main steps of the hill-climbing search algorithm.

The main steps of hill-climbing is :

1-Evaluate the initial state ,if it is goal state then return success and stop.

2-Generate a new state in the neigbourhood of the current state.

3-if the new state is better than the current state ,then assign the new state as a current state.
Else continue the loop.

4-if the new state is the goal state , then return success and quit.

5-loop until a solution is found or there no new update.

Will be reviewed

13. To study the AI foundation of making decisions to maximize the payoff needs
background from:

Philosophy

Mathematics

Economics

Neuroscience

Will be reviewed

14. A* search uses an admissible heuristic that may overestimate the solution costs.

True

False
 Will be reviewed

15. In passing Turing test, which AI application is related to communicate with a pearson?

Natural language processing

Knowledge representation

Automated reasoning

Machine learning

Will be reviewed

16. Reactive agents do not have internal symbolic models can be classified as:

Simple Reflex Agents

Model-based Agents

Goal-based Agents

Utility-based Agents

Will be reviewed

17. “The art of creating machines that perform functions that require intelligence when
performed by people”. The previous definition of AI is about ………

thinking humanly

acting humanly

thinking rationally

acting rationally
 Will be reviewed

18. Iterative deepening search only uses linear space and not much more time than other
uniformed search strategies.

True

False

Will be reviewed

19. If the environment can change while an agent is deliberating, then we say the
environment is ………

discrete

non-episodic

dynamic

stochastic

Will be reviewed

20. Explain the main difference in using the best-first search strategy in informed and
uninformed search spaces.

in informed search it need to know some information before doing any thing but in
uninformed it doesn't know any information before go

Will be reviewed

21. Simulated annealing is a controlled random-walk algorithm.

True
 False

Will be reviewed

22. Goal formulation is the process of deciding what actions and states to consider, given a
goal.

True

False

Will be reviewed

23. “To what extent is the agent able to make decisions and actions on its own” is the degree
of ………

autonomy

mobility

rationality

social ability

Will be reviewed

24. Achieving AI using biological research means studying and formalizing common sense
facts about the world and the problems that the world presents to the achievement of
goals.

True

False

Will be reviewed
25. IAs cannot act reactively, but sometimes proactively.

True

False

Will be reviewed

26. ……… algorithm escapes local maxima by allowing some “bad” moves but gradually
decreases their size and frequency.

Local beam search

Simulated annealing

Hill climbing

Descent method

Will be reviewed

27. The local beam search algorithm keeps track of a number of states rather than just one.

True

False

Will be reviewed

28. Expanding the most desirable unexpanded node is a theme of the Depth-First Search.

True

False
 Will be reviewed

29. The uniform-cost search strategy is implemented by a frontier that is a ……… queue in
ascending order by path cost.

FIFO

LIFO

FILO

priority

This content is created by the owner of the form. The data you submit will be sent to the form owner. Microsoft is not responsible
for the privacy or security practices of its customers, including those of this form owner. Never give out your password.
Microsoft Forms | AI-Powered surveys, quizzes and polls Create my own form
Privacy and cookies | Terms of use