Aptitude and Reasoning Questions

Each candy can be dealt with in two ways.It can be chosen or not chosen.This will give 2 possibilites for the first candy, 2 for the second, and so on.by multiplying the cases together we get 212. Since the case of no candy being selected is not an option, we have to subtract 1 from our answer.

Therefore,there are 212- 1 = 4095 ways of selecting one or more candies

      It is a case of shifting as given below:

      1  2  3  4  5                    2  1  3  5  4

      O  F  T  E  N   →  F  O  T  N  E

---------------------------------------------------------------------------

       1  2  3  4  5                   5  4  3  1  2

1.    H  E  A  R  T       →      T  R  A  H  E    

2.    O  P  E  N  S  →  S  N  E  O  P

        1  2  3  4  5         2  1  3  5  4

3.    R  I  S  K  Y  →   I  R  S  Y  K

4.    F  I  R  S  T  →   I  F  R  S  T

Hence option 3 is correct.

There is a gap of 4 letters between the first and second, second and third letters of each term, and also between the last letter of the term and first letter of next term

Daughter of your mother's father's mother => Maternal grandmother => Renu's Aunt.

Hence, Laxmi is Renu's Aunt and Vishal is Renu's Uncle.

43 x 616.6/100 + 37 x 217/100

=> 265.138 + 80.29

=>  345.428

There are total 5 ways.
we have only one kg of weight so,
2kg = 1kg + 1kg
4kg = 1 + 2 + 1
8kg = 1 + 2 + 4 + 1
16kg = 1 + 2 + 4 + 8 + 1
31kg = 1 + 2 + 4 + 8 + 16
So 5 weights are needed.

$$\begin{gathered} 6.46=6+0.46 \\ =6+4699 \\ 594+4699 \\ =>64099 \end{gathered}$$