In the following question, various terms of an alphabet series are given with one term missing as shown by (?). Choose the missing terms out of the given alternatives. M, N, O L, R, I, V, ?
The given alphabet series is: M, N, O L, R, I, V, ?
This series can be divided into two interleaved sequences:
- Sequence 1 (Odd positions): M, O, R, V
- Sequence 2 (Even positions): N, L, I, ?
Analyzing Alphabet Sequence 1
The letters in the first sequence are M, O, R, V.
Let's find the difference in their alphabetical positions:
- M is the 13th letter.
- O is the 15th letter.
- R is the 18th letter.
- V is the 22nd letter.
The pattern of differences is:
- O (15) - M (13) = +2
- R (18) - O (15) = +3
- V (22) - R (18) = +4
The differences are increasing by 1 each time (+2, +3, +4). The next difference should be +5.
Analyzing Alphabet Sequence 2
The letters in the second sequence are N, L, I, ?.
Let's find the difference in their alphabetical positions:
- N is the 14th letter.
- L is the 12th letter.
- I is the 9th letter.
The pattern of differences is:
- L (12) - N (14) = -2
- I (9) - L (12) = -3
The differences are decreasing by 1 each time (-2, -3). The next difference should be -4.
Applying the next difference to I (9):
Position = $9 - 4 = 5$
The 5th letter of the alphabet is E.
Therefore, the missing term is E.
Important Questions from Miscellaneous
- Which of the following scheduler/schedulers is/are also called CPU scheduler ?
(A). Short Term Scheduler
(B). Long Term Scheduler
(C). Medium Term Scheduler
(D). Asymmetric Scheduler
Choose the correct answer from the options given below: - A situation where two or more processes are blocked, waiting for resources held by each other is called:
- External fragmentation occurs ________.
- Which disk scheduling algorithm looks for the track closest to the current head position?
- Which CPU scheduling algorithm prefers the process with the shortest burst time?
