Correct Marks : 4 Selectable Option : 0
Question Label : Multiple Select Question
Consider the class diagram given below.
Which of the following is/are true about the class diagram?
Options :
6406531487340.
6406531487341.
6406531487342.
6406531487343.
AI
Section Id : 64065329026
Section Number : 7
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 6
Number of Questions to be attempted : 6
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
Sub-Section Number : 1
Sub-Section Id : 64065363624
Question Shuffling Allowed : No
Is Section Default? : null
Question Number : 132 Question Id : 640653446478 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 0
Question Label : Multiple Choice Question
Options :
6406531487372. YES
6406531487373. NO
Sub-Section Number : 2
Sub-Section Id : 64065363625
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653446479 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (133 to 139)
Question Label : Comprehension
SEARCH
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations
are at grid points and are connected by two way edges (roads), where each edge has a cost that is
the same in both directions. Observe that the edge costs are not necessarily proportional to the
coordinate based distance estimates.
The start node is S and the goal node is G, the MoveGen function returns neighbours in
alphabetical order. Use Manhattan distance as the heuristic function.
Tie-breaker: when several nodes have the same best cost, use alphabetical order to break ties.
Emulate A*, WA* and Branch-and-Bound on the given map, then answer the given subquestions.
Sub questions
Question Number : 133 Question Id : 640653446480 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
In the map, S is the first node to be refined, determine the next 4 nodes from the 2nd to 5th node
refined by A*. Enter the nodes in the order they are refined.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: W,X,Y,Z
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
B,C,D,E
Question Number : 134 Question Id : 640653446481 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
For the 4 nodes listed in the previous question, list the f-values of those nodes as a comma
separated list. Use the same node order used in the previous question.
Enter a comma separated list of natural numbers.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 2,7,1,8
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
19,20,29,31
Question Number : 135 Question Id : 640653446482 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the path found by A*?
Enter the path as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z,G
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
S,B,C,D,E,G
Question Number : 136 Question Id : 640653446483 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
A* may revise the f-values of nodes when it visits them again. List all the f-values assigned to node
‘A’, excluding +INFINITY (or +LARGE) assigned initially.
Enter a comma separated list of f-values.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 3,1,4
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
37,33
Question Number : 137 Question Id : 640653446484 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
For w=3, what is the path found by WA* algorithm?
Enter the path as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z,G
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
S,B,C,A,G
Question Number : 138 Question Id : 640653446485 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the cost of the path found by Branch-and-Bound algorithm?
Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 17
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
32
Question Number : 139 Question Id : 640653446486 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1
Question Label : Multiple Choice Question
Is the heuristic admissible in the given map?
Options :
6406531487380. Yes
6406531487381. No
6406531487382. Cannot be determined
Question Id : 640653446501 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (140 to 146)
Question Label : Comprehension
AUTOMATED PLANNING
The domain description of a blocks-world with a single one-armed robot is provided below.
Note: this is the same domain description used in the weekly assignments.
Tie-breaker for subgoal ordering: treat the start state, goal description, preconditions and
effects as lists that are accessed from left to right. When the elements in a list are pushed one by
one into a stack, the last element will be at the top of the stack. It has the effect of reversing the
list.
Tie-breaker for block placement: when there are multiple locations for placing a block, choose
the location that satisfies a goal at hand, or else, choose a location that will lead to a better plan,
or else, place it on the table.
Tie-breaker for action selection: when actions are chosen non-deterministically, choose actions
that lead to a plan, even a suboptimal plan is fine. Throwaway the actions that may lead to
deadends and loops.
A planning problem is given below, find a plan using the operators and predicates defined in the
blocks-world domain
Based on the above data, answer the given subquestions.
Sub questions
Question Number : 140 Question Id : 640653446502 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the length of the optimal plan? Enter the number of actions in the optimal plan.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
Question Number : 141 Question Id : 640653446503 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1 Selectable Option : 0
Question Label : Multiple Select Question
Which of the following are applicable actions for the given planning problem?
Options :
6406531487395. Pickup(A)
6406531487396. Pickup(B)
6406531487397. Pickup(C)
6406531487398. Unstack(A,D)
6406531487399. Unstack(C,G)
Question Number : 142 Question Id : 640653446504 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1 Selectable Option : 0
Question Label : Multiple Select Question
Which of the following are relevant actions for the given planning problem?
Options :
6406531487400. Pickup(B)
6406531487401. Putdown(B)
6406531487402. Stack(A,G)
6406531487403. Stack(B,A)
6406531487404. Unstack(A,D)
6406531487405. Unstack(C,G)
Question Number : 143 Question Id : 640653446505 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1
Question Label : Multiple Choice Question
Which of the following can be pushed as the first three elements onto the stack by the Goal Stack
Planning algorithm? In the representation below the stack has a bottom on the right marked by
the entry END. Use appropriate tie-breakers listed in main question.
Options :
6406531487406. { on(A,G), on(B,A) }; on(A,G); on(B,A); END
6406531487407. { on(A,G), on(B,A) }; on(B,A); on(A,G); END
6406531487408. on(B,A); on(A,G); { on(A,G), on(B,A) }; END
6406531487409. on(A,G); on(B,A); { on(A,G), on(B,A) }; END
Question Number : 144 Question Id : 640653446506 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1
Question Label : Multiple Choice Question
For the subgoal ordering given in the goal description (and using the given tie breaking rules),
which of the following is the first action popped out of the stack in Goal Stack Planning?
Options :
6406531487410. Pickup(B)
6406531487411. Stack(B,A)
6406531487412. Unstack(A,D)
6406531487413. Unstack(C,G)
Question Number : 145 Question Id : 640653446507 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1
Question Label : Multiple Choice Question
For the subgoal ordering given in the goal description (and using the given tie breaking rules),
does the Goal Stack Planning algorithm find an optimal plan?
Options :
6406531487414. Yes
6406531487415. No
6406531487416. Cannot be determined
Question Number : 146 Question Id : 640653446508 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 1
Question Label : Multiple Choice Question
If the subgoals in the goal description are swapped places then does the Goal Stack Planning
algorithm find an optimal plan?
Options :
6406531487417. Yes
6406531487418. No
6406531487419. Cannot be determined
Sub-Section Number : 3
Sub-Section Id : 64065363626
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653446487 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (147 to 151)
Question Label : Comprehension
TSP
The distance matrix and edge costs for 5 cities (A to E) are provided below along with the BnB
search tree. Use the Branch-and-Bound algorithm to compute the optimal tour.
Attention: since we are solving problems by hand, infer as much as possible (and as early as
possible) about the permanent edges in the partial solution.
Based on the above data, answer the given subquestions.
Sub questions
Question Number : 147 Question Id : 640653446488 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the lower bound on the cost of the tour as per the TSP BnB algorithm discussed in class?
Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 17
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
182
Question Number : 148 Question Id : 640653446489 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the first edge E1 (XY) used for refining S0?
Enter edge label XY
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: XY
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Set
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
BC
CB
Question Number : 149 Question Id : 640653446490 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the cost of the node ~E1 that excludes edge XY?
Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
207
Question Number : 150 Question Id : 640653446491 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the second edge E2 (XY) that is used for refinement? What is the cost of the node E2. Enter
the edge XY and the cost as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: XY,42
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Set
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
BD,191
DB,191
Question Number : 151 Question Id : 640653446492 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the cost of the optimal tour?
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 17
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
194
Sub-Section Number : 4
Sub-Section Id : 64065363627
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653446493 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (152 to 153)
Question Label : Comprehension
GAMES
The figure shows a game tree with evaluations W (win), L (loss) and D (draw) from Max's
perspective. The nodes are labeled in a level-by-level (a,b,...,e) left-to-right (1,2,...) manner as
indicated in the game tree.
Based on the above data, answer the given subquestions.
Sub questions
Question Number : 152 Question Id : 640653446494 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
What is the outcome (W, D or L) of the game when both players play perfectly?
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
Question Number : 153 Question Id : 640653446495 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
You are allowed to change the eval of one leaf node, change the eval such that the game will end
in a draw when both players play perfectly. Which node will you change and what is the new eval?
Enter the label of the node you wish to change and the new eval as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: a1,X
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Set
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
c3,D
c4,D
c15,D
Sub-Section Number : 5
Sub-Section Id : 64065363628
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653446496 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (154 to 157)
Question Label : Comprehension
Based on the above data, answer the given subquestions.
Sub questions
Question Number : 154 Question Id : 640653446497 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
List the horizon nodes in the best strategy.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
A,B,C,D
Question Number : 155 Question Id : 640653446498 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
List the horizon nodes pruned by Alpha-Beta algorithm.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
F,G,H,K,L
Question Number : 156 Question Id : 640653446499 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
List the horizon nodes in the initial cluster formed by SSS* algorithm.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
A,E,I
Question Number : 157 Question Id : 640653446500 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 1
Question Label : Short Answer Question
List the horizon nodes assigned SOLVED status by the SSS* algorithm.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Set
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
A,B,C,D,E,I,J
A,E,I,B,J,C,D
Deep Learning
Section Id : 64065329027
