Question 1

Relative days – If the day that will come two days after tomorrow is Thursday, determine the weekday that occurred three days before yesterday.

Accepted Answer

Introduction / Context: A two-part relative-day chain must be solved carefully: first pin down today, then compute a separate backward offset. Given Data / Assumptions: (Tomorrow + 2) = Thursday. We need (yesterday - 3). Concept / Approach: Let today = T. Then tomorrow = T+1. Given T+3 = Thursday → T = Monday. Now compute (yesterday - 3) = (T - 1 - 3) = T - 4. Step-by-Step Solution: T + 3 = Thursday → T = Monday.Yesterday = Sunday.Three days before yesterday = Sunday - 3 = Thursday. Verification / Alternative check: Forward check: From Monday, tomorrow is Tuesday; two days after that is Thursday, matching the premise. Backward chain from Sunday confirms Thursday. Why Other Options Are Wrong: Monday/Tuesday/Wednesday are all one or more days off from the computed Thursday baseline. Common Pitfalls: Applying both conditions to the same direction (both forward), missing that the second part is a backward computation from “yesterday.” Final Answer: Thursday

Question 2

Relative days – If the day after tomorrow is Saturday, determine which weekday was three days before yesterday.

Accepted Answer

Introduction / Context: Another chained relative-day problem asking for a backward offset based on a forward clue. Given Data / Assumptions: Day after tomorrow = Saturday. Find 3 days before yesterday. Concept / Approach: If today is T and T+2 = Saturday, then T = Thursday. Now compute (yesterday - 3) = (T - 1 - 3) = T - 4. Step-by-Step Solution: T + 2 = Saturday → T = Thursday.Yesterday = Wednesday.Three days before yesterday = Wednesday - 3 = Sunday. Verification / Alternative check: Timeline: Sun (T-4), Mon (T-3), Tue (T-2), Wed (T-1), Thu (T), Fri (T+1), Sat (T+2). Everything aligns. Why Other Options Are Wrong: Thursday/Monday/Saturday are not the computed T-4 result from the established T = Thursday. Common Pitfalls: Forgetting that “yesterday” is T-1, then subtracting 3 more days (total T-4). Final Answer: Sunday

Question 3

Relative days – If the day after tomorrow is Friday, what weekday will it be on the third day after tomorrow?

Accepted Answer

Introduction / Context: This tests translating from a forward relative-day clue to another forward offset based on the same “tomorrow” anchor. Given Data / Assumptions: Day after tomorrow = Friday. Find the weekday on the third day after tomorrow. Concept / Approach: If today is T and T+2 = Friday, then T = Wednesday. The third day after tomorrow is (T+1) + 3 = T + 4. Step-by-Step Solution: T + 2 = Friday → T = Wednesday.Tomorrow = Thursday (T+1).Third day after tomorrow = T + 4 = Wednesday + 4 = Sunday. Verification / Alternative check: List sequentially: Thu (T+1), Fri (T+2), Sat (T+3), Sun (T+4). Matches the request and the given clue. Why Other Options Are Wrong: Saturday/Monday/Friday are each off by one from the T+4 target computed from T = Wednesday. Common Pitfalls: Accidentally counting “tomorrow” as day 1 when the phrase says “third day after tomorrow,” which starts counting after tomorrow. Final Answer: Sunday

Question 4

Day-of-week inference – Mohini watched a movie exactly nine days ago and she only goes to the movies on Thursdays. What day of the week is today?

Accepted Answer

Introduction / Context: We are given a fixed weekday for an event that occurred a specific number of days earlier. The task is to roll that weekday forward by the stated gap to arrive at today. Given Data / Assumptions: Mohini visits the cinema only on Thursdays. Her last visit was nine days ago. We need to find today’s weekday. Concept / Approach: If nine days ago was a Thursday, then today is Thursday + 9. Because 7 days = one full week, add 9 as 7 + 2 → the weekday advances by 2 relative to Thursday. Step-by-Step Solution: Nine days ago = Thursday.Advance 7 days: still Thursday.Advance 2 more days: Thursday → Friday → Saturday. Verification / Alternative check: Count backwards from the proposed today: If today is Saturday, then 9 days earlier lands on Thursday (Saturday − 9 = Thursday), consistent with the rule that she only goes on Thursday. Why Other Options Are Wrong: Thursday would be 7 or 14 days apart, not 9. Sunday or Tuesday miscount the extra two days beyond a full week. Common Pitfalls: Subtracting 9 instead of adding 9, or forgetting to reduce the 9-day gap modulo 7 first. Final Answer: Saturday

Question 5

Relative days – If the day before yesterday was Wednesday, determine when Sunday will occur relative to today.

Accepted Answer

Introduction / Context: The problem links a backward reference (“day before yesterday”) to a forward question (“when is Sunday”). Given Data / Assumptions: Day before yesterday = Wednesday. Find Sunday relative to today. Concept / Approach: If today is T and T - 2 = Wednesday, then today = Friday. Compute Sunday relative to Friday. Step-by-Step Solution: T - 2 = Wednesday → T = Friday.Tomorrow = Saturday.Day after tomorrow = Sunday. Verification / Alternative check: Backward confirmation: From Sunday (day after tomorrow), move back two to verify Wednesday as day before yesterday (Sun → Sat → Fri → Thu → Wed pattern consistent across offsets). Why Other Options Are Wrong: “Tomorrow” would be Saturday; “Today” would be Friday; “3 days after today” would be Monday, none equal Sunday here. Common Pitfalls: Setting today to Thursday instead of Friday by miscounting “day before yesterday.” Final Answer: Day after tomorrow

Question 6

Month-to-month weekday shift – If 1st March falls on a Saturday, determine the weekday on which 1st April will fall (no special-year caveats are needed).

Accepted Answer

Introduction / Context: We use month-length to compute weekday shifts from one month’s first day to the next month’s first day. Only the number of days in the current month matters for the shift. Given Data / Assumptions: 1 March is Saturday. March has 31 days. We seek 1 April’s weekday in the same year. Concept / Approach: Advancing by 31 days advances the weekday by 31 mod 7 = 3 days. The specific year (leap or not) does not affect this March→April shift because only March’s length is used. Step-by-Step Solution: 1 March = Saturday.Add 31 days: weekday shift = +3.Saturday + 3 = Tuesday. Verification / Alternative check: Count week blocks: 28 days (4 weeks) bring Saturday to Saturday; add 3 more days → Tuesday. Consistent. Why Other Options Are Wrong: Sunday/Monday/Thursday are ±1 day from the necessary +3 shift; only Tuesday fits exactly. Common Pitfalls: Assuming leap-year specifics change the March to April step; they do not because March always has 31 days. Final Answer: Tuesday

Question 7

Relative days – If the day before yesterday was Saturday, identify the weekday that falls on the day after tomorrow.

Accepted Answer

Introduction / Context: This item checks translating a backward reference into determining a forward weekday two days ahead of today. Given Data / Assumptions: Day before yesterday = Saturday. Find day after tomorrow. Concept / Approach: Let today be T. If T - 2 = Saturday, then T = Monday. Day after tomorrow = T + 2 = Wednesday. Step-by-Step Solution: today - 2 = Saturday → today = Monday.day after tomorrow = Monday + 2 = Wednesday. Verification / Alternative check: Timeline: Sat (T-2), Sun (T-1), Mon (T), Tue (T+1), Wed (T+2). Matches the result. Why Other Options Are Wrong: Friday/Tuesday/Thursday are ±1 or ±2 off from the computed Wednesday. Common Pitfalls: Mixing up “yesterday” with “day before yesterday.” Final Answer: Wednesday

Question 8

Pattern counting in a digit sequence – Count how many times the triple appears with 3 in the middle and 2 and 7 on either side (i.e., 2-3-7 or 7-3-2) in the given sequence.

Accepted Answer

