Artificial Intelligence NTA UGC NET Question Analysis
| Q.1➡ | UGC NET DEC 2023 Match List – I with List – II. List – I (A) Greedy Best first search (B) A* (C) Recursive best first search (D) SMA* List – II (I) The space complexity as O(d) where d = depth of the deepest optimal solution (II) Incomplete even if the search space is finite (III) Optimal if optimal solution is reachable otherwise return the best reachable optimal solution (IV) Computation and space complexity is two light Choose the correct answer from the options given below : |
| i ➥ (A)-(II), (B)-(IV), (C)-(I), (D)-(III) |
| ii ➥ (A)-(II), (B)-(III), (C)-(I), (D)-(IV) |
| iii ➥ (A)-(III), (B)-(II), (C)-(IV), (D)-(I) |
| iv ➥ (A)-(III), (B)-(IV), (C)-(II), (D)-(I) |
| Best Explanation: Answer: (I) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.2➡ | UGC NET DEC 2023 In the content 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 certainly when the value of a node exceeds both the alpha and beta bonds. (B) The primarily purpose of Alpha-Beta proning 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 bonds are initialized to negative and positive infinity respectively at the root note. Choose the correct answer from the options given below: |
| i ➥ (A), (C), (D) Only |
| ii ➥ (B), (C), (D) Only |
| iii ➥ (A), (B), (D) Only |
| iv ➥ (C), (B) Only |
| Best Explanation: Answer: (III) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.3➡ | UGC NET DEC 2023 In a genetic algorithm optimization problem the fitness function is defined as f(x) = x²-4x +4. Given a population of four individuals with values of x: (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? |
| i ➥ 2.25 |
| ii ➥ 6.0 |
| iii ➥ 0.0 |
| iv ➥ 6.25 |
| Best Explanation: Answer: (IV) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.4➡ | UGC NET DEC 2023 Match List – I with List – II. List – I (A) Hill climbing (B) Best first search (C) A* Search (D) Depth first search List – II (I) O(b ^ d) (II) O(bd) (III) O(1) (IV) O(b ^ m) Choose the correct answer from the options given below : |
| i ➥ (A)-(III), (B)-(I), (C)-(IV), (D)-(II) |
| ii ➥ (A)-(II), (B)-(I), (C)-(IV), (D)-(III) |
| iii ➥ (A)-(II), (B)-(IV), (C)-(I), (D)-(III) |
| iv ➥ (A)-(1), (B)-(II), (C)-(II), (D)-(I) |
| Best Explanation: Answer: (I) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.5➡ | UGC NET DEC 2023 Which of the following are commonly used parsing techniques in NLP (Natural Language Processing) for syntatic 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 : |
| i ➥ (A), (C), (D), (E) Only |
| ii ➥ (B), (C), (D), (E) Only |
| iii ➥ (A), (B), (C), (E) Only |
| iv ➥ (A) and (B) Only |
| Best Explanation: Answer: (III) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.6➡ | UGC NET DEC 2023 In a feed forward neural network with the following specifications: Input layer has 4 neurons, hidden layer has 3 neurons and output layer has 2 neurons using the sigmoid activation function for given input values [0.5, 0.8, 0.2, 0.6] as well as the initial weights for the connections. Input layer to hidden layer 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 layer to output layer weights W4: [0.4, 0.1, 0.3] W5: [0.5, 0.2, 0.4] What is the output of the output layer when the given input values are passed through neural network? Round the answer to two decimal places: |
| i ➥ [0.62, 0.68] |
| ii ➥ [0.72, 0.78] |
| iii ➥ [0.82, 0.88] |
| iv ➥ [0.92, 0.98] |
| Best Explanation: Answer: (I) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.7➡ | UGC NET DEC 2023 What is the generic structure of Multi Agent System (MAS) ? |
| i ➥ Single agent with multiple objectives |
| ii ➥ Multiagents with a single objectives |
| iii ➥ Multiagents with diverse objectives and communication abilities |
| iv ➥ Multiagent with two objectives |
| Best Explanation: Answer: (III) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.8➡ | UGC NET DEC 2023 A point of fuzzy set A is a point x∈X at which μΑ(x) = 0.5 |
| i ➥ Core |
| ii ➥ Support |
| iii ➥ Crossover |
| iv ➥ α-cut |
| Best Explanation: Answer: (III) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.9➡ | UGC NET DEC 2023 Arrange the following steps in the correct sequence for applying an unsupervised learning technique such as K-means clustering is to a data set: (A) Randomly initialize cluster centroids (B) Assign each data point to nearest cluster centroid (C) Update the cluster centroids based on the mean of data points assigned to each cluster (D) Specify the number of clusters (K) to partation the data into (E) Repeat steps B and C until convergence criteria are met Choose the correct answer from the options given below: |
| i ➥ (D), (A), (B), (C), (Ε) |
| ii ➥ (A), (B), (C), (D), (E) |
| iii ➥ (C), (B), (A), (D), (E) |
| iv ➥ (D), (C), (A), (B), (Ε) |
| Best Explanation: Answer: (I) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.10➡ | UGC NET DEC 2023 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 : |
| i ➥ (D), (B), (A), (C) |
| ii ➥ (B), (D), (A), (C) |
| iii ➥ (C), (D), (A), (B) |
| iv ➥ (B), (C), (A), (D) |
| Best Explanation: Answer: (III) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.11➡ | UGC NET JUNE 2023 Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Dendral is an expert system Reason R: The rationality of an agent is not related to its reaction to the environment. In the light of the above statements, choose the correct answer from the options given below. |
| i ➥ Both A and R are true and R is the correct explanation of A |
| ii ➥ Both A and R are true but R is NOT the correct explanation of A |
| iii ➥ A is true but R is false |
| iv ➥ A is false but R is true |
| Best Explanation: Answer: III Explanation: DENDRAL, an early expert system, was initiated in 1965 by AI researcher Edward Feigenbaum and geneticist Joshua Lederberg, both from Stanford University in California. Initially known as Heuristic DENDRAL, it specialized in chemical analysis. The system could analyze complex compounds, such as those composed of carbon, hydrogen, and nitrogen, using spectrographic data. DENDRAL’s capability to hypothesize molecular structures from this data demonstrated performance comparable to expert chemists. The program found applications in both industry and academia. |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.12➡ | UGC NET JUNE 2023 An observational technique that can be used to understand operational process and help to derive requirement for software to support operational process is known as. |
| i ➥ Requirement specification |
| ii ➥ Structural specification |
| iii ➥ Ethnography |
| iv ➥ Natural language specification |
| Best Explanation: Answer: III Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.13➡ | UGC NET JUNE 2023 Match List I with List II List I A. Expert system B. Fuzzy system C. Operator in genetic algorithm D. Supervised technique List II I. Decision tree II. Scramble III. Inference engine IV. Mycin Choose the correct answer from the options given below: Choose the correct answer from the options given below: |
| i ➥ A-IV B-I C-III D-II |
| ii ➥ A-III B-IV C-II D-I |
| iii ➥ A-IV B-III C-II D-I |
| iv ➥ A-I B-II C-III D-IV |
| Best Explanation: Answer: III Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.14➡ | UGC NET JUNE 2023 Which is not the component of the natural language understanding process? |
| i ➥ Morphological analysis |
| ii ➥ Semantic analysis |
| iii ➥ Pragmatic analysis |
| iv ➥ Meaning analysis |
| Best Explanation: Answer: IV Explanation: Meaning analysis, is not a component of the natural language understanding process. Meaning analysis is a broader term that encompasses the entire process of understanding natural language. The other three options are all specific components of the process. * Morphological analysis is the process of breaking down words into their constituent morphemes. * Semantic analysis is the process of understanding the meaning of words and phrases. * Pragmatic analysis is the process of understanding the meaning of utterances in context. Therefore, the answer is iv, meaning analysis. |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.15➡ | UGC NET JUNE 2023 Which of the following is not a property of a good system for representation of knowledge in a particular domain? |
| i ➥ Presentation adequacy |
| ii ➥ infrential adequacy |
| iii ➥ Infential efficiency |
| iv ➥ acquisitional efficiency |
| Best Explanation: Answer: I Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.16➡ | UGC NET JUNE 2023 Which of the following is not a solution representation in a genetic algorithm? |
| i ➥ Binary valued |
| ii ➥ Real valued |
| iii ➥ Permutation |
| iv ➥ Combinations |
| Best Explanation: Answer: IV Explanation: In a genetic algorithm, various representations can be used to encode potential solutions to the problem being optimized. The choice of representation depends on the nature of the problem and the encoding that best suits it. Some common solution representations in genetic algorithms include: 1. Binary Representation: Solutions are represented as strings of binary digits (0s and 1s). 2. Real-Valued Representation: Solutions are represented as arrays of real numbers. 3. Permutation Representation: Solutions are represented as permutations of a set of elements. 4. Integer Representation: Solutions are represented as arrays of integers. 5. Tree Representation: Solutions are represented as tree structures, often used for problems with hierarchical or tree-like structures. 6. Path Representation: Solutions are represented as paths or sequences, often used for problems like the Traveling Salesman Problem. The representation chosen should match the problem’s characteristics and make it possible to perform genetic operations such as crossover and mutation effectively. The choice of representation depends on the specific problem being solved. Answer is (IV) |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.17➡ | UGC NET JUNE 2023 Given below are two statements: Statement I: Fuzzifier is a part of a fuzzy system Statement II: Inference engine is a part of fuzzy system In the light of the above statements, choose the most appropriate answer from the options given below. |
| i ➥ Both Statement I and Statement II are correct |
| ii ➥ Both Statement I and Statement II are incorrect |
| iii ➥ Statement I is correct but Statement II is incorrect |
| iv ➥ Statement I is incorrect but Statement II is correct |
| Best Explanation: Answer: I Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.18➡ | UGC NET JUNE 2023 Consider universe positive integer X = {1 <= n <= 8} proposition P = “n is an even integers”, Q= “(3 <= n <= 7) ^(n≠6) “. Then truth set of P ↔ Q is |
| i ➥ {1,4} |
| ii ➥ {2,6} |
| iii ➥ {3,4,5} |
| iv ➥ {1} |
| Best Explanation: Answer: I Explanation: Upload Soon |
UGC NET Computer Science June 2023 Previous Year Question with Solution
| Q.19➡ | UGC NET JUNE 2023 Which of the following is not a mutation operator in a genetic algorithm? A. Random resetting B. Scramble C. Inversion D. Difference Choose the correct answer from the options given below: |
| i ➥ A and B only |
| ii ➥ B and D only |
| iii ➥ C and D only |
| iv ➥ D only |
| Best Explanation: Answer: IV Explanation: The mutation operators mentioned are commonly used in genetic algorithms: A. Random resetting: This is a mutation operator where a randomly selected gene is reset to a new random value. B. Scramble: This is a mutation operator that involves randomly selecting a subset of genes and changing their positions in the chromosome. C. Inversion: This mutation operator involves selecting a subset of genes and reversing their order. D. Difference: The term “Difference” is not a standard mutation operator in genetic algorithms. So, the correct answer is: D. Difference |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.20➡ | UGC NET JUNE 2023 Consider the following statements about heap sort algorithm: A. The MAX-HEAPIFY procedure which runs in O lg(n) time, is the key to maintaining the max heap property B. The BUILD-MAX-HEAP procedure, which runs in O lg(n) time, produces max-heap from an unordered input array C. The MAX-HEAP-INSERT, which runs in O (lg n) time, implements the insertion operation D. The HEAP-INCREASE-KEY procedure runs in O (n lg n) time, to set the key of new node of its correct value Choose the correct answer from the options given below: |
| i ➥ A, B only |
| ii ➥ A, C only |
| iii ➥ B, D only |
| iv ➥ A, B, C, D |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.21➡ | UGC NET JUNE 2023 Which is not a basic approach to the problem of conflict resolution in a production system? |
| i ➥ Assigning a preference based on the rule that matched |
| ii ➥ Assigning a preference based the object that matched |
| iii ➥ Assigning a preference based on the action that the matched rule would perform |
| iv ➥ Assigning a preference based on the action that the matched object would perform |
| Best Explanation: Answer: IV Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.22➡ | UGC NET JUNE 2023 Consider the following statements A. C-Fuzzy means clustering is a supervised method of learning B. PCA is used for dimension reduction C. Apriori is not a supervised technique D. When a machine learning model becomes so specially tuned to its exact input data that it fails to generalize to other similar data it is called underfitting. Choose the correct answer from the options given below: |
| i ➥ A and B |
| ii ➥ B and C |
| iii ➥ C and D |
| iv ➥ D and A |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.23➡ | NET December 2022 The negation of “Some students like hockey” is |
| i ➥ Some students dislike hockey |
| ii ➥ Every student dislike hockey |
| iii ➥ Every student like hockey |
| iv ➥ All students like hockey |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.24➡ | NET December 2022 Overfitting is expected when we observe that? |
| i ➥ With training iterations error on training set as well as test set decreases |
| ii ➥ With training iterations error on training set decrease but test set increases |
| iii ➥ With training iterations error on training set as well as test set increases |
| iv ➥ With training iterations training set as well as test error remains constant |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.25➡ | NET December 0222 The A* algorithm is optimal when, |
| i ➥ It always find the solution with the lowest total cost if the heuristic ‘h’ is admissible |
| ii ➥ Always finds the solution with the highest total cost if the heuristic ‘h’ is admissible. |
| iii ➥ Finds the solution with the lowest total cost if the heuristic ‘h’ is not admissible. |
| iv ➥ It always finds the solution with the highest total cost if the heuristic ‘h’ is not admissible. |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.26➡ | NET December 2022 Which Artificial intelligence technique enables the computers to understand the associations and relationships between objects & events? |
| i ➥ Heuristic processing |
| ii ➥ Cognitive science |
| iii ➥ Relative symbolism |
| iv ➥ Pattern matching |
| Best Explanation: Answer: (iv) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.27➡ | NET December 2022 Where does the value of alpha- beta search get updated ? |
| i ➥ Along the path of search |
| ii ➥ Initial state itself |
| iii ➥ At the end |
| iv ➥ None of these. |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.28➡ | NET December 2022 4-input neuron has weight 1, 2, 3, 4 . The transfer function is linear with the constant of proportionality being equal to 3. The inputs are 5, 7, 10, and 30 respectively. the output will be : |
| i ➥ 120 |
| ii ➥ 213 |
| iii ➥ 410 |
| iv ➥ 507 |
| Best Explanation: Answer: (iv) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.29➡ | NET December 2022 Which AI system mimics the evolutionary process to generate increasingly better solution to a process to a problem? (A) Self-organizing neural network (B) Back propagation neural network (C) Generic algorithm (D) Forward propagation neural network Choose the correct answer from the options given below: |
| i ➥ A only |
| ii ➥ B only |
| iii ➥ C only |
| iv ➥ D only |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.30➡ | NET December 2022 Consider the following Learning algorithms. (A) Logistic regression (B) Back propagation (C) Linear regression (D) Forward propagation Which of the following options represents classification algorithm? Choose the correct answer from the options given below: |
| i ➥ A and C only |
| ii ➥ B and D only |
| iii ➥ A and B only |
| iv ➥ C and D only |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.31➡ | NET December 2022 Which Boolean operation on two variables can be represented by a single perception layer? (A) X1 AND X2 (B) X1 OR X2 (C) X1 NOR X2 (D) X1 XOR X2 Choose the most appropriate answer from the options given below: |
| i ➥ A and B only |
| ii ➥ B and C only. |
| iii ➥ A, B and C only |
| iv ➥ A, B, C and D only |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.32➡ | NET December 2022 March List(I) with List (II)  Choose the correct answer from the options given below: |
| i ➥ A-(I), B-(II), C-(I), D-(II) |
| ii ➥ A-(II), B-(II), C-(I), D-(II) |
| iii ➥ A-(I), B-(II), C-(II), D-(I) |
| iv ➥ A-(II), B-(II), C-(II), D-(I) |
| Best Explanation: Answer: (iv) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.33➡ | NET December 2022 consider the statements: A : There does not exist a polynomial time algorithm to solve integer Linear programming problem. B : Main focus of PERT is ‘minimizing time’ . Choose the correct option about the statements A and B. |
| i ➥ A is True; B is True |
| ii ➥ A is True; B is False |
| iii ➥ A is False; B is True |
| iv ➥ A is False; B is False |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.34➡ | NET December 2022 Select the correct order of DBSCAN Algorithm. (A) Find recursively all its density connected points and assign them to the same cluster as the core point. (B) Find all the neighbor point with eps and identify the core points with more than MinPts neighbor’s. (C) Iterate through the remaining unvisited pointed in the dataset. (D) For each core point if it is not already assigned to a cluster, create a new cluster. Choose the correct answer from the following: |
| i ➥ B, D, C, A |
| ii ➥ D, B, C, A |
| iii ➥ B, D, A, C |
| iv ➥ D, B, A, C |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.35➡ | NET December 2022 Choose the correct option describing the features of artificial neural network (A) It is essentially machine learning algorithm. (B) It is useful when solving the problems for which the data set is very large. (C) They are able to extract features without input from the programmer. (D) These are system modeled on the human brain and nervous system Choose the correct answer from the options given below: |
| i ➥ All the statements are correct |
| ii ➥ Only B and C are correct |
| iii ➥ Only A and D are correct |
| iv ➥ All the statements are not correct. |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.36➡ | NET December 2022 Four person: P, Q, R and S are in police custody and one of them has committed a crime. They confess as follows: (A) Person P: Q did it (B) Person Q: S did it (C) Person R: I did not do it (D) Person S: Q lied If exactly one of the statements is false. Which of the following is the guilty person? |
| i ➥ P |
| ii ➥ Q |
| iii ➥ R |
| iv ➥ S |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.37➡ | NET June 2022 |
| i ➥ (A) and (D) only |
| ii ➥ (B) and (C) only |
| iii ➥ (A) and (C) only |
| iv ➥ (B) and (C) only |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.38➡ | NET June 2022 The logic expression (P̃∧Q)∨(P∧Q̃)∨(P∧Q) is equivalent to |
| i ➥ P̃∨Q |
| ii ➥ P∨Q̃ |
| iii ➥ P∨Q |
| iv ➥ P̃∨Q̃ |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.39➡ | NET June 2022 Given below are two statements : one is labelled as assertion (A) and the other is labelled as Reason (R): Assertion (A) : p̃ Reason (R) : (r→q̃ , r→s , s→q̃ , p→q) In the light of the above statements, choose the correct answer from the options given below: |
| i ➥ Both (A) and (R) are true and (R) is the correct explanation of (A) |
| ii ➥ Both (A) and (R) are true but (R) is NOT correct explanation of (A) |
| iii ➥ (A) is true but (R) is false |
| iv ➥ (A) is false but (R) is true |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.40➡ | NET June 2022 In a game playing search tree, upto which depth α-β pruning can be applied? (A) Root (0) level (B) 6 level (C) 8 level (D) Depends on utility value in a breadth order Choose the correct answer from the options given below : |
| i ➥ (B) and (C) only |
| ii ➥ (A) and (B) only |
| iii ➥ (A) , (B) and (C) only |
| iv ➥ (A) and (D) only |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.41➡ | NET June 2022 |
| i ➥ Both statement (I) and statement (II) are correct |
| ii ➥ Both statement (I) and statement (II) are incorrect |
| iii ➥ Statement (I) is correct and statement (II) is incorrect |
| iv ➥ Statement (I) is incorrect and statement (II) is correct |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.42➡ | NTA UGC NET December 2021 Which agent deals with the happy and unhappy state? |
| i ➥ Goal-based Agent |
| ii ➥ Learning Agent |
| iii ➥ Model-based agent |
| iv ➥ Utility-based agent |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Utility-based agent | Help-Line |
| Q.43➡ | NTA UGC NET December 2021 Consider the sentence below. There is a country that borders both India and Pakistan. Which of the following logical expressions express the above sentence correctly when the predicate Country(x) represents that x is a country and Borders(x, y) represents that the countries x and y share the border? |
| i ➥ [∃c Country(c)] ⇒ [Border (c, India) ∧ Border (c,Pakistan)] |
| ii ➥ ∃c Border (Country(c), India ∧ Pakistan) |
| iii ➥ ∃c Country(c) ∧ Border (c, India) ∧ Border (c,Pakistan) |
| iv ➥ ∃c Country(c) ⇒ [Border (c, India) ∧ Border (c,Pakistan)] |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Propositional logic | Help-Line |
| Q.44➡ | NTA UGC NET December 2021 Which among the following statement(s) is(are) FALSE? A. Greedy best-first search is not optimal but is often efficient. B. A* is complete and optimal provided h(n) is admissible or consistent. C. Recursive best-first search is efficient in terms of time complexity but poor in terms of space complexity. D. h(n) = 0 is an admissible heuristic for the 8-puzzle. |
| i ➥ A and D only |
| ii ➥ A only |
| iii ➥ C and D only |
| iv ➥ C only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.45➡ | NTA UGC NET December 2021 Given below are two statements Statement I: Breadth-First Search is optimal when all the step costs are equal whereas uniform-cost se optimal with any step-cost. Statement II: When all the step costs are same uniform-cost search expends more nodes at depth d tha Breadth-First Search. In light of the above statements, choose the correct answer from the options given below |
| i ➥ Both Statement I and Statement II are false |
| ii ➥ Both Statement I and Statement II are true |
| iii ➥ Statement I is false but Statement II is true |
| iv ➥ Statement I is true but Statement II is false |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.46➡ | NTA UGC NET December 2021 Consider the given tree below. Calculate the value at the root of the tree using alpha-beta pruning algorithm.  |
| i ➥ 3 |
| ii ➥ 5 |
| iii ➥ 6 |
| iv ➥ 9 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.47➡ | NTA UGC NET December 2021 Next five questions are based on the following passage. Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below.  The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ____. |
| i ➥ 0.216 |
| ii ➥ 0.280 |
| iii ➥ 0.400 |
| iv ➥ 0.600 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Probability | Help-Line |
| Q.48➡ | NTA UGC NET December 2021 Next five questions are based on the following passage. Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below. P(cavity U toothache) is________________. |
| i ➥ 0.120 |
| ii ➥ 0.200 |
| iii ➥ 0.280 |
| iv ➥ 0.600 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Probability | Help-Line |
| Q.49➡ | NTA UGC NET December 2021 Next five questions are based on the following passage. Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below. The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache U catch) is _______. |
| i ➥ 0.4615 |
| ii ➥ 0.5384 |
| iii ➥ 0.6000 |
| iv ➥ 0.8000 |
Show Answer With Best Explanation
= 0.4615| More Discussion | Explanation On YouTube | Probability | Help-Line |
| Q.50➡ | NTA UGC NET December 2021 Next five questions are based on the following passage. Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below. The marginal probability of cavity P(cavity) is _____. |
| i ➥ 0.080 |
| ii ➥ 0.120 |
| iii ➥ 0.200 |
| iv ➥ 0.216 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Probability | Help-Line |
| Q.51➡ | NTA UGC NET December 2021 Next five questions are based on the following passage. Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2×2×2 table as shown in the figure below. The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is ____. |
| i ➥ 0.216 |
| ii ➥ 0.280 |
| iii ➥ 0.400 |
| iv ➥ 0.600 |
Show Answer With Best Explanation
= 0.6| More Discussion | Explanation On YouTube | Probability | Help-Line |
| Q.52➡ | NTA UGC NET November 2020 Consider the statement below. A person who is radical (R) is electable (E) if he/she is conservative (C), but otherwise is not electable. Few probable logical assertions of the above sentence are given below. (A) (R∧E)⇔C (B) R→(E↔C) (C) R⇒((C⇒E)∨¬E) (D) (¬R∨¬E∨C)∧(¬R∨¬C∨E) Which of the above logical assertions are true? Choose the correct answer from the options given below: |
| i ➥ (B) only |
| ii ➥ (C) only |
| iii ➥ (A) and (C) only |
| iv ➥ (B) and (D) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.53➡ | NTA UGC NET November 2020 Consider the following argument with premise  |
| i ➥ This is a valid argument. |
| ii ➥ Steps (C) and (E) are not correct inferences |
| iii ➥ Steps (D) and (F) are not correct inferences |
| iv ➥ Step (G) is not a correct inference |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.54➡ | NTA UGC NET November 2020 Given below are two statements: Statement I: A genetic algorithm is a stochastic hill climbing search in which a large population of states is maintained. Statement II: In a nondeterministic environment, agents can apply AND-OR search to generate containing plans that reach the goal regardless of which outcomes occur during execution. In the light of the above statements, choose the correct answers from the options given below. |
| i ➥ Both Statement I and Statement II are true |
| ii ➥ Both Statement I and Statement II are false |
| iii ➥ Statement I is correct but Statement II is false |
| iv ➥ Statement I is incorrect but Statement II is true |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.55➡ | NTA UGC NET November 2020 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 the 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 the 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: |
| i ➥ (A) and (C) only |
| ii ➥ (A) and (D) only |
| iii ➥ (B) and (C) only |
| iv ➥ (C) and (D) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.56➡ | NTA UGC NET November 2020 Which of the following statements are true? A) A sentence α entails another sentence ß if ß is true in few words where α 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: |
| i ➥ (A) and (B) only |
| ii ➥ (B) and (C) only |
| iii ➥ (C) and (D) only |
| iv ➥ (B) and (D) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.57➡ | NTA UGC NET November 2020 Which of the following pairs of propositions are not logically equivalent? |
| i ➥ ((p→r)∧(q→r)) and ((p∨q)→r) |
| ii ➥ p↔q and (¬p↔¬q) |
| iii ➥ ((p∧q)∨(¬p∧¬q)) and p↔q |
| iv ➥ ((p∧q)→r) and ((p→r)∧(q→r)) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.58➡ | NTA UGC NET November 2020  Choose the correct answer from the options given below |
| i ➥ A-II, B-IV, C-I, D-III |
| ii ➥ A-II, B-III, C-I, D-IV |
| iii ➥ A-III, B-II, C-IV, D-I |
| iv ➥ A-III, B-IV, C-II, D-I |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.59➡ | NTA UGC NET November 2020 If f(x) = x is my friend, and p(x) = x is perfect then correct logical translation of the statement “some of my friends are not perfect” is__________. |
| i ➥ ∀ (f(x) ∧ ¬ p(x)) |
| ii ➥ ∃ (f(x) ∧ ¬ p(x)) |
| iii ➥ ¬ (f(x) ∧ ¬ p(x)) |
| iv ➥ ∃ ( ¬ f(x) ∧ ¬ p(x)) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.60➡ | NTA UGC NET November 2020 Match List I with List II  Choose the correct answer from the options given below: |
| i ➥ A-I, B-IV, C-III, D-II |
| ii ➥ A-I, B-II, C-III, D-IV |
| iii ➥ A-II, B-I, C-III, D-IV |
| iv ➥ A-II, B-IV, C-III, D-I |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.61➡ | NTA UGC NET November 2020 Which of the following is NOT true in problem solving in artificial intelligence? |
| i ➥ Implements heuristic search techniques |
| ii ➥ Solution steps are not explicit |
| iii ➥ Knowledge is imprecise |
| iv ➥ it works on or implements repetition mechanism |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.62➡ | NTA UGC NET December 2019 Let Wo represents weight between node i at layer k and node j at layer (k – 1) of a given multilayer perceptron. The weight updation using gradient descent method is given by Where α and E represents learning rate and Error in the output respectively? |
| i ➥ Wij(t+1)=Wij(t)+α ∂E/∂Wij , 0<=α<=1 |
| ii ➥ Wij(t+1)=Wij(t)-α ∂E/∂Wij , 0<=α<=1 |
| iii ➥ Wij(t+1)=α ∂E/∂Wij , 0<=α<=1 |
| iv ➥ Wij(t+1)= – α ∂E/∂Wij , 0<=α<=1 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.63➡ | NTA UGC NET December 2019 Consider the following learning algorithms: (a) Logistic regression (b) Back propagation (c) Linear repression Which of the following option represents classification algorithms? |
| i ➥ (a) and (b) only |
| ii ➥ (a) and (c) only |
| iii ➥ (b) and (c) only |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.64➡ | NTA UGC NET December 2019 Consider the following: (a) Trapping at local maxima (b) Reaching a plateau (c) Traversal along the ridge. Which of the following option represents shortcomings of the hill climbing algorithm? |
| i ➥ (a) and (b) only |
| ii ➥ (a) and (c) only |
| iii ➥ (b) and (c) only |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.65➡ | NTA UGC NET December 2019 An _ chart is a project schedule representation that presents project plan as a directed graph. The critical path is the____________sequence of_________tasks and it defines project __________. |
| i ➥ Activity, Shortest, Independent, Cost |
| ii ➥ Activity, Longest, Dependent, Duration |
| iii ➥ Activity, Longest, Independent, Duration |
| iv ➥ Activity, Shortest, Dependent, Duration |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.66➡ | NTA UGC NET December 2019  |
| i ➥ 14 |
| ii ➥ 17 |
| iii ➥ 111 |
| iv ➥ 112 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.67➡ | NTA UGC NET December 2019 According to Dempster-Shafer theory for uncertainty management, Where Bel(A) denotes Belief of event A. |
i ➥  |
ii ➥  |
iii ➥  |
iv ➥  |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.68➡ | NTA UGC NET June 2019 Consider the following methods: M 1 : mean of maximum M 2 : Centre of area M 3 : Height method Which of the following is/are defuzzification method(s)? |
| i ➥ Only M 1 |
| ii ➥ Only M 1 and M 2 |
| iii ➥ Only M 2and M 3 |
| iv ➥ M 1 , M 2 and M 3 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.69➡ | NTA UGC NET June 2019 A fuzzy conjunction operator denoted as t(x,y) and fuzzy disjunction operator denoted as s(x,Y) form dual pair if they satisfy the condition: |
| i ➥ t(x,y)= 1-s(x,y) |
| ii ➥ t(x,y)=s(1-x,1-y) |
| iii ➥ t(x,y)=1-s(1-x,1-y) |
| iv ➥ t(x,y)=s(1+x,1+y) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.70➡ | NTA UGC NET June 2019 Consider the following: (a) Evolution (b) Selection (c) reproduction (d) Mutation Which of the following are found in genetic algorithms? |
| i ➥ (b),(c) and (d) only |
| ii ➥ (b) and (d) only |
| iii ➥ (a),(b),(c) and (d) |
| iv ➥ (a),(b) and (d) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.71➡ | NTA UGC NET June 2019 Let Aα0 denotes the α-cut of a fuzzy set A at α0. If α1 < α2 , then |
| i ➥ Aα1 ⊇ Aα2 |
| ii ➥ Aα1 ⊃ Aα2 |
| iii ➥ Aα1 ⊆ Aα2 |
| iv ➥ Aα1 ⊂ Aα2 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.72➡ | NTA UGC NET June 2019 Match List-I with List-II:  Choose the correct option from those given below: |
| i ➥ (a)-(i); (b)-(ii); (c)-(iii) |
| ii ➥ (a)-(iii);(b)-(ii); (c)-(i) |
| iii ➥ (a)-(i); (b)-(iii); (c)-(ii) |
| iv ➥ (a)-(ii); (b)-(iii); (c)-(i) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.73➡ | NTA UGC NET June 2019 Which of the following is an example of unsupervised neural network? |
| i ➥ Back propagation network |
| ii ➥ Hebb network |
| iii ➥ Associative memory network |
| iv ➥ Self-organizing feature map |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.74➡ | NTA UGC NET June 2019 The STRIPS representation is |
| i ➥ a feature-centric representation |
| ii ➥ an action-centric representation |
| iii ➥ a combination of feature-centric and action-centric representation |
| iv ➥ a hierarchical feature-centric representation |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.75➡ | NTA UGC NET June 2019 Consider the game tree given below:  |
| i ➥ 4 |
| ii ➥ 7 |
| iii ➥ 11 |
| iv ➥ 12 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.76➡ | NTA UGC NET December 2018 Consider the following terminology and match List 1 and List 2 and choose the correct answer from the code given below b= branch factor d= depth of shallowest solution bd M= Maximum depth of the search tree I= depth limit  |
| i ➥ (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i) |
| ii ➥ (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i) |
| iii ➥ (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii) |
| iv ➥ (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.77➡ | NTA UGC NET December 2018 Match the List 1 and List 2 and choose the correct answer from the code given below  |
| i ➥ (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv) |
| ii ➥ (a)-(ii), (b)-(i),(c)-(iii), (d)-(iv) |
| iii ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) |
| iv ➥ (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.78➡ | NTA UGC NET December 2018 Which of the following is true for semi-dynamic environment ? |
| i ➥ The environment itself does not change with the passage of time but the agent’s performance score does. |
| ii ➥ The environment change while the agent is deliberating. |
| iii ➥ Even if the environment changes with the passage of time while deliberating, the performance score does not change. |
| iv ➥ Environment and performance score, both change simultaneously. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.79➡ | NTA UGC NET December 2018 Consider the following statements S1: A heuristic is admissible if it never overestimates the cost to reach the goal S2: A heuristic is monotonous if it follows triangle inequality property. Which one of the following is true referencing the above statements? |
| i ➥ Statement S1 is true but statement S2 is false. |
| ii ➥ Statement S1 is false but statement S2 is true. |
| iii ➥ Neither of the statements S1 and S2 are true |
| iv ➥ Both the statements S1 and S2 are true. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.80➡ | NTA UGC NET December 2018 An agent can improve its performance by |
| i ➥ Learning |
| ii ➥ Responding |
| iii ➥ Observing |
| iv ➥ Perceiving |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.81➡ | NTA UGC NET December 2018 In PERT/CPM, the merge event represents___________ of two or more events. |
| i ➥ splitting |
| ii ➥ completion |
| iii ➥ beginning |
| iv ➥ joining |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.82➡ | NTA UGC NET December 2018 Match List 1 with List 2 and choose the correct answer from the code given below  |
| i ➥ (a)-(iv), (b)-(iii), (c) -(ii), (d)-(i) |
| ii ➥ (a)-(i), (b)-(iv), (c) -(iii), (d)-(ii) |
| iii ➥ (a)-(iv), (b)-(i), (c) -(ii), (d)-(iii) |
| iv ➥ (a)-(i), (b)-(ii), (c) -(iii), (d)-(iv) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.83➡ | NTA UGC NET December 2018  What will be the value propagated at the root ? |
| i ➥ 6 |
| ii ➥ 3 |
| iii ➥ 5 |
| iv ➥ 4 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.84➡ | NTA UGC NET Consider following two rules R1 and R2 in logical reasoning in Artificial Intelligence (AI):  |
| i ➥ Only R1 is correct. |
| ii ➥ Only R2 is correct. |
| iii ➥ Only R2 is correct. |
| iv ➥ Neither R1 nor R2 is correct. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.85➡ | NTA UGC NET In Artificial Intelligence (AI), what is present in the planning graph? |
| i ➥ Sequence of levels |
| ii ➥ Literals |
| iii ➥ Variables |
| iv ➥ Heuristic estimates |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.86➡ | NTA UGC NET What is the best method to go for the game playing problem? |
| i ➥ Optimal Search |
| ii ➥ Random Search |
| iii ➥ Heuristic Search |
| iv ➥ Stratified Search |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.87➡ | What are the following sequence of steps taken in designing a fuzzy logic machine? |
| i ➥ Fuzzification → Rule evaluation → Defuzzification |
| ii ➥ Fuzzification → Defuzzification → Rule evaluation |
| iii ➥ Rule evaluation → Fuzzification → Defuzzification |
| iv ➥ Rule evaluation → Defuzzification → Fuzzification |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.88➡ | In Artificial Intelligence , a semantic network |
| i ➥ is a graph-based method of knowledge representation where nodes represent concepts |
| ii ➥ is a graph-based method of knowledge representation where nodes represent relations |
| iii ➥ represents an entity as a set of slots and associated rules. |
| iv ➥ is a subset of first-order logic. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.89➡ | Criticism free idea generation is a factor of ………….. |
| i ➥ Decision Support System |
| ii ➥ Group Decision Support System |
| iii ➥ Enterprise Resource Support System |
| iv ➥ Artificial Intelligence |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.90➡ | Consider the following logical inferences : I1 : If it is Sunday then school will not open. The school was open. Inference : It was not Sunday. I2 : If it is Sunday then school will not open. It was not Sunday. Inference : The school was open. Which of the following is correct? |
| i ➥ Both I1 and I2 are correct inferences |
| ii ➥ I1 is correct but I2 is not a correct inference |
| iii ➥ I1 is not correct but I2 is a correct inference |
| iv ➥ Both I1 and I2 are not correct inferences. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.91➡ | Which formal system provides the semantic foundation for Prolog? |
| i ➥ Predicate calculus |
| ii ➥ Lambda calculus |
| iii ➥ Hoare logic |
| iv ➥ Propositional logic |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.92➡ | Forward chaining systems are where as backward chaining systems are ……………. |
| i ➥ Data driven, Data driven |
| ii ➥ Goal driven, Data driven |
| iii ➥ Data driven, Goal driven |
| iv ➥ Goal driven, Goal driven |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.93➡ | STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following? |
| i ➥ SHAKEY |
| ii ➥ SRI |
| iii ➥ NLP |
| iv ➥ None of these |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.94➡ | Slots and facets are used in |
| i ➥ Semantic Networks |
| ii ➥ Frames |
| iii ➥ Rules |
| iv ➥ All of these |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.95➡ | Which of the following is not a part of an expert system shell? |
| i ➥ Knowledge Base |
| ii ➥ Inference Engine |
| iii ➥ Explanation Facility |
| iv ➥ None of the above |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.96➡ | The Blocks World Problem in Artificial Intelligence is normally discussed to explain a ……………… |
| i ➥ Search technique |
| ii ➥ Planning system |
| iii ➥ Constraint satisfaction system |
| iv ➥ Knowledge base system |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.97➡ | Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies ……………… |
| i ➥ a forward search that can reduce the difference. |
| ii ➥ a backward search that can reduce the difference |
| iii ➥ a bidirectional search that can reduce the difference. |
| iv ➥ an operator that can reduce the difference. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.98➡ | An A* algorithm is a heuristic search technique which |
| i ➥ is like a depth-first search where most promising child is selected for expansion |
| ii ➥ generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost. |
| iii ➥ saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion. |
| iv ➥ none of the above |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.99➡ | α – β cutoffs are applied to …………. |
| i ➥ Depth first search |
| ii ➥ Best first search |
| iii ➥ Minimax search |
| iv ➥ Breadth first search |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.100➡ | Assume that each alphabet can have a value between 0 to 9 in a crypto-arithmetic problem CROSS +ROADS ___________ DANGER ___________ Which of the following statement is true? (i) No two alphabets can have the same numeric value. (ii) Any two alphabets may have the same numeric value. (iii) D = 0 (iv) D = 1 |
| i ➥ (i) and (iii) |
| ii ➥ (i) and (iv) |
| iii ➥ (ii) and (iii) |
| iv ➥ (ii) and (iv) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |