COS3751 october
november exam
pack 2022/2023
[TURN PAGE]
UNIVERSITY EXAMINATIONS
January/February 2022
COS3751
Techniques of Artificial Intelligence
100 Marks
Duration 2 Hours
This is an open book exam
The use of a calculator is allowed
EXAMINERS:
FIRST: Prof I Sanders/F Bankole
SECON...
Duration 2 Hours
This is an open book exam
The use of a calculator is allowed
EXAMINERS:
FIRST: Prof I Sanders/F Bankole
SECOND: Prof E van der Poel
EXTERNAL: Prof P Machanick (Rhodes University)
This paper consists of 18 pages.
Instructions
1. You are expected to provide your own answers to the questions. Getting an-
swers from the Internet (or other sources) could result in disciplinary action.
2. You may type your answers in a word processor (and then print to PDF for
submission) or handwrite your answers (and then scan to PDF).
3. Answer all questions.
4. The mark for each question is given in brackets next to each question.
5. Read each question carefully before answering: always make sure you pro-
vide an answer to what is being asked.
6. Follow the instructions as sent to you by the university to submit your an-
swers.
7. Make sure you leave yourself enough time to upload your answers before
the end of the allowed time.
Remember to complete the Honesty Declaration when submitting your an-
swers. By submitting your answers you are confirming that this is your
own, unaided work.
[TURN PAGE]
, COS3751
QUESTIONS 2 January/February 2022
Unisa general instructions
• Students must upload their answer scripts in a single PDF file (answer
scripts must not be password protected or uploaded as “read only” files).
• No e-mailed scripts will be accepted.
• Students are advised to preview submissions (answer scripts) to ensure
legibility and that the correct answer script file has been uploaded.
• Students are permitted to resubmit their answer scripts should their initial
submission be unsatisfactory.
• Incorrect file format and uncollated answer scripts will not be considered.
• Incorrect answer scripts and/or submissions made on unofficial examina-
tions platforms (including the invigilator cellphone application) will not be
marked and no opportunity will be granted for resubmission.
• A mark awarded for an incomplete submission will be the student’s final
mark. No opportunity for resubmission will be granted.
• A mark awarded for illegible scanned submission will be the student’s final
mark. No opportunity for resubmission will be granted.
• Submissions will only be accepted from registered student accounts.
• Students who have not utilised invigilation or proctoring tools will be sub-
jected to disciplinary processes.
• Students suspected of dishonest conduct during the examinations will be
subjected to disciplinary processes. Unisa has a zero tolerance for plagia-
rism and/or any other forms of academic dishonesty.
• Students are provided one hour to submit their answer scripts after the offi-
cial examination time.
• Submissions made after the official examination time will be rejected by the
examination regulations and will not be marked.
• Students experiencing network or load shedding challenges are advised to
apply for an aegrotat and submit supporting evidence within three days of
the examination session.
• Students experiencing technical challenges should contact theSCSC on
080 000 1870 or via email Examenquiries@unisa.ac.za or refer to
the Get-Help resource for the list of additional contact numbers.
• Only communication received from your myLife account will be con-
sidered.
[TURN PAGE]
, COS3751
QUESTIONS 3 January/February 2022
Question 1 Intelligent Agents [16]
Searching for an X
This question involves a problem-solving agent. The environment for this problem is a 1× n
tiled strip. The tiles are all painted white on the side that is visible to the agent. Exactly one
tile has an X painted on it. The situation is as shown in Figure 1.
The agent starts in position (0) (the first tile in the strip) and must find which tile is marked
with the X.
... X ...
0
Figure 1: The tiled and labelled strip
(a) Wh
at kind of agent would be needed to solve this problem? Explain your answer. (3)
(b) D
efine a mathematical representation for the problem. This representation should be
sufficient to store all of the information required to solve the problem. (2)
(c) Sh
ow the initial state using the representation given in b above? (2)
(d) Sh
ow the goal state using the representation given in b above? (2)
T – goal found
Or a reasonable goal state based on their representation
(e) Determine an appropriate cost function for solving this problem.
Justify your answer. (3)
(f) Define the appropriate actions for this
problem. Then using the successor function
Result(a, S) 1→ St,
show how applying each action a to some state S results in some state St.
Note: for the purposes of this question you do not need to describe how the actions
could be executed. (4)
[TURN PAGE]
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through EFT, credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying this summary from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Tutor23. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy this summary for R61,06. You're not tied to anything after your purchase.
