Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Bachelors Level/Second Year/Fourth Semester/Science csit/fourth semester/artificial intelligence/syllabus wise questions

B.Sc Computer Science and Information Technology

Institute of Science and Technology, TU

Artificial Intelligence (CSC266)

Year Asked: 2080, syllabus wise question

Applications of AI
1.
Describe the components of expert system. [5]
Intelligent Agents
1.
What are the properties of intelligent agent? How simple reflex agents work? Give an example of simple reflex agent. [5]
2.
Using your own assumptions, design PEAS framework for following intelligent agents. a. Covid-19 prediction system b. Vaccine recommender system. [5]
Introduction
1.
What is Turing Test? What properties an agent should have to pass the Turing Test? [5]
Knowledge Representation
1.
Write the rules to convert statements in predicate logic into CNF form. Convert the following sentences into FOPL. All students of BSC CSIT are intelligent person. All friends of intelligent person are smart. Laxmi is a friend of Rojina. Rojina is smart. All beautiful students are girl. Laxmi is beautiful. Using resolution algorithm infer that 'Laxmi is smart'. [10]
2.
How knowledge is represented using frames? Represent following knowledge using frames. Ram is name of an employee. His age is 27. He is male. He belongs to the department HR, where the number of employees is 110 and the average salary of the department is Rs. 45000. All departments are under Tribhuvan University. The organization type of Tribhuvan University is Educational. [5]
3.
Why pragmatic analysis is necessary in NLP? How pragmatic analysis is done? [5]
Machine Learning
1.
What is the role of activation function in ANN. How sigmoid function works? Discuss about perceptron learning. [10]
2.
Define selection, crossover, and mutation operations in genetic algorithm. [5]
Problem Solving by Searching
1.
Prepare state space graph for the following puzzle problem, where only move left, move right, move up and move down actions are allowed. On the so constructed state space, label the states as A, B, C, ......Z and use the greedy best to test whether it finds the goal or not. Initial state and goal state are shown below. Assume the path cost from one step to another as 1 and heuristic function, f(n), as a number of misplaced cells.

$\text{Initial State:} \; \begin{array}{|c|c|}\hline 1 & 2 \\ \hline \end{array} \qquad \text{Goal State:} \; \begin{array}{|c|c|}\hline & 1 \\ \hline 2 & \\ \hline \end{array}$
[10]
2.
Why alpha beta pruning is necessary? How alpha beta pruning is done in game search, illustrate with an example. [5]
3.
How iterative deepening search is used to find path from initial state to goal state in state space representation of any problem? Illustrate with an example. [5]