Reducing search space by eliminating irrelevant trees is known as?

› Category: Questions › Reducing search space by eliminating irrelevant trees is known as?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

Reducing search space by eliminating irrelevant trees is known as?
 
(a) pruning
 
(b) partial results
 
(c) freeing space
 
(d) traversing
 
Enquiry is from Trees topic in chapter Trees of Data Structures & Algorithms I
 
This question was posed to me during an online exam.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

Correct answer is (a) pruning
 
The best explanation: Pruning is eliminating irrelevant trees. Partial results are keeping best results and updating. Traversal is visiting all the nodes of a tree.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702

Related Posts