TSCAB Recruitment Reasoning Ability Exam Pattern | ||||
---|---|---|---|---|

S. No. | Name of Tests (objective) | No. of questions | Max. Marks | Time allotted for each test (Separately timed) |

1. | General/Financial Awareness |
50 | 50 | 35 Minutes |

2. | General English |
40 | 40 | 35 Minutes |

3. | Reasoning Ability & Computer Aptitude. |
50 | 50 | 45 Minutes |

4. | Quantitative Aptitude |
50 | 50 | 45 Minutes |

Total |
190 |
190 |
160 Minutes |

TSCAB Recruitment Reasoning Ability - Syllabus | |
---|---|

S. No. | Name of the Topic |

1. | Number Coding |

2. | Inserting Correct Mathematical Sign |

3. | Odd Man Out |

4. | Mutual Relation Problem |

5. | Coding and Decoding |

6. | Syllogisms |

7. | Circular and/or Linear Seating Arrangement |

8. | Statements and Assumptions |

Eight Children

- U sits second to the left of W and both of them sits on different types of chair. V sits second to the left of R and both sit on the same type of chair.
- T is on a wooden chair but opposite to U. Q and S are immediate neighbours of U.
- P does not sits on a wooden chair and the child who sits opposite to P does not sit on the same type of chair.
- The child who is an immediate neighbour of W and T sits on a plastic chair.

We are given a 5 digit number

Let first digit be 'X'

then 5th digit is '3X'

let 2nd digit be 'Y'

then 3rd digit is 'Y - 3'

and 4th digit is 'Y + 4'

then the no is '(X)(Y)(Y - 3)(Y + 4)(3X)'

from the above we can say 3X ≤ 9

so X ≤ 3 and any of the digit in the number is ≤ 9

and also given that 3 pairs sum is 11...

Also Y – 3 ≥ 0 and Y + 4 ≤ 9

[latex]\Rightarrow[/latex] Y ≥ 3 and Y ≤ 5 i.e. Y = 3,4 or 5

for x = 1, all the conditions won’t be satisfied.

For x = 2,

Let Y = 5

∴ The number is 25296

Let’s find a number which is completely divisible by 4, 6, 8, 12 and 16.

To find such number, we need to find the LCM of all these numbers

LCM of (4,6) , 8 , 12 , 16

= 12 , 8 , 12 , 16

= LCM of (12 , 8) , LCM of (12 , 16)

= 24 , 48

= LCM of (24 , 48)

= 48

Hence 48 + 2 ie 50 will leave a remainder of 2 if divided by any of the following numbers : 4, 6, 8, 12 and 16

Since we need to use all 4 digits of the given number, we need to see that the sum of digits 6,4,8,1 = 19

And divisibility rule of 9 says that

For a number to be divisible by 9, the sum of its digits should be divisible by 9.

Hence, we can say that no numbers can be formed using all 4 digits and still divisible by 9.

Numbers are [latex]({2}^{3} - 1), ({3}^{3} - 1), ({4}^{3} - 1), ({5}^{3} - 1), ({6}^{3} - 1), ({7}^{3} - 1)[/latex] etc.

So, the next number is [latex] ({(8)}^{3} - 1) = (512 - 1) = 511.[/latex]

There are two series (8, 11, 14, 17, 20) and (7, 12, 17, 22) increasing by 3 and 5 respectively.

As MANSON is a 6 letter word so its code is 6 – 1 = 5

Similarly BELIEVED is a 8 letter word and its code is 8 – 1 = 7

Based on the similar pattern NEGOTIABLE is a 10 letter word so its code is 10 – 1 = 9

© 2013 - 2023 SPLessons.com