Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 24 published solutions
Question 36 MSQ · 1.0 marks
You are the chairman of your colony association, which consist of volunteer members who are
residents in your neighbourhood. At a recent meeting, you delegated a substantial amount of
work to some of the other members. "I know these are difficult tasks, but you're part of this team
and you need to get this work done", you told them. But at your next monthly meeting, you were
surprised those association members weren't there as they simply decided to quit because they
had better things to do with their time. Which aspect of teamwork is missing in this example?
[Check all that apply]
6406531514949.
Adequate task definition
6406531514950.
Managerial interference
6406531514951.
Collaboration
6406531514952.
Lack of leadership
**AI**
**Section Id :** 64065329446
**Section Number :** 2
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 12
**Number of Questions to be attempted :** 12
**Section Marks :** 25
**Display Number Panel :** Yes
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
**SEARCH**
Consider a 5-3-2 water jug puzzle with three jugs a, b, c of capacity 5L, 3L, 2L, respectively. A state
is represented as a three digit string ABC, where A, B, C denote the volume of water present in the
jugs a, b, c, respectively. For example, 302 denotes a state where jug a has 3 liters of water, jug b is
empty and jug c has 2 liters of water.
Two types of moves (state transitions) are allowed:
xEy: pick up jug x and empty it into jug y,
xFy: pick up jug x and fill up (top up) jug y.
So the possible moves are: aEb, aEc, aFb, aFc, bEa, bEc, bFa, bFc, cEa, cEb, cFa, cFb.
**Tie-breaker:** in some states, both xEy and xFy may produce the same output state, in such cases,
choose xEy to break the tie. For example, from the 302 state, both aEb and aFb produce the same
output state 032, therefore, to break the tie choose aEb as the move.
For the 5-3-2 water jug puzzle, the MoveGen function takes a state ABC and returns a set of states
that can be produced in one move. For example, MoveGen(500) returns
{ 230, 302 }.
Based on the above data, answer the given subquestions.
Let 500 be the start state and 131 be the goal state, find the shortest path from start to goal. Enter
the path starting with 500 as a comma separated list of states.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 500,411,747
A published solution is not available for this question yet.
**SEARCH**
Consider a 5-3-2 water jug puzzle with three jugs a, b, c of capacity 5L, 3L, 2L, respectively. A state
is represented as a three digit string ABC, where A, B, C denote the volume of water present in the
jugs a, b, c, respectively. For example, 302 denotes a state where jug a has 3 liters of water, jug b is
empty and jug c has 2 liters of water.
Two types of moves (state transitions) are allowed:
xEy: pick up jug x and empty it into jug y,
xFy: pick up jug x and fill up (top up) jug y.
So the possible moves are: aEb, aEc, aFb, aFc, bEa, bEc, bFa, bFc, cEa, cEb, cFa, cFb.
**Tie-breaker:** in some states, both xEy and xFy may produce the same output state, in such cases,
choose xEy to break the tie. For example, from the 302 state, both aEb and aFb produce the same
output state 032, therefore, to break the tie choose aEb as the move.
For the 5-3-2 water jug puzzle, the MoveGen function takes a state ABC and returns a set of states
that can be produced in one move. For example, MoveGen(500) returns
{ 230, 302 }.
Based on the above data, answer the given subquestions.
Let 500 be the start state and 131 be the goal state, find the sequence of moves that produce the
shortest path from start to goal. Enter the sequence of moves as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: aFb,bFc,cEa
A published solution is not available for this question yet.
**SEARCH FOR OPTIMAL SOLUTION**
Given a state space (and a search space) that is too large to fit into main memory, and with
Euclidean edge costs, and with the best admissible heuristics, which of the following algorithms
will you choose to find an optimal path?
6406531514988.
Depth First Search
6406531514989.
Breadth First Search
6406531514990.
Dijkstra's algorithm
6406531514991.
Branch and Bound Search
6406531514992.
A*
6406531514993.
WA* for some w
6406531514994.
Sparse Memory Graph Search (SMGS)
A published solution is not available for this question yet.
**SEARCH FOR OPTIMAL SOLUTION**
In the map, nodes are placed on a grid where each tile is 10x10 in size, is the Manhattan distance
heuristic admissible?
6406531515001.
No
6406531515002.
yes
6406531515003.
Cannot be determined
A published solution is not available for this question yet.
**SEARCH FOR OPTIMAL SOLUTION**
Given a finite state space with edge costs that may or may not be Euclidean and a heuristic
function whose properties are not known, which of the following algorithms are suitable for
finding the optimal path?
6406531514981.
Depth First Search
6406531514982.
Breadth First Search
6406531514983.
Dijkstra's algorithm
6406531514984.
Branch and Bound Search
6406531514985.
A*
6406531514986.
WA* for some w
6406531514987.
Sparse Memory Graph Search (SMGS)
A published solution is not available for this question yet.
**SEARCH FOR OPTIMAL SOLUTION**
Which of the following are true about the Branch-and-Bound method (discussed in the lecture)
that is used for finding optimal tours for the Traveling Salesman Problem?
6406531514995.
The root of the search tree represents all possible tours.
6406531514996.
The root of the search tree represents the shortest/optimal tour.
6406531514997.
Each node in the search tree represents a set of tours.
6406531514998.
Each node in the search tree represents a single tour.
6406531514999.
The costs of the search tree nodes monotonically INCREASE from the root to
leaf.
6406531515000.
The costs of the search tree nodes monotonically DECREASE from the root to
leaf.
A published solution is not available for this question yet.
**GAMES**
The figure shows a 4-ply game tree with evaluation function values at the horizon. The nodes in
the horizon are assigned labels A,B,C,...,P. Use these labels when asked to enter a horizon node or
a list of horizon nodes.
**Tie-breaker:** when several nodes qualify then select the left most node, if tie persists then select
the deepest node among the left most nodes.
Based on the above data, answer the given subquestions.
Which of the following are strategies for MAX?
6406531515004.
C,D,E,F
6406531515005.
C,D,G,H
6406531515006.
A,C,I,J
6406531515007.
B,D,J,L
A published solution is not available for this question yet.
**GAMES**
The figure shows a 4-ply game tree with evaluation function values at the horizon. The nodes in
the horizon are assigned labels A,B,C,...,P. Use these labels when asked to enter a horizon node or
a list of horizon nodes.
**Tie-breaker:** when several nodes qualify then select the left most node, if tie persists then select
the deepest node among the left most nodes.
Based on the above data, answer the given subquestions.
List the horizon nodes in the best strategy for MAX. Enter the nodes in the ascending order of
node labels.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
A published solution is not available for this question yet.
**GAMES**
The figure shows a 4-ply game tree with evaluation function values at the horizon. The nodes in
the horizon are assigned labels A,B,C,...,P. Use these labels when asked to enter a horizon node or
a list of horizon nodes.
**Tie-breaker:** when several nodes qualify then select the left most node, if tie persists then select
the deepest node among the left most nodes.
Based on the above data, answer the given subquestions.
List the first five horizon nodes pruned by Alpha-Beta.
Enter a comma separated sorted list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
A published solution is not available for this question yet.
**CONSTRAINT SATISFACTION**
The figure shows a constraint graph of a Binary CSP and a part of the matching diagram. When a
pair of variables (like, X1 and X5) do not have a constraint in the constraint graph then assume a
UNIVERSAL RELATION in the matching diagram.
Process the variables, and their values, in ALPHABETIC order.
Based on the above data, answer the given subquestions.
The Forward-Checking algorithm begins by assigning X1=a. What are the NEXT four values
assigned to variables by the Forward-Checking algorithm? List the values as a comma separated
list in the order they are assigned.
Enter a comma separated list of values.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: a,6,1,p**
A published solution is not available for this question yet.
**CONSTRAINT SATISFACTION**
The figure shows a constraint graph of a Binary CSP and a part of the matching diagram. When a
pair of variables (like, X1 and X5) do not have a constraint in the constraint graph then assume a
UNIVERSAL RELATION in the matching diagram.
Process the variables, and their values, in ALPHABETIC order.
Based on the above data, answer the given subquestions.
What is the first solution found by the Forward-Checking algorithm?
Enter a comma separated list of values.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: a,6,1,p**
A published solution is not available for this question yet.
**PROBLEM DECOMPOSITION**
The figure shows an AND-OR graph that depicts how a problem S can be decomposed and
transformed into one or more simpler problems. Nodes are uniquely identified by labels (S, A, B,
…). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes with double lines are primitive nodes and their values are actual costs. Observe that a
primitive node is added to the graph by its parent when the parent is expanded, and the primitive
node is labeled as SOLVED and it will not be expanded subsequently.
**Tie-breaker 1:** For nodes with the same cost, expand in the ascending order of node labels.
**Tie-breaker 2:** For AND nodes, expand the unsolved branch with the highest cost.
The cost of each edge is 10. Solve for S, then answer the given subquestions.
List the first three nodes (including S) expanded by AO* algorithm. List the nodes in the order they
are expanded. Observe that primitive nodes are not expanded.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: X,Y,Z**
A published solution is not available for this question yet.
**PROBLEM DECOMPOSITION**
The figure shows an AND-OR graph that depicts how a problem S can be decomposed and
transformed into one or more simpler problems. Nodes are uniquely identified by labels (S, A, B,
…). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes with double lines are primitive nodes and their values are actual costs. Observe that a
primitive node is added to the graph by its parent when the parent is expanded, and the primitive
node is labeled as SOLVED and it will not be expanded subsequently.
**Tie-breaker 1:** For nodes with the same cost, expand in the ascending order of node labels.
**Tie-breaker 2:** For AND nodes, expand the unsolved branch with the highest cost.
The cost of each edge is 10. Solve for S, then answer the given subquestions.
Determine the value of the start node S after each node expansion. List the first three values of S
that correspond to the first three node expansions.
Enter a comma separated list of numbers.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: 12,42,17**
A published solution is not available for this question yet.
**PROBLEM DECOMPOSITION**
The figure shows an AND-OR graph that depicts how a problem S can be decomposed and
transformed into one or more simpler problems. Nodes are uniquely identified by labels (S, A, B,
…). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes with double lines are primitive nodes and their values are actual costs. Observe that a
primitive node is added to the graph by its parent when the parent is expanded, and the primitive
node is labeled as SOLVED and it will not be expanded subsequently.
**Tie-breaker 1:** For nodes with the same cost, expand in the ascending order of node labels.
**Tie-breaker 2:** For AND nodes, expand the unsolved branch with the highest cost.
The cost of each edge is 10. Solve for S, then answer the given subquestions.
What is the final value of the start node S?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: 42**
A published solution is not available for this question yet.
**PROBLEM DECOMPOSITION**
The figure shows an AND-OR graph that depicts how a problem S can be decomposed and
transformed into one or more simpler problems. Nodes are uniquely identified by labels (S, A, B,
…). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes with double lines are primitive nodes and their values are actual costs. Observe that a
primitive node is added to the graph by its parent when the parent is expanded, and the primitive
node is labeled as SOLVED and it will not be expanded subsequently.
**Tie-breaker 1:** For nodes with the same cost, expand in the ascending order of node labels.
**Tie-breaker 2:** For AND nodes, expand the unsolved branch with the highest cost.
The cost of each edge is 10. Solve for S, then answer the given subquestions.
In the given AND-OR graph, is the heuristic admissible?
6406531515013.
Yes
6406531515014.
No
6406531515015.
Cannot be determined
A published solution is not available for this question yet.
**RULE BASED EXPERT SYSTEMS**
A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ..., A10, A11,
A12, A13, ..., B1, B2, ..., B5, R1, R2, ..., R8, uniquely identify the nodes in the network. When
required, use the given label ordering to **break ties** and to enter your answers.
Which of the following rule-data tuples are in the conflict-set?
6406531515016.
R1,101,107
6406531515017.
R2,107
6406531515018.
R6,104,105
6406531515019.
R7,105
6406531515020.
R7,106
6406531515021.
R3,102,107
6406531515022.
R7,105,106
6406531515023.
R8,105,106
A published solution is not available for this question yet.
**RULE BASED EXPERT SYSTEMS**
A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ..., A10, A11,
A12, A13, ..., B1, B2, ..., B5, R1, R2, ..., R8, uniquely identify the nodes in the network. When
required, use the given label ordering to **break ties** and to enter your answers.
If the Inference Engine uses **Specificity** as the conflict resolution strategy then identify the rule-
data tuples that will be ready to fire. If multiple rule-data tuples qualify then choose one.
Enter a comma separated list with a rule label followed by timestamps in sorted order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: R1,101,102,103**
A published solution is not available for this question yet.
**RULE BASED EXPERT SYSTEMS**
A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ..., A10, A11,
A12, A13, ..., B1, B2, ..., B5, R1, R2, ..., R8, uniquely identify the nodes in the network. When
required, use the given label ordering to **break ties** and to enter your answers.
If the Inference Engine uses **Recency** as the conflict resolution strategy then identify the rule-data
tuples that will be ready to fire. If multiple rule-data tuples qualify then choose one.
Enter a comma separated list with a rule label followed by timestamps in sorted order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
**Answer format: R1,101,102,103**
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
In the planning graph, which of the following are mutex proposition pairs in Layer 1?
6406531515043.
onTable(D), on(D,A)
6406531515044.
onTable(D), on(D,C)
6406531515045.
onTable(D), holding(D)
6406531515046.
onTable(B), clear(A)
6406531515047.
on(C,B), on(C,D)
**Deep Learning**
**Section Id :** 64065329447
**Section Number :** 3
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 17
**Number of Questions to be attempted :** 17
**Section Marks :** 50
A published solution is not available for this question yet.