Introduction / Context: The task is a local pattern count in a numeric sequence. We must find all consecutive triplets where the center is 3 and the neighbors are {2,7} in either order, i.e., 2-3-7 or 7-3-2. Given Data / Assumptions: Sequence (spaces denote separation): 1 1 1 1 3 3 2 2 2 3 7 7 3 3 3 6 6 4 7 3 2 4 9 8 7 7 3 2 3 3 3 4 4 2 3 7 Triplet window size = 3, slide by one each time. Concept / Approach: Slide a 3-digit window along the sequence and count windows equal to (2,3,7) or (7,3,2). Each index i contributes the triplet (a[i], a[i+1], a[i+2]). Step-by-Step Solution: Scan and mark matches: ... (2,3,7) at positions starting 9; (7,3,2) at 19; (7,3,2) at 26; (2,3,7) at 34 (1-based start indices).Total matches = 4. Verification / Alternative check: Manual recount confirms exactly four occurrences; no overlaps are missed because windows advance one step at a time and all positions are checked. Why Other Options Are Wrong: 1/2/3 undercount the found instances; counts above 4 would require extra matches that do not exist. Common Pitfalls: Ignoring the reversed pattern 7-3-2, or double-counting overlapping windows that are not valid matches. Final Answer: 4

Question 9

Perfect-square formation from selected digits – Using the 2nd, 6th, and 9th digits of 187642539, form a 3-digit number that is a perfect square of a two-digit odd number. What is the unit digit of that two-digit odd number?

Accepted Answer

Introduction / Context: From specific positions in a larger number, we must permute the selected digits to make a 3-digit perfect square whose square root is an odd two-digit number. Then, report the unit digit of that root. Given Data / Assumptions: Number: 187642539. Positions (1-based): 1=1, 2=8, 3=7, 4=6, 5=4, 6=2, 7=5, 8=3, 9=9. Chosen digits: 2nd, 6th, 9th → 8, 2, 9. Concept / Approach: List permutations of {8,2,9} and check perfect squares (particularly those consistent with odd roots). Notable 3-digit odd-root squares include 11^2=121, 13^2=169, 15^2=225, 17^2=289, 19^2=361, etc. Step-by-Step Solution: Permute digits: 289, 298, 829, 892, 928, 982.Check squares: 289 = 17^2, which uses digits 2,8,9 exactly once.The two-digit odd root is 17, whose unit digit is 7. Verification / Alternative check: None of the other permutations are perfect squares. 289 is uniquely valid here. Why Other Options Are Wrong: 1 or 9 are unit digits of some odd roots in other squares (e.g., 11, 19) but not for a square formed from {8,2,9} here. “No such number” is incorrect since 289 exists. Common Pitfalls: Mis-indexing the positions in the original 9-digit number or overlooking 289 = 17^2. Final Answer: 7

Question 10

Ranking and counts – In a class of 180 where girls are twice the number of boys, Rupesh (a boy) is 34th from the top. If 18 girls are ahead of him, how many boys are ranked below him?

Accepted Answer

Introduction / Context: This is a classic ranking and composition problem combining total counts, ratios, and position-based reasoning. Given Data / Assumptions: Total students = 180. Girls = 2 × boys ⇒ B + 2B = 180 ⇒ B = 60, G = 120. Rupesh is a boy, ranked 34th from top. Girls ahead of him = 18. Concept / Approach: Use rank to get counts above: 33 students are ahead of him. Subtract girls-ahead to get boys-ahead. Then subtract (boys-ahead + Rupesh himself) from total boys to get boys-below. Step-by-Step Solution: Ahead of Rupesh (total) = 34 - 1 = 33.Boys ahead = 33 - 18 = 15.Total boys = 60.Boys below = 60 - (boys ahead + 1) = 60 - (15 + 1) = 44. Verification / Alternative check: Boys at or above Rupesh = 16; remaining boys must be below = 44. Totals reconcile: 16 + 44 = 60. Why Other Options Are Wrong: 45/60 miscount either the boys ahead or forget to include Rupesh himself. “Cannot be determined” is incorrect given complete information. Common Pitfalls: Forgetting to include the candidate when subtracting from total boys, or mixing the girls-ahead with total-ahead wrongly. Final Answer: 44

Question 11

Row positions – Fifteen children face north. Ravi sits immediately to the left of Prabha and is 8th from the left end. Arjun is 2nd from the right end. Which statement is not true?

Accepted Answer

