Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More
English
Hindi

Question

Download Solution PDF

The process of removing details from a given state representation is called ______

This question was previously asked in
UGC NET Computer Science (Paper 2) 2020 Official Paper
Download PDF Attempt Online
View all UGC NET Papers >
  1. Extraction
  2. Mining
  3. Selection
  4. Abstraction

Answer (Detailed Solution Below)

Option 4 : Abstraction
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
8.8 K Users
50 Questions 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

The correct answer is option 4.

Key Points 

The 'process of removing detail' from a 'given state representation' is called an abstraction.

∴ Hence the correct answer is Abstraction.

Additional Information 

  • Abstraction is a type of Artificial Intelligence problem formulation and problem-solving process.
  • In the analysis of structures or objects, this method includes the elimination of physical, temporal, or spatial information in order to concentrate on more important details.
  • The abstraction method is a simple principle in computer science that is used as a declarative statement in many programming languages such as Java and C++.
Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 6, 2025

-> The UGC NET Exam Schedule 2025 for June has been released on its official website.

-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.

-> The UGC NET 2025 online application form submission closed on 12th May 2025.

-> The June 2025 Exam will be conducted from 21st June to 30th June 2025

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Approaches to AI Questions

Q1.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:
Q2.The process of removing details from a given state representation is called ______
Q3.According to Dempster-Shafer theory for uncertainty management. Where Bel(A) denotes Belief of event A.
Q4.Consider the game tree given below Here O and □ represent MIN and MAX nodes respectively, The value of the root node of the game tree is:
Q5.In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h1.......hm is available for a problem and none of them dominates any of the others, which should we choose ?
Q6.Consider the following minimax game tree search What will be the value propagated at the root?
Q7.Match List 1 with List 2 and choose the correct answer from the code given below List 1 List 2 a) Greedy best-first search i) Selects a code for expansion if optimal path to that node has been found b) A* Search ii) Avoids substantial overhead associated with keeping the sorted queue of nodes c) Recursive best-first search iii) Suffers from excessive node generation d) Iterative-deepening A* Search iv) Time complexity depends upon the quality of heuristic
Q8.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?
Q9.Consider the following statements related to AND-OR Search algorithm. S1: A solution is a subtree that has a goal node at every leaf. S2: OR nodes are analogous to the branching in a deterministic environment S3: AND nodes are analogous to the branching in a non-deterministic environment. Which one of the following is true referencing the above statements? Choose the correct answer from the code given below:
Crack CUET PG with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Exams
Exam-Logo
UGC NET

UGC NET Important Links

More Artificial Intelligence Questions

Q1.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:
Q2.In a genetic algorithm optimization problem the fitness function is defined as f(x) = x2 - 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?
Q3.Match List-I with List-II List I List II A. Hill climbing I. O(b^d) B. Best first search II. O(bd) C. A* Search III. O(1) D. Depth first search IV. O(b^m) Choose the correct answer from the options given below :
Q4.Match List-I with List-II List I List II A. Greedy Best first search I. The space complexity as O(d) where d = depth of the deepest optimal solution B. A* II. Incomplete even if the search space is finite C. Recursive best first search III. Optimal if optimal solution is reachable otherwise return the best reachable optimal solution D. SMA* IV. Computation and space complexity is two light Choose the correct answer from the options given below :
Q5.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:
Q6.A ______ point of fuzzy set A is a point x ∈ X at which μA(x) = 0.5 
Q7.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. W1: [0.1, 0.3, 0.5, 0.2] W2: [0.2, 0.4, 0.6, 0.2] Input layer to hidden layer weights W3: [0.3, 0.5, 0.7, 0.2] W4: [0.4, 0.1, 0.3] W5: [0.5, 0.2, 0.4] Hidden layer to output layer weights 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 :
Q8.What is the generic structure of Multi Agent System (MAS) ? 
Q9.Match List I with List II LIST I LIST II A. Expert system I. Decision tree B. Fuzzy system II. Scramble C. Operator in genetic algorithm III. Inference engine D. Supervised technique IV. Mycin Choose the correct answer from the options given below:
Q10.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:
Super Coaching
UGC NET Test Series
UGC NET Previous Year Papers
UGC NET Syllabus
UGC NET Books
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti tiger teen patti - 3patti cards game teen patti gold new version teen patti real cash 2024 teen patti casino apk