CS607 Quiz 1 May 2026

Quiz 1 - CS607 (Q1/10)

Question:

In game-playing searches, what is the common term for the opponents?

1. Clients
2. Nodes
3. Adversaries
4. Agents

Correct answer: Adversaries

Copied: 5/5/2026, 9:47:46 AM

Quiz 2 - CS607 (Q2/10)

Question:

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

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

Correct answer: Tree

Copied: 5/5/2026, 9:48:31 AM

Quiz 3 - CS607 (Q3/10)

Question:

The term artificial intelligence was first came into existence in __________.

A. 1958

B. 1956

C. 1959 D. 1957 Copied: 5/5/2026, 9:49:01 AM

Quiz 4 - CS607 (Q4/10)

Question:

At an early stage, a problem in search space is defined by one of these states.

A. Intermediate state B. knowledge state C. Last state

D. Initial state

Copied: 5/5/2026, 9:50:34 AM

Quiz 5 - CS607 (Q5/10)

Question:

AI definitions fall into two broad themes: 'thought process and reasoning' and what other theme?

1. Hardware
2. Consciousness
3. Behavior
4. Learning

Correct answer: Behavior

Copied: 5/5/2026, 9:51:07 AM

Quiz 6 - CS607 (Q6/10)

Question:

In ______ search, rather than trying all possible search paths, we focus on paths that seem to be getting closer to goal state using some kind of “guide”.

A. Progressive deepening

B. Heuristic

C. Depth first D. Uninformed Copied: 5/5/2026, 9:51:29 AM

Quiz 7 - CS607 (Q7/10)

Question:

Which of the following is not a branch and bound strategy to generate branches?

1. Lowest cost branch and bound
2. Highest cost branch and bound
3. FIFO branch and bound
4. LIFO branch and bound

Correct answer: Highest cost branch and bound

Copied: 5/5/2026, 9:51:54 AM