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: 2076, syllabus wise question

Applications of AI
1.
How the concept of machine vision are used in Robotics to configure sensors of Robots? [5]
Intelligent Agents
1.
Discuss the types of environment where an agent can work on. [5]
Introduction
1.
What is AI? How can you define AI from the perspective of thought process? [5]
Knowledge Representation
1.
How resolution algorithm is used in FOPL to infer conclusion? Consider the facts; Anyone whom Pugu loves is a star. Any hero who does not rehearse does not act. Anmol is a hero. Any hero who does not work does not rehearse. Anyone who does not act is not a star. Convert above into FOPL and use resolution to infer that “If Anmol does not work, then Pugu does not love Anmol”. [10]
2.
Define frame. How knowledge is encoded in a frame? Justify with an example. [5]
3.
What do you mean by membership of an element in a fuzzy set? Given a domain of discourse X={10, 20, 30, 40, 50, 60, 70}, construct a fuzzy set from X. Use your own assumptions for defining membership. [5]
4.
How uncertain knowledge is represented? Given following full joint probability distribution representing probabilities of having different sizes of CD, find the probability that a CD cover has a length of 130mm given the width is 15mm.

$\begin{array}{|c|c|c|c|c|}\hline \text{y=Width} & \text{x=Length} & 129 & 130 & 131 \\ \hline 15 & & 0.12 & 0.42 & 0.06 \\ 16 & & 0.08 & 0.28 & 0.04 \\ \hline \end{array}$
[5]
5.
How syntactic and semantic analysis is done during natural language processing? Explain with example. [5]
Machine Learning
1.
Define mathematical model of artificial neural network. Discuss how Hebbian learning algorithm can be used to train a neural network. Support your answer with an example. [10]
2.
Write an algorithm for learning by Genetic Approach. [5]
Problem Solving by Searching
1.
Construct a state space with appropriate heuristics and local costs. Show that Greedy Best First search is not complete for the state space. Also illustrate A* is complete and guarantees solution for the same state space. [10]
2.
Illustrate with an example, how uniform cost search algorithm can be used for finding goal in a state space. [5]