P and Q play chess frequently against each other. Of these matches, P has won 80% of the matches, drawn 15% of the matches, and lost 5% of the matches.If they play 3 more matches, what is the probability of P winning exactly 2 of these 3 matches?
Consider the following hierarchical cache system with the following access times:
Find \( T_{avg} \) for hierarchical or simultaneous access.
How many triangles are there in the figure given below?
Assertion (A): The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP). Reason (R): The region representing \( Z = 50x + 70y \) such that \( Z < 380 \) does not have any point common with the feasible region.