THE UNIVERSITY OF AZAD JAMMU AND KASHMIR MUZAFFARABAD

(DEPARTMENT OF CS&IT)
(Terminal Examination, Spring-2021)

Course Code: CS-4103 Class: MCS-4th Date: 07-08-2021

Total Marks: 50 Time: 7 hrs. (9AM to 4PM)

Course Instructor: Dr. Wajid Arshad Abbasi

Cell No./WhatsApp No.: +923005383210
Email: wajidarshad@ajku.edu.pk (use to send answer sheets in pdf)

Special Instructions (read prudently)

Students must carefully read and understand the following instructions before attempting the paper.
1. This paper must be handwritten on a paper sheet (legal size, with minimum space between lines).
2. The answer sheet of this paper (after scanning and converting it into pdf format) must be submitted
to the course instructor via email only within the stipulated time. Answer sheets received late
will not be entertained/graded and considered as absent/failed.
3. The name of the PDF file should be in this format: Roll Number-Student Name-course Code.
4. All answer sheets will be assessed for plagiarism (cheating/copying) and material found
plagiarized/copied will lead to the initiation of a cheating case against the student(s) involved.
5. The first page of the answer sheet must have the Name of the student, Class, Semester, Roll
number, the Course title, and Course code.
6. For any queries please contact the course instructor through WhatsApp.

Answer all questions.

1. Each of the following questions requires a brief answer. (10x2=20 marks)

a. Relate search techniques with Artificial Intelligence.
b. What is the difference between hill climbing and greedy local search (GLS)?
c. On what problems simulated annealing is preferred over GLS?
d. What is the difference between cross over and mutation in GAs?
e. How probability works in simulated annealing?
f. What do you mean by search space?
g. What is a deep blue?
h. What is the main problem in local search techniques?
i. Relate machine learning with AI?
j. Name any best AI application of your choice.
2. Considering the following figure.

Construct a complete state space along with actions to arrange the tiles in the
descending order. (10 marks)
3. Formulate 8 Queen problem to be solved through simulated annealing and dry run the
simulated annealing algorithms to show its working. (5+5 marks)

This PDF document was edited with Icecream PDF Editor.

Page 1|2
Upgrade to PRO to remove watermark.
 4. Consider the search problem shown in Fig. 1, start from a and f is the destination.

a) Would you prefer DFS or BFS for this problem? Why? (5 marks)
b) Write sequence of nodes explored by BFS and DFS. (5 marks)

Best of Luck
Dr. Wajid Arshad Abbasi

This PDF document was edited with Icecream PDF Editor.

Page 2|2
Upgrade to PRO to remove watermark.