UGC NET · PAPER 2
UGC NET Paper 2 Computer Science – Unit 10: Artificial Intelligence (AI) PYQ (December 2023)
Q37. What is the generic structure of a Multi-Agent System (MAS)?
- Single agent with multiple objectives
- Multiple agents with single objectives
- Multiple agents with diverse objectives and communication abilities
- Multiple agents with two objectives
Q38. A point x ∈ X of a fuzzy set A at which μA(x) = 0.5 is called a:
- Core
- Support
- Crossover
- α-cut
Q39. In a genetic algorithm optimization problem, the fitness function is f(x) = x² − 4x + 4. Given a population of four individuals with x values {1.5, 2.0, 3.0, 4.5}, what is the fitness value of the individual that will be selected as the parent for reproduction in one generation?
- 2.25
- 6.0
- 0.0
- 6.25
Q40. In a feed-forward neural network, the input layer has 4 neurons, the hidden layer 3 neurons and the output layer 2 neurons, all using the sigmoid activation. Inputs: [0.5, 0.8, 0.2, 0.6]. Input→hidden weights: W1 = [0.1, 0.3, 0.5, 0.2], W2 = [0.2, 0.4, 0.6, 0.2], W3 = [0.3, 0.5, 0.7, 0.2]. Hidden→output weights: W4 = [0.4, 0.1, 0.3], W5 = [0.5, 0.2, 0.4]. What is the output of the output layer (rounded to two decimals)?
- [0.62, 0.68]
- [0.72, 0.78]
- [0.82, 0.88]
- [0.92, 0.98]
Q64. Which of the following are commonly used parsing techniques in NLP for syntactic analysis?
(A) Top-down parsing
(B) Bottom-up parsing
(C) Dependency parsing
(D) Statistical machine translation
(E) Earley parsing
Choose the correct answer from the options given below:
(A) Top-down parsing
(B) Bottom-up parsing
(C) Dependency parsing
(D) Statistical machine translation
(E) Earley parsing
Choose the correct answer from the options given below:
- (A), (C), (D), (E) Only
- (B), (C), (D), (E) Only
- (A), (B), (C), (E) Only
- (A) and (B) Only
Q65. In the context of alpha-beta pruning in game trees, which of the following statements are correct regarding cut-off procedures?
(A) Alpha-beta pruning can eliminate subtrees with certainty when the value of a node exceeds the alpha/beta bounds.
(B) The primary purpose of alpha-beta pruning is to save computation time by searching fewer nodes in the same tree.
(C) Alpha-beta pruning guarantees the optimal solution in all cases by exploring the entire game tree.
(D) Alpha and beta bounds are initialised to negative and positive infinity respectively at the root node.
Choose the correct answer from the options given below:
(A) Alpha-beta pruning can eliminate subtrees with certainty when the value of a node exceeds the alpha/beta bounds.
(B) The primary purpose of alpha-beta pruning is to save computation time by searching fewer nodes in the same tree.
(C) Alpha-beta pruning guarantees the optimal solution in all cases by exploring the entire game tree.
(D) Alpha and beta bounds are initialised to negative and positive infinity respectively at the root node.
Choose the correct answer from the options given below:
- (A), (C), (D) Only
- (B), (C), (D) Only
- (A), (B), (D) Only
- (C), (B) Only
Q73. Match List I with List II
| List I | List II |
|---|---|
| (a) Greedy best-first search | (I) Space complexity is linear in the depth d of the deepest optimal solution |
| (b) A* | (II) Incomplete even if the search space is finite |
| (c) Recursive best-first search | (III) Optimal if the optimal solution is reachable; otherwise returns the best reachable solution |
| (d) SMA* | (IV) Computation and space complexity are too high |
- (a)-(II), (b)-(IV), (c)-(I), (d)-(III)
- (a)-(II), (b)-(III), (c)-(I), (d)-(IV)
- (a)-(III), (b)-(II), (c)-(IV), (d)-(I)
- (a)-(III), (b)-(IV), (c)-(II), (d)-(I)
Q75. Match List I with List II (space complexity)
| List I | List II |
|---|---|
| (a) Hill climbing | (I) O(bd) |
| (b) Best first search | (II) O(bd) |
| (c) A* search | (III) O(1) |
| (d) Depth first search | (IV) O(bm) |
- (a)-(III), (b)-(I), (c)-(IV), (d)-(II)
- (a)-(II), (b)-(I), (c)-(IV), (d)-(III)
- (a)-(II), (b)-(IV), (c)-(I), (d)-(III)
- (a)-(I), (b)-(III), (c)-(II), (d)-(IV)
Q83. Arrange the following encoding strategies used in Genetic Algorithms (GAs) in the correct sequence, starting from the initial step and ending with the final representation of solutions:
(a) Binary encoding
(b) Real-valued encoding
(c) Permutation encoding
(d) Gray coding
Choose the correct answer from the options given below:
(a) Binary encoding
(b) Real-valued encoding
(c) Permutation encoding
(d) Gray coding
Choose the correct answer from the options given below:
- (d), (b), (a), (c)
- (b), (d), (a), (c)
- (c), (d), (a), (b)
- (b), (c), (a), (d)
Q85. Arrange the following steps in the correct sequence for applying K-means clustering to a data set:
(a) Randomly initialise cluster centroids
(b) Assign each data point to the nearest cluster centroid
(c) Update the cluster centroids based on the mean of the points assigned to each cluster
(d) Specify the number of clusters K
(e) Repeat steps (b) and (c) until convergence
Choose the correct answer from the options given below:
(a) Randomly initialise cluster centroids
(b) Assign each data point to the nearest cluster centroid
(c) Update the cluster centroids based on the mean of the points assigned to each cluster
(d) Specify the number of clusters K
(e) Repeat steps (b) and (c) until convergence
Choose the correct answer from the options given below:
- (d), (a), (b), (c), (e)
- (a), (b), (c), (d), (e)
- (c), (b), (a), (d), (e)
- (d), (c), (a), (b), (e)