CS607 Midterm Solved MCQs Set 2 by Junaid

Q1. General games involves

1. single-agent
2. multi-agent
3. only single-agent and multi-agent
4. neither single-agent nor multi-agent

Correct answer: only single-agent and multi-agent

Q2. Adversarial search problems uses

1. cooperative environment
2. neither competitive nor cooperative environment
3. an only competitive and cooperative environment

Q2. Genetic algorithm start with the population of randomly generated, attempted solutions to a problem and repeatedly do the following except _.

1. evaluate each attempted solutions
2. keep the best solutions
3. produce next generation using inheritance and mutation.

Q3. What is Artificial Intelligence?

1. Putting your intelligence into Computer
2. Programming with your intelligence
3. Playing a Game

Q4. To create intelligent machines we first need to understand how the real

1. introspection of mind
2. psychological experiment
3. human body works

Q5. The Breadth-First Search traversal of a graph will result into?

1. Linked List
2. Graph with back edges
3. Arrays

Q6. In Breadth-First Search, how many times a node is visited?

1. Once
2. Tree
3. brain functions
4. Making a Machine intelligent My Point of View
5. perform non parallel search
6. competitive environment
7. Twice
8. Thrice

Q7. R1/XCON expert system was developed by?

1. Digital Computer Corporation
2. Computer accessories company
3. DELL

Q8. In Depth-First Search, how many times a node is visited?

1. Once
2. Twice
3. Thrice

Q9. Every graph can be converted into a

1. statement
2. problem
3. repeated cycle
4. Performance of an expert system is as compared to a human expert.

1. Low
2. Medium
3. Average

Q11. A function by which we can tell which board position is nearer to our goal is called.

1. Alternative function
2. Recursive function
3. Best function

Q12. A knowledge structure that relates some known information to other information that can be concluded or inferred to be true is represented as

1. object
2. attribute
3. Fitness function
4. High
5. Tree
6. Equivalent to number of in degree of the node

GOOGLE · b. Digital Equipment Corporation · c. Equivalent to number of in-degree of the node · GOOGLE

b. medium c. complex d. structured

14. Graphs and Networks allow between objects/entities to be incorporated.

b. pictures c. representation d. communication

15. In Genetic algorithm has the same notion of having something or some attribute from a parent while refers to a small random change.

b. DFS, BFS c. A*, Dynamic programing d. subtraction, multiplication

Q16. Back-propagation learning algorithm was invented by

1. John McCarthy
2. Marvin Minsky
3. Alan Turing
4. The simple idea behind is that if we can reach a specific node through more than one different paths then we shall take the path with the minimum cost.

1. Estimates
2. Progressive deepening
3. Beam search

Q18. Which of the following is NOT one of the steps of simple search algorithm?

1. Initialize priority queue.
2. Check if the priority queue is empty.
3. If node picked from priority queue is goal node then return.
4. Copy visited queue to priority queue.

Correct answer: Copy visited queue to priority queue.

19. is the type of knowledge that can be described as the knowledge about knowledge.

a. Dynamic programming · a. Bryson and Ho · a. inheritance, mutation · a. Relationships · a. Trivial