Introduction / Context: We combine fixed positions (8th from left; 2nd from right) with adjacency to test spatial reasoning in a linear arrangement. Given Data / Assumptions: Total = 15 seats, facing north. Ravi is 8th from left. Ravi is immediately left of Prabha ⇒ Prabha is 9th from left. Arjun is 2nd from right ⇒ 14th from left. Concept / Approach: Translate all clues into absolute positions from the left. Then evaluate each statement against these positions. Step-by-Step Solution: Prabha position = 9 (from left) ⇒ from right = 15 - 9 + 1 = 7 → Statement A is true.Distance between Prabha (9) and Arjun (14) = 14 - 9 - 1 = 4 → Statement B is true.Distance between Ravi (8) and Arjun (14) = 14 - 8 - 1 = 5 → Statement C is true.Arjun from left = 14, not 13 → Statement D is false. Verification / Alternative check: Right-based positions: Arjun 2nd from right means left index 14 (since 15,14,...). Consistent. Why Other Options Are Wrong: They are correct statements per computed positions; hence they are not the answer to “not true.” Common Pitfalls: Off-by-one mistakes when converting right-based ranks to left-based indices; forgetting “immediately left” enforces consecutive seats. Final Answer: Arjun is 13th from the left end.

Question 12

Age order logic – Rajnish is older than Rajesh and Raman. Ramesh is older than Rajesh but younger than Rajeev. Raman is older than Rajeev. Who is the oldest among them?

Accepted Answer

Introduction / Context: This is a partial-order reasoning task: consolidate pairwise comparisons into a single consistent ranking to identify the maximum (oldest) element. Given Data / Assumptions: Rajnish > Rajesh; Rajnish > Raman. Ramesh > Rajesh and Rajeev > Ramesh. Raman > Rajeev. Concept / Approach: From Rajeev > Ramesh and Ramesh > Rajesh, we have Rajeev > Ramesh > Rajesh. From Raman > Rajeev, we have Raman > Rajeev > Ramesh > Rajesh. Since Rajnish is older than both Rajesh and Raman, he must be older than everyone in that chain. Step-by-Step Solution: Chain 1: Rajeev > Ramesh > Rajesh.Chain 2: Raman > Rajeev.Combine: Raman > Rajeev > Ramesh > Rajesh.Given: Rajnish > Raman and Rajnish > Rajesh.Therefore: Rajnish is older than all others. Verification / Alternative check: No contradiction arises by placing Rajnish at the top, and all inequalities remain satisfied. Why Other Options Are Wrong: Each of Rajeev/Ramesh/Rajesh/Raman is strictly younger than someone else (ultimately younger than Rajnish), so none can be the oldest. Common Pitfalls: Missing the transitive implication from multiple pairwise comparisons; misreading “older than” directions. Final Answer: Rajnish

Question 13

Digit swap in positions – For the number 83721569, interchange (1↔5), (2↔6), (3↔7), and (4↔8). After rearrangement, which digit is third from the right end?

Accepted Answer

Introduction / Context: The problem requires performing specified index swaps and then reading an element at a given position from the right end. Given Data / Assumptions: Original digits (1-based): [8,3,7,2,1,5,6,9]. Swap pairs: (1,5), (2,6), (3,7), (4,8). Concept / Approach: Apply swaps carefully; then map “third from right” to the 6th position from the left in an 8-digit number (since 8 - 3 + 1 = 6). Step-by-Step Solution: After swaps: pos1=1, pos2=5, pos3=6, pos4=9, pos5=8, pos6=3, pos7=7, pos8=2.Third from the right = position 6 = 3. Verification / Alternative check: Right indexing: rightmost (1st)→2, 2nd→7, 3rd→3. Confirms the value 3. Why Other Options Are Wrong: 6/2/7 occur at other positions but not third from right after the prescribed swaps. Common Pitfalls: Performing swaps sequentially but reusing updated values incorrectly; here each pair is a direct swap of original positions. Final Answer: 3

Question 14

Row ranks – Akash is 5th from the left and 25th from the right. Nikhil is 11th from the right. How many boys are seated between Akash and Nikhil?

Accepted Answer

