A strategy in which all possible combinations are examined and-01899
A strategy in which all possible combinations are examined and the best among them is selected is called __________
This multiple choice question (MCQ) is related to the book/course
vu cs101 Introduction to Computing.
It can also be found in
vu cs101 Lecture No.16 - Quiz No.2.
A strategy in which all possible combinations are examined and the best among them is selected is called __________
Brute Force Strategy
Deterministic Algorithm
Randomized Algorithm
Heuristic
