If the probability of an event A is 0.4 and event B is 0.3, what is the probability of both A and B occurring (assuming independence)?
A
0.7
B
0.12
C
0.1
D
0.35
Explanation:
For independent events: P(A and B) = P(A) × P(B) = 0.4 × 0.3 = 0.12
In a sequence, each number is the sum of the previous two numbers. If the first two numbers are 1 and 1, what is the 7th number?
Explanation:
Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13. The 7th number is 13.
A vendor purchases apples at Rs. 50 per dozen and sells at Rs. 5 per apple. What is the profit percentage?
Explanation:
Cost per apple = 50/12 = Rs. 4.17. Selling price = Rs. 5. Profit = 5-4.17 = 0.83. Profit% = (0.83/4.17)×100 ≈ 20%.
Which of the following is the odd one out based on the pattern?
Explanation:
Each number is multiplied by 2. The sequence is 5×2^n. The next number should be 320×2 = 640. This is a geometric progression with ratio 2.
In a coding system, CAT = 3, DOG = 4, ELEPHANT = 8. What would SNAKE equal?
Explanation:
The code represents the number of letters in the word. SNAKE has 5 letters, so SNAKE = 5.
Select the word that best completes the analogy: Teacher is to Student as Doctor is to ___
A
Patient
B
Medicine
C
Hospital
D
Nurse
Correct Answer:
A. Patient
Explanation:
A teacher instructs a student, similarly a doctor treats a patient. The relationship is one of professional service provider to recipient.
Choose the option with the correct spelling:
A
Occassion
B
Occation
C
Occasion
D
Ocasion
Correct Answer:
C. Occasion
Explanation:
The correct spelling is 'Occasion' with double 'c' and double 's'. This is a common spelling error in English.
In SQL, which keyword is used to remove duplicate rows from query results?
A
UNIQUE
B
DISTINCT
C
REMOVE
D
DELETE
Correct Answer:
B. DISTINCT
Explanation:
The DISTINCT keyword in SQL removes duplicate rows from the result set. Example: SELECT DISTINCT column FROM table;
What is the time complexity of binary search algorithm?
A
O(n)
B
O(n²)
C
O(log n)
D
O(1)
Correct Answer:
C. O(log n)
Explanation:
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.
A train travels from City A to City B at 60 km/h and returns at 40 km/h. If the total journey time is 10 hours, what is the distance between the two cities?
A
240 km
B
300 km
C
360 km
D
420 km
Correct Answer:
A. 240 km
Explanation:
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.