Introduction / Context: Convert mixed left/right ranks into a total count and absolute positions, then compute the number of people in between. Given Data / Assumptions: Akash: 5th from left, 25th from right. Nikhil: 11th from right. Concept / Approach: Total N = L + R - 1 for the same person. Then convert Nikhil’s right rank to a left position; finally, compute the gap between left positions minus one. Step-by-Step Solution: Akash total: N = 5 + 25 - 1 = 29.Nikhil from left = N - 11 + 1 = 29 - 11 + 1 = 19.Gap between positions 5 and 19 = 19 - 5 - 1 = 13. Verification / Alternative check: Counting from either side yields consistent totals; symmetrical ranks agree with N = 29. Why Other Options Are Wrong: 12/14/15 are off by one relative to the correct difference and the “exclude endpoints” rule. Common Pitfalls: Forgetting the “-1” in N = L + R - 1; or forgetting to subtract one when counting those in between. Final Answer: 13

Question 15

Digit swap in pairs – For 3597280164, interchange (1↔6), (2↔7), (3↔8), (4↔9), (5↔10). After rearrangement, which digit is fourth from the right end?

Accepted Answer

Introduction / Context: We perform specified swaps on a 10-digit number and then read off a position from the right side. Given Data / Assumptions: Original digits (1-based): [3,5,9,7,2,8,0,1,6,4]. Swap pairs: (1,6), (2,7), (3,8), (4,9), (5,10). Concept / Approach: After swaps, compute the final sequence and convert “fourth from right” to left index 7 (since 10 - 4 + 1 = 7). Step-by-Step Solution: After swaps: [8,0,1,6,4,3,5,9,7,2].Fourth from right = position 7 = 5. Verification / Alternative check: Rightmost positions: 1st→2, 2nd→7, 3rd→9, 4th→5. Consistent with the computed sequence. Why Other Options Are Wrong: 3/4/9 are present but not at the specified right-based index. Common Pitfalls: Mis-mapping right-based positions to left indices; mixing the order of swaps or applying swaps cumulatively on already swapped positions incorrectly. Final Answer: 5

Question 16

Time-sequence / positions in a line: In a line of boys, Ganesh is 12th from the left and Rajan is 15th from the right. They interchange their positions. After the swap, Rajan is 20th from the right. Find the total number of boys in the class.

Accepted Answer

Introduction / Context: This rank/position puzzle asks you to convert left/right positions to a single total using the identity: position_from_right = N - position_from_left + 1. Swapping helps us anchor N. Given Data / Assumptions: Ganesh: 12th from left (before swap). Rajan: 15th from right (before swap). After swapping, Rajan sits where Ganesh was and is 20th from right. Concept / Approach: For any fixed seat, its “from right” position equals N - (from left) + 1. Use the seat that was 12th from left (Ganesh’s original seat) because Rajan occupies it after swapping and we are told his right-rank there. Step-by-Step Solution: Seat at 12th-from-left has right-rank = N - 12 + 1 = N - 11.After swap, Rajan’s right-rank at that seat is 20 ⇒ N - 11 = 20.Solve: N = 31. Verification / Alternative check: If N = 31, then a seat 12th from left is (31 - 11) = 20th from right, matching the post-swap statement. Consistent. Why Other Options Are Wrong: Any N ≠ 31 gives a different right-rank for the 12th-from-left seat, contradicting the given “20th from right.” Common Pitfalls: Forgetting the +1 in the conversion formula, or trying to use both students’ original positions simultaneously (unnecessary here). Final Answer: 31

Question 17

Time-sequence / queue reasoning: In a queue of 48 people, Vijay is 14th from the front and Jack is 17th from the end (so 32nd from the front). Mary is somewhere between Vijay and Jack. If Vijay is ahead of Jack, how many persons are between Vijay an…

Accepted Answer

Introduction / Context: This is a ranks-in-queue problem. We are given absolute positions for two people and told a third is “in between” them. Typical exam convention interprets “in between” as the midpoint when discrete answer choices suggest a unique count. Given Data / Assumptions: Total people = 48. Vijay: 14th from front. Jack: 17th from end ⇒ 32nd from front. Mary is between Vijay and Jack; Vijay is ahead of Jack. Concept / Approach: Number between Vijay and Jack = (32 - 14 - 1) = 17. If Mary is exactly in the middle between them (a standard interpretation to yield a single answer), the gap from Vijay to Mary equals floor(17/2) = 8. Step-by-Step Solution: Convert Jack’s position: 48 - 17 + 1 = 32.Count between ends: 32 - 14 - 1 = 17.Mary at the middle ⇒ persons between Vijay and Mary = 8. Verification / Alternative check: With an odd count (17), the middle is 8 persons from either side, placing Mary uniquely. Why Other Options Are Wrong: 7/6/5 would not center Mary between 14th and 32nd with an odd interspace length. Common Pitfalls: Assuming “in between” merely means somewhere between (non-unique). Exam patterns usually imply midpoint when discrete answers are provided. Final Answer: 8

Question 18

Time-sequence / swapping positions: In a row of children, Bhusan is 7th from the left and Motilal is 4th from the right. After they exchange seats, Bhusan becomes 15th from the left. What is Motilal’s position from the right after the swap?

Accepted Answer

Introduction / Context: Swapping seats preserves each seat’s absolute left/right indices. Use the seat indices to deduce total N and then convert. Given Data / Assumptions: Before swap: Bhusan = 7th from left; Motilal = 4th from right. After swap: Bhusan = 15th from left ⇒ he now occupies Motilal’s old seat. Concept / Approach: If Motilal’s original seat is 15th from left and also 4th from right, then N - 15 + 1 = 4 ⇒ N = 18. Motilal after swap moves to the 7th-from-left seat (Bhusan’s old seat), so his new right-rank is N - 7 + 1. Step-by-Step Solution: N - 15 + 1 = 4 ⇒ N - 14 = 4 ⇒ N = 18.Motilal new right rank = 18 - 7 + 1 = 12. Verification / Alternative check: Check Bhusan’s after-swap index equals 15 from left (matches given). Consistent. Why Other Options Are Wrong: Other values contradict the conversion formula or the given post-swap rank. Common Pitfalls: Mixing up “person’s rank” and “seat index,” and forgetting the +1 in conversions. Final Answer: Twelfth

Question 19

Time-sequence / date intersection: Adi remembers Ana’s birthday is after 20th September but before 23rd. Father remembers it is after 21st and before 24th September. Determine Ana’s correct date of birth.

Accepted Answer

Introduction / Context: Two interval clues must be intersected to find a unique date. “After” and “before” are strict inequalities (exclude endpoints). Given Data / Assumptions: Adi: 20 < date < 23 ⇒ {21, 22}. Father: 21 < date < 24 ⇒ {22, 23}. Concept / Approach: Take the intersection of the two candidate sets to find the only date satisfying both memories. Step-by-Step Solution: From Adi: {21, 22}.From Father: {22, 23}.Intersection: {22} ⇒ 22nd September. Verification / Alternative check: 22 is indeed after 20 and before 23, and after 21 and before 24. Why Other Options Are Wrong: 21 contradicts Father’s “after 21”; 23 contradicts Adi’s “before 23”; 24 is out of both ranges. Common Pitfalls: Treating “after/before” as inclusive bounds. Final Answer: 22nd September

Question 20

Time-sequence / ranking within pass list: In a class of 45 students, among those who passed, Anmol is 11th from the top and 15th from the bottom. How many students failed?

Accepted Answer

Introduction / Context: When a person’s rank from the top and from the bottom within a subset are known, the size of that subset is top_rank + bottom_rank - 1. Subtract from class size to get failures. Given Data / Assumptions: Total class = 45. Anmol among passers: 11th from top, 15th from bottom. Concept / Approach: Let P be number of passed. Then P = 11 + 15 - 1 = 25. Failures = 45 - 25. Step-by-Step Solution: P = 11 + 15 - 1 = 25.Failures = 45 - 25 = 20. Verification / Alternative check: Counting includes the individual once, hence the subtraction of 1. Why Other Options Are Wrong: Other counts assume incorrect subset sizing or ignore the -1 rule. Common Pitfalls: Adding ranks without subtracting 1, double-counting the person. Final Answer: 20

Time Sequence Questions