Back to the 2020 paper
Similar questions
Artificial intelligenceWhich is the best way to go for game playing problem? (i) Linear approach (ii) Heuristic approach (some knowledge is stored) (iii) Random approach (iv) An optimal approach20222mDesign and Analysis of Algorithms The 0/1 Knapsack problem is traditionally solved using which approach to ensure an optimal solution? (i) Greedy Method (ii) Dynamic Programming (iii) Brute-Force only (iv) Linear Search20252mArtificial intelligenceWhich algorithm is optimal and complete? (i) Depth First Search (ii) Hill Climbing (iii) A* Search (iv) Simulated Annealing20252mDesign and Analysis of Algorithms Which strategy solves problems by solving subproblems and combining their solutions? (i) Brute Force (ii) Greedy (iii) Dynamic Programming (iv) Backtracking20242m
PreviousDecision support programs are designed to help managers make (i) budget projections (ii) visual presentations (iii) business decisions (iv) vacation schedulesNextWhat are not represented by using propositional logic? (i) Objects (ii) Relations (iii) Both objects and relations (iv) None of the above
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.