Goose can Honk without using a Horn. Geese are waterfowl of the family Anatidae.

Let the Original capital amount be Rs. P

Given after 2 years the amount is Rs. 10000

Rate of interest = 30%

According to the question,

$$\begin{gathered} P x 130100 x 130100 = 10000 \\ => P = 1000000169 = 5917 \end{gathered}$$

Therefore, the capital amount P = Rs. 5917

Given letters are k, l, m, n, o = 5

number of letters to be in the words = 3

Total number of words that can be formed from these 5 letters taken 3 at a time without repetation of letters = 5P3 ways.

⇒ 5P3 = 5 x 4 x 3 = 60 words.

Jules Rimet Trophy is associated with the game Football.

The Jules Rimet Trophy was named in the honour of Jules Rimet, who is FIFA's longest-serving president, in office for 33 years.

Let the speed of current = 'C' km/hr

Given the speed of boat in still water = 6 kmph

Let 'd' kms be the distance it covers.

According to the given data,

Boat takes thrice as much time in going the same distance against the current than going with the current

i.e, d8 - C = 3 × d8 + C

$$\begin{gathered} ⇒ 24 - 3C = 8 + C \\ ⇒ 4C = 16 \\ ⇒ C = 4 kmph \end{gathered}$$

Hence, the speed of the current C = 4 kmph.

Durand Cup is associated with the game of Football.

The Durand Football Tournament or Durand Cup is a football competition in India which was first held in 1888. This competition was named after its founder, Sir Mortimer Durand from Simla.

Here Joystick is the word doesn't belong with the others.

Because Except Joystick all others are Output Devices whereas Joystick is Input Device.

VDU - Visual Display Unit - Monitor to display

Speakers - Output sound

Plotter - used to produce single or multiple colored images.

This question concerns a committee’s decision about which five of eight areas of expenditure to reduce. The question requires you to suppose that K and N are among the areas that are to be reduced, and then to determine which pair of areas could not also be among the five areas that are reduced.

The fourth condition given in the passage on which this question is based requires that exactly two of K, N, and J are reduced. Since the question asks us to suppose that both K and N are reduced, we know that J must not be reduced:

Reduced         ::      K, N
Not reduced   ::      J

The second condition requires that if L is reduced, neither N nor O is reduced. So L and N cannot both be reduced. Here, since N is reduced, we know that L cannot be. Thus, adding this to what we’ve determined so far, we know that J and L are a pair of areas that cannot both be reduced if both K and N are reduced:

Reduced        ::      K, N
Not reduced  ::      J, L

Answer choice (B) is therefore the correct answer.