- Option : A
- Explanation :

Node that receives the packet to transmit will carrier-sense the medium for 5 units. Any packet which arrives within 5 unit will be sensed and keep the channel busy. Given that Signal speed is 10 meter/time.

Which means in 5 unit of time packet can travel 50 meters in max, that allow Q to successfully avoid the collision.

So, option (A) is correct.

You must be logged in to post a comment.

Item Number | Weight in (kgs) | Value in Rupees) |

1 | 10 | 60 |

2 | 7 | 28 |

3 | 4 | 20 |

4 | 2 | 24 |

The task is to pick a subset of these items such that their total weight is not more than 11 kgs and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by V_{greedy}.

The value of VNote – Numerical Type question

- Option : C
- Explanation :

After SortingItem No. Weight Value Value/Weight 1 10 60 6 2 7 28 4 3 4 20 5 4 2 24 12

First, we have to Pick item_1 (Value weight ratio is highest).Item No. Weight Value Value/Weight 1 2 24 12 2 10 60 6 3 4 20 5 4 7 28 4

After that Second highest is item_1. but cannot be picked because of its weight.

Now item_3 shall be picked. item_2 cannot be included because of its weight.

Therefore, overall profit by V_{greedy}= 20+24 = 44

Hence, V_{opt}– V_{greedy}= 60-44 = 16

So, answer is 16.

You must be logged in to post a comment.

You must be logged in to post a comment.

H_{D} | M_{D} | L_{D} | |

H_{G} | 0.40 | 0.48 | 0.12 |

M_{G} | 0.10 | 0.65 | 0.25 |

L_{G} | 0.01 | 0.50 | 0.49 |

Consider the first row in the table above. The first entry denotes that if Guwahati has high temperature (H_{G}) then the probability of Delhi also having a high temperature (H_{D}) is 0.40; i.e., P(H_{D} ∣ H_{G}) = 0.40. Similarly, the next two entries are P(M_{D} ∣ H_{G}) = 0.48 and P(L_{D} ∣ H_{G}) = 0.12. Similarly for the other rows.

If it is known that P(HNote – Numerical Type question.

- Option : A
- Explanation : The condition probability table given is
H _{D}M _{D}L _{D}H _{G}0.40 0.48 0.12 M _{G}0.10 0.65 0.25 L _{G}0.01 0.50 0.49

P(H_{G}) = 0.2

P(M_{G}) = 0.5

P(L_{G}) = 0.3

Drawing the tree diagram for HD we get,

From diagram, P(H_{G}∩ H_{D}) = 0.2x0.4

P(H_{D}) = 0.2x0.4+0.5x0.1+0.3x0.01 = 0.133

Required probability,

P(H_{G}| H_{D}) = (0.2x0.4)/0.133 = 0.60

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : C
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.