Entrance Exams
Govt. Exams
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.
int x = 5;
int y = 10;
while(x < y) {
x = x + 2;
if(x == 9) continue;
y = y - 1;
}
print(x, y);
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.
Binary search has a time complexity of O(log n) because it divides the search space by half in each iteration. This works only on sorted arrays.
The DISTINCT keyword in SQL removes duplicate rows from the result set. Example: SELECT DISTINCT column FROM table;
The correct spelling is 'Occasion' with double 'c' and double 's'. This is a common spelling error in English.
A teacher instructs a student, similarly a doctor treats a patient. The relationship is one of professional service provider to recipient.
The code represents the number of letters in the word. SNAKE has 5 letters, so SNAKE = 5.