Govt. Exams
Entrance Exams
Heaps provide O(log n) insertion and deletion, making them optimal for priority queues compared to other structures.
Let smaller number = x. Larger = x+5. Sum: x + (x+5) = 25 → 2x = 20 → x = 10. Larger = 15
Favorable outcomes: (1,6), (2,5), (3,4), (4,3), (5,2), (6,1) = 6. Total outcomes = 36. Probability = 6/36 = 1/6
Total work = 3 × 8 = 24 man-days. Men needed = 24/6 = 4
Using y - y₁ = m(x - x₁): y - 3 = 4(x - 2) → y = 4x - 5
Let numbers be 3x and 4x. Sum = 7x = 140, so x = 20. Larger number = 4×20 = 80
Let A=2x, B=3x, C=5x. Sum = 10x = 100, so x=10. Therefore C = 5×10 = 50
Let boat speed = b. Upstream speed = b-2, Downstream speed = b+2. 15/(b-2) + 25/(b+2) = 5. Solving gives b = 8 km/h
CI = P(1+r/100)^n - P = 1000(1.1)² - 1000 = 1210 - 1000 = Rs. 210
(256)^(1/4) = fourth root of 256 = 4 (since 4⁴ = 256).
