CS607 Midterm MCQs 2024 by Miss Mehwish

Past Papers for Mids./Finals are also Available · CS607 · (Artificial Intelligence)

 The state that represents the solution of the problem is called

Problem statement Goal space

Solution space ✔️

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

Linked List Arrays

introspection of mind psychological experiment

brain functions ✔️

human body works

 In intelligence to solve the trivial problems we use

hit and trial

trial and error ✔️

dynamic programming divide and conquer

 The Depth First Search traversal of a graph will result in?

Linked List Tree ✔️

Array

terminals, branches

nodes, vertices ✔️

problems, solution branches, nodes

 Which value is assigned to alpha and beta in the alpha-beta pruning?

Beta = max Beta = min Alpha = max

Both Alpha = max & Beta = min ✔️

 In Breadth-First Search, how many times a node is visited? Twice ✔️

Thrice Equivalent to number of in-degree of the node

 We use graphs to represent problems and their

nodes and vertices parameters

solution spaces ✔️

•  " If you find the goal, exit, otherwise repeat DFS to the next lower level". The statement refers to: Breadth first search None

Depth first search ✔️

Progressive depending

Q1. A computer vision technique that relies on image templates is: O robot vision

1. modelbased vision
2. edge detection
3. pose estimation

Q2. The Depth First Search traversal of a graph will result in? O Array

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

Q3. In progressive deepening, the idea is to simply apply DFS to a specific: O Branch

1. Branching factor
2. Node
3. O

Q4. In searches, we are concerned with finding any one solution to our problem. ✔ O Non optimal

1. Shortest path
2. Optimal path
3. Contrary path

Q5. Which of the following is true?

1. A graph may contain no edges and many vertices
2. A graph may contain many edges and no vertices
3. A graph may contain no edges and no vertices