# Flextronics Reasoning Question

Views:8594
DIRECTIONS for the questions 1-2: Complete the series by choosing the appropriate option.
1. E, F, G, H, J, K, L, N, O, _?_
1. P
2. Q
3. R
4. S
After consecutive 4 alphabets one is skipped and then after 3 , next miss would happen after 2 alphabets, i.e. p will be missed and so next letter would be Q.
2. A, I, B, C, I, D, E, ? , F
1. E
2. F
3. G
4. I
From the series after every c 2 consecutive letters and I comes up, so answer is 4th option.
DIRECTIONS for the questions 3-6 : Complete the series by choosing the appropriate option.
Tara has decided to- tutor biology for the summer and is trying to plan her schedule. She can meet with up to two students a day, Monday 'through Friday, and has three students, Anu, Bhupesh, and Chirag. She needs to arrange her schedule according to the following constraints:
I. Each student meets with Tara twice a week.
II. No student meets with Tara twice in the same day.
III. Anu refuses to meet with Tara on Fridays.
IV. Chirag will never meet with Tara the day after Bhupesh has a lesson.
V. Anu and Chirag meet with Tara on the same day exactly once a week.
VI. If Anu meets with Tara on Monday, so does Bhupesh.
1. If Bhupesh is allowed to meet with Tara three times one week, on what days could he meet with her?
1. Monday, Wednesday, Friday
2. Monday, Tuesday, Wednesday
3. Tuesday, Wednesday, Thursday
4. Wednesday, Thursday,Friday
 Monday Tuesday Wednesday Thrusday Friday Anu Yes Yes No Bhupesh Yes Chirag No No Yes
If Bhupesh Comes on Wednesday,Thursday,Friday, then Chirag can not come on Thursday Friday but can come with Anu on Tuesdays and alone on Monday an Anu can come anywhere in between Wednesday and Thursday. Hence 4th is the correct Option.
2. If Tara adds Dana, a fourth student, what is the maximum number of times Dana could meet with her each week?
1. Four
2. Three
3. Two
4. One
 Monday Tuesday Wednesday Thrusday Friday Bhupesh Anu Chirag Dana

From the above arrangements it can be seen that the Max. possible times that Dana can come is 4 times. Hence 1st Option
3. If Anu cannot meet with Tara on Tuesday or Wednesday, on what day must Chirag meet with her?
1. Monday
2. Tuesday
3. Wednesday
4. Thursday
Out of the four options, since Anu cannot come on Tuesdays and Wednesday so Chirag also can’t, also if Anu comes on Monday, Bhupesh has to come and there cannot be three students with Tara on the same day, so Thursday is the correct answer, i.e. 4th option
4. If Bhupesh meets with Tara on Tuesday and Friday, on what day must Chirag meet with her?
1. Monday
2. Tuesday
3. Wednesday
4. Thursday
The possible cases are as follows :
Case 1 Here Anu can come anywhere between Tuesday and Wednesday
 Monday Tuesday Wednesday Thrusday Friday Bhupesh Anu Chirag

 Monday Tuesday Wednesday Thrusday Friday Bhupesh Anu Chirag

 Monday Tuesday Wednesday Thrusday Friday Bhupesh Anu Chirag

From the cases above Chirag must come on the Thrusdays in each case, hence 4th option.
DIRECTIONS for the questions 7-8:The question below is followed by two statements marked I and II. Mark as your answer as follows :
1. If only one statement is sufficient to answer the question but not the other
2. If either statement is sufficient to solve the question
3. If data in both statements is required to answer the question
4. If question cannot be answered by using even both statements
5. Who is father of M?
I. A and B are brothers.
II. B’s wife is sister of M’s wife.
1. 1
2. 2
3. 3
4. 4
From II, we conclude that B is the brother-in-law of M. So, even from both the statements we can’t find out who is the father of M.
6. It is 8.00 pm, when can Hemant get next bus for Ramnagar from Dharampur?
I. Buses for Ramnagar leave after every 30 minutes till 10 pm.
II. Fifteen minutes ago, one bus has left for Ramnagar.
1. 1
2. 2
3. 3
4. 4
No statement alone can tell us anything after combining - II reveals that the previous bus had left at 7.45 pm. As, given in I, the next bus would leave after 30 minutes i.e. at 8.15 pm.
7. Fill the blank spaces with the best possible option : p _ r _ q _ p _ r
1. p p r q
2. q p r q
3. r p q q
4. q r q p