UGC NET Computer Science Artificial Intelligence (AI) Previous Year Questions (PYQs) – Page 1 of 9
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 82 questions
The process of removing details from a given state representation is called ______
1
2
3
4
Solution
Abstraction means hiding or removing unnecessary details and keeping only important information.
So, removing details from a state representation is called abstraction.
So, removing details from a state representation is called abstraction.
Which of the following is NOT true in problem solving in artificial intelligence?
1
2
3
4
Solution
AI problem solving commonly uses heuristic search.
In AI, solution steps may not always be explicit, and knowledge may be imprecise.
Repetition mechanism is mainly a feature of conventional algorithmic programming, not a special feature of AI problem solving.
In AI, solution steps may not always be explicit, and knowledge may be imprecise.
Repetition mechanism is mainly a feature of conventional algorithmic programming, not a special feature of AI problem solving.
Which of the following is not a property of a good system for representation of knowledge in a particular domain?
1
2
3
4
Solution
A good knowledge representation system has the following properties:
Representational adequacy
Inferential adequacy
Inferential efficiency
Acquisitional efficiency
Here, “Presentation adequacy” is not a standard property.
For the fuzzy set
$A = {(x_1,0.3),(x_2,0.7),(x_3,0.4)}$, the complement of $A$ would be represented as:
$A = {(x_1,0.3),(x_2,0.7),(x_3,0.4)}$, the complement of $A$ would be represented as:
1
2
3
4
Solution
Complement of fuzzy set:
$\mu_{A'}(x) = 1 - \mu_A(x)$
Compute:
$x_1$: $1 - 0.3 = 0.7$
$x_2$: $1 - 0.7 = 0.3$
$x_3$: $1 - 0.4 = 0.6$
Thus,
$A' = {(x_1,0.7),(x_2,0.3),(x_3,0.6)}$
Which of the following is not the most common property in social network?
1
2
3
4
Solution
Common properties of social networks:
• Scale-free degree distribution → True
• Small world property → True
• Short average path length → True
However, most social networks are not necessarily directed; many are modeled as undirected networks.
Thus the statement that is not a common property is:
Which is not the component of the natural language understanding process?
1
2
3
4
Solution
Morphological analysis, semantic analysis and pragmatic analysis are standard components of natural language understanding.
Meaning analysis is not a standard separate component because meaning is covered under semantic analysis.
Which is not a basic approach to the problem of conflict resolution in a production system?
1
2
3
4
Solution
In a production system, conflict resolution can be based on the rule matched, the object matched, or the action of the matched rule.
But assigning preference based on the action that the matched object would perform is not a standard conflict resolution approach.
n a database, a rule is defined as $((P_1 \text{ and } P_2) \text{ or } P_3) \to R_1(0.8)$ and $R_2(0.3)$, where $P_1, P_2, P_3$ are premises and $R_1, R_2$ are conclusions of rules with certainty factors $(CF)$ $0.8$ and $0.3$ respectively. If any running program has produced $P_1, P_2, P_3$ with $CF$ as $0.5, 0.8, 0.2$ respectively, find the $CF$ of results on the basis of premises.
1
2
3
4
Solution
Given,
$CF(P_1)=0.5,\ CF(P_2)=0.8,\ CF(P_3)=0.2$
For AND operation,
$CF(P_1 \text{ and } P_2)=\min(0.5,0.8)=0.5$
For OR operation,
$CF((P_1 \text{ and } P_2) \text{ or } P_3)=\max(0.5,0.2)=0.5$
Now,
$CF(R_1)=0.5 \times 0.8=0.40$
$CF(R_2)=0.5 \times 0.3=0.15$
Which of the following statements are true?
(A) A sentence $\alpha$ entails another sentence $\beta$ if $\beta$ is true in few worlds where $\alpha$ is true.
(B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form.
(C) Sound inference algorithms derive all sentences that are entailed.
(D) Propositional logic does not scale to environments of unbounded size.
Choose the correct answer from the options given below:
(A) A sentence $\alpha$ entails another sentence $\beta$ if $\beta$ is true in few worlds where $\alpha$ is true.
(B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form.
(C) Sound inference algorithms derive all sentences that are entailed.
(D) Propositional logic does not scale to environments of unbounded size.
Choose the correct answer from the options given below:
1
2
3
4
Solution
Statement (A) is false.
Entailment means if $\alpha$ is true, then $\beta$ must be true in all models where $\alpha$ is true.
Correct definition is:
$\alpha\models\beta$
means $\beta$ is true in every model in which $\alpha$ is true.
But statement (A) says few worlds, so it is false.
Statement (B) is true.
Forward chaining and backward chaining are natural reasoning algorithms for Horn form knowledge bases.
Statement (C) is false.
Sound inference algorithm derives only those sentences that are logically entailed.
But deriving all entailed sentences is the property of completeness, not soundness.
Statement (D) is true.
Propositional logic does not scale well to environments of unbounded size because it cannot represent general rules using variables and quantifiers.
Therefore, true statements are (B) and (D).
Entailment means if $\alpha$ is true, then $\beta$ must be true in all models where $\alpha$ is true.
Correct definition is:
$\alpha\models\beta$
means $\beta$ is true in every model in which $\alpha$ is true.
But statement (A) says few worlds, so it is false.
Statement (B) is true.
Forward chaining and backward chaining are natural reasoning algorithms for Horn form knowledge bases.
Statement (C) is false.
Sound inference algorithm derives only those sentences that are logically entailed.
But deriving all entailed sentences is the property of completeness, not soundness.
Statement (D) is true.
Propositional logic does not scale well to environments of unbounded size because it cannot represent general rules using variables and quantifiers.
Therefore, true statements are (B) and (D).
Which of the following statements are true?
(A) Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in next level.
(B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined.
(C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm.
(D) Optimal play in games of imperfect information does not require reasoning about the current and future belief states of each player.
Choose the correct answer from the options given below:
(A) Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in next level.
(B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined.
(C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm.
(D) Optimal play in games of imperfect information does not require reasoning about the current and future belief states of each player.
Choose the correct answer from the options given below:
1
2
3
4
Solution
Minimax search is generally implemented using depth-first search, not breadth-first search.
Statement (B) is true.
Alpha-beta pruning depends highly on the order in which states are examined.
If the best moves are examined first, more pruning is possible.
Statement (C) is true.
Alpha-beta pruning does not change the final result of minimax.
It only reduces the number of nodes examined.
So, alpha-beta search computes the same optimal move as minimax.
Statement (D) is false.
In games of imperfect information, optimal play requires reasoning about current and future belief states of each player.
Therefore, true statements are (B) and (C).
Statement (B) is true.
Alpha-beta pruning depends highly on the order in which states are examined.
If the best moves are examined first, more pruning is possible.
Statement (C) is true.
Alpha-beta pruning does not change the final result of minimax.
It only reduces the number of nodes examined.
So, alpha-beta search computes the same optimal move as minimax.
Statement (D) is false.
In games of imperfect information, optimal play requires reasoning about current and future belief states of each player.
Therefore, true statements are (B) and (C).
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
