A directory of Objective Type Questions covering all the Computer Science subjects.

1. General games involves
a. Single-agent
b. Multi-agent
c. Neither a nor b
d. Only a and b
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Only a and b

2. Adversarial search problems uses
a. Competitive Environment
b. Cooperative Environment
c. Neither a nor b
d. Only a and b
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Competitive Environment

3. The initial state and the legal moves for each side define the __________ for the game.
a. Search Tree
b. Game Tree
c. State Space Search
d. Forest
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Game Tree

4. General algorithm applied on game tree for making decision of win/lose is ____________.
a. DFS/BFS Search Algorithms
b. Heuristic Search Algorithms
c. Greedy Search Algorithms
d. MIN/MAX Algorithms
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).MIN/MAX Algorithms

5. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
a. Depth-first search
b. Breadth-first search
c. Alpha-beta pruning
d. None of the mentioned
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Alpha-beta pruning

6. Which search is similar to minimax search?
a. Hill-climbing search
b. Depth-first search
c. Breadth-first search
d. All of the mentioned
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Depth-first search

Page 1 of 4

copyright 2016 computer science bitsCompscibits.com