4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Dashboard / Courses / Winter 2021-22 / BTech Semester 6 / CS302 / General / CS302 Mid-Sem Online Examination

Started on Tuesday, 8 March 2022, 2:34 PM

State Finished
Completed on Tuesday, 8 March 2022, 3:51 PM
Time taken 1 hour 16 mins
Marks 17.50/45.00
Grade 11.67 out of 30.00 (39%)

Question 1
Correct

Mark 1.00 out of 1.00

A heuristic is said to be admissible if it never overestimates the cost to reach a goal.

Select one:
True 

False

The correct answer is 'True'.

Question 2
Incorrect

Mark 0.00 out of 2.00

n vehicles occupy squares (1,1) through (n,1) (i.e., the left most column) of an n x n grid. The vehicles must be moved to the right most
column but in reverse order; so the vehicle i that starts in (i,1) must end up in (n-i+1,n). On each time step, every one of the n vehicles can
move one square up, down, left, or right, or stay put; but if a vehicle stays put, one other adjacent vehicle (but not more than one) can
hope over it. Two vehicles cannot occupy the same square.

Calculate the size of the state space given that n=4.

Answer: 65536 

The correct answer is: 43680

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 1/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 3
Correct

Mark 1.00 out of 1.00

In the context of state space search A* returns an optimal path if the heuristic function used is not admissible.

Select one:
True

False 

The correct answer is 'False'.

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 2/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 4
Incorrect

Mark 0.00 out of 5.00

[Enter your answer in decimals only. Enter your answer up to two decimal places.]

Answer: 0.35 

The correct answer is: 1.41866

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 3/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 5
Correct

Mark 1.00 out of 1.00

Consider the random variables A, B, C, D and E each of which can take 6, 5, 4, 3 and 2 different values respectively. What is the size of the
Joint Probability Table?
[Answer in integer the total number of probability values required to be stored.]

Answer: 719 

The correct answer is: 719

Question 6
Incorrect

Mark 0.00 out of 5.00

You and your friend have decided to take a trip to G from S on the graph below. You are tired and you wish to reach G as soon as possible,
while your friend wants to avoid reaching G if possible. (Consider that the graph is directed, in the sense that node from left has a directed
outgoing edge to node to the right.)

You and your friend take turns to drive at every stop (vertex). Let’s assume that you start driving at S, what path will both of you follow to
reach G? The edge weights indicate the time it takes to travel between nodes.

[How to enter your answer? If the path that you have identified is S->A->B->D->G then enter the string SADBG in the space provided for
answer.]

SAEDG

Answer: 

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 4/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 7
Partially correct

Mark 2.50 out of 5.00

Let D1 and D2 be DAGs over the same variables. The graph D1 is an I-submap of D2 if all d-separation properties of D1 also hold for D2. If
D2 is also an I-submap of D1, they are said to be I-equivalent.

Consider the above DAGs numbered 1, 2, 3 and 4 from left to right.

Answer the following:

a. 2, 3 and 4 are I-equivalent

b. All four DAGs are I-equivalent.

c. 1, 2 and 3 are I-equivalent

d. 2 and 3 are I-equivalent 

e. 2 and 4 are not I-equivalent 

Your answer is partially correct.

You have correctly selected 2.
The correct answers are:
1, 2 and 3 are I-equivalent,
2 and 4 are not I-equivalent,

2 and 3 are I-equivalent

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 5/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 8
Incorrect

Mark 0.00 out of 2.00

Consider the random variables A, B, C, D and E each of which can take 6, 5, 4, 3 and 2 different values respectively. Given that the joint
probability is factorised according to the Bayesian network below, total how many probability values are required to be stored?

[Answer in integer the total number of probability values required to be stored.]

Answer: 126 

The correct answer is: 90

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 6/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 9
Incorrect

Mark 0.00 out of 5.00

Consider the following Venn diagram.

An individual is tested and the test result turned out to be positive. What is the probability that the individual is covid positive?

[Enter your answer in decimal only. Enter your answer up to two decimal places.]

Answer: 0.54 

The correct answer is: 0.3576

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 7/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 10
Incorrect

Mark 0.00 out of 5.00

Given the two player game tree with the root being the Max player. Try to explore the game tree with alpha-beta (pruning) search agent.

Indicate the savings in terms of how many leaf nodes are not considered for evaluation while exploring. Enter the number of leaf nodes not
explored in the answer box.

Answer: 10 

The correct answer is: 8

Question 11
Correct

Mark 3.00 out of 3.00

In the context of state space search, under the following assumptions

1. The underlying graph for the given state space search problem has finite branching factor - b

2. The goal state is at a finite depth - d in this graph

Iterative deepening is Complete and Optimal, Time complexity $$O(b^d)$$, Space complexity $$O(bd)$$ 

Depth first search is Neither complete nor optimal 

Breadth first search is Complete and Optimal, Time complexity $$O(b^d)$$, Space complexity $$O(b^d)$$ 

Your answer is correct.

The correct answer is:

Iterative deepening is → Complete and Optimal, Time complexity $$O(b^d)$$, Space complexity $$O(bd)$$,
Depth first search is → Neither complete nor optimal,

Breadth first search is → Complete and Optimal, Time complexity $$O(b^d)$$, Space complexity $$O(b^d)$$

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 8/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 12
Correct

Mark 1.00 out of 1.00

In the context of state space search, admissibility of a heuristic function implies consistency of the heuristic also.

Select one:
True

False 

The correct answer is 'False'.

Question 13
Correct

Mark 5.00 out of 5.00

Consider the following Markov network defined on four binary random variables A, B, C and D. The network shows the affinity functions on
the edges (factors).

What is the P(A=0, B=0, C=0, D=0)?

[Enter your answer in decimal, up to two decimal places. Hint: Writing a small program to calculate the partition function may help.]

Answer: 0.04 

The correct answer is: 0.048245

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 9/10
4/30/23, 1:22 AM CS302 Mid-Sem Online Examination: Attempt review

Question 14
Partially correct

Mark 3.00 out of 4.00

For the BN shown in the figure below, mark the correct statements about conditional independence relationships.

[Note that <B,{A},C> indicates P(B|CA)=P(B|A)]

a. <B,{E},C>

b. <B,{},C> 

c. <B,{D},C>

d. <B,{A},C> 

e. <B,{D},E> 

Your answer is partially correct.

You have selected too many options.
The correct answers are:
<B,{A},C>,

<B,{D},E>

Jump to...

CS302 End-Semester Examination ►

https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=74558&cmid=2722 10/10