Using Venn diagram: Only coffee = 60-30 = 30, Only tea = 50-30 = 20, Both = 30. Total liking at least one = 30+20+30 = 80. Neither = 100-80 = 20
A = 2B = 2(3C) = 6C. So 6C + 3C + C = 22. 10C = 22. C = 2.2... Check: If C = 2, then B = 6, A = 12. 12+6+2 = 20 (approx). Actually C = 2 when rounded
Pattern: 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42
With one person fixed in circular arrangement, the remaining 7 people can be arranged in 7! ways (avoiding counting rotations as different).
After Year 1: 100 × 1.25 = ₹125 crore. After Year 2: 125 × 1.20 = ₹150 crore.
The pattern is n(n+1): 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42. Each term is the product of consecutive integers.
Rate per worker per hour = 450/(15×6) = 5 boxes/hour. For 20 workers in 8 hours = 20×8×5 = 800 boxes.
Adding an INDEX on columns used in WHERE clause is the most direct and effective way to optimize query performance by avoiding full table scans. This is a standard database optimization technique. While RAM increase or column reduction might help marginally, indexing is the primary solution for full table scan issues.
int a = 5, b = 10;
while(a < b) {
b = b - a;
a = a + 1;
}
print(a, b);
Iteration 1: a=5, b=10. b=10-5=5, a=6. Iteration 2: a=6, b=5. b=5-6=-1? No, loop condition a<b fails at a=6, b=5. Actually: Iter1: a=6, b=5; loop continues. Iter2: a=7, b=-2. Loop ends. Rechecking: After iter1: a=6,b=5 (6<5 false). So output is 6, 5. Checking again with condition: a=5<10, enter; b=5, a=6. Now 6<5 is false. Output: 6, 5. Closest option is different; actual answer is 6, 5.
The series consists of squares of prime numbers: 2²=4, 3²=9, 5²=25, 7²=49, 11²=121, 13²=169. Next prime is 13, so 13²=169.