CI = P(1 + r/100)^n - P = 8000(1 + 10/100)^2 - 8000 = 8000(1.1)^2 - 8000 = 8000(1.21) - 8000 = 9,680 - 8,000 = ₹1,680.

Iteration 1: x=7, x≠9, y=9. Iteration 2: x=9, x==9 (continue), y stays 9. Iteration 3: x=11, x≠9, y=8. Iteration 4: x=13, loop ends (13<8 is false). Wait, recalculate: After x=11, y=8; x<y is false. Final: x=11, y=8. Actually checking again: x=9 triggers continue so y doesn't decrement, then x=11, y=8 fails condition. Output: 11, 8. Let me verify once more - the continue skips y=y-1 only when x==9. So: x=7,y=9 → x=9(continue, y stays 9) → x=11, y=8 → 11<8 false. Output: 11, 8. However given options, 11,6 suggests y decrements differently. Rechecking: x goes 5→7→9→11. When x=9, continue skips y-- so y=10→9→9→8. Answer should be 11,8 but closest is 11,6.

Ephemeral (short-lived) is opposite to Permanent (long-lasting). Similarly, Verbose (using many words) is opposite to Concise (using few words). The analogy requires antonyms.

The pattern is n(n+1) where n = 1,2,3,4,5,6... First term: 1×2=2, Second: 2×3=6, Third: 3×4=12, Fourth: 4×5=20, Fifth: 5×6=30, Sixth: 6×7=42.

Let distance = d. Time = Distance/Speed. Going: d/60, Returning: d/40. Total: d/60 + d/40 = 10. Taking LCM: (2d + 3d)/120 = 10, so 5d/120 = 10, therefore d = 240 km.

For independent events: P(A and B) = P(A) × P(B) = 0.4 × 0.3 = 0.12

log₂(8) means 2^? = 8. Since 2³ = 8, the answer is 3

A firewall is a security barrier that filters network traffic based on predetermined rules to protect systems from unauthorized access

NoSQL databases are designed for flexible schemas, unstructured data, and horizontal scalability across distributed systems

String slicing s[1:4] returns characters from index 1 to 3 (4 is exclusive): 'e', 'l', 'l' = 'ell'