Let 4 girls be one unit and now there are 6 units in all.

They can be arranged in 6! ways.

In each of these arrangements 4 girls can be arranged in 4! ways. 

Total number of arrangements in which girls are always together = 6! x 4!= 720 x 24 = 17280

i=j/m

PV=
FV(1+  i)^-n

There are 4 books on fairy tales and they have to be put together. They can be arranged in 4! ways.

Similarly, there are 5 novels.They can be arranged in 5! ways.

And there are 3 plays.They can be arranged in 3! ways.

So, by the counting principle all of them together can be arranged in 4!´5!´3! ways = 17280

They have to be arranged in the following way :

                                                                    L  T  L  T  L  T  L  T  L

The 5 lions should be arranged in the 5 places marked ‘L’.

This can be done in 5! ways.

The 4 tigers should be in the 4 places marked ‘T’.

This can be done in 4! ways.

Therefore, the lions and the tigers can be arranged in 5!´ 4! ways = 2880 ways.

Let the beds be numbered 1 to 7.

Case 1 : Suppose Anju is allotted bed number 1. 

Then, Parvin cannot be allotted bed number 2. 

So Parvin can be allotted a bed in 5 ways. 

After alloting a bed to Parvin, the remaining 5 students can be allotted beds in 5! ways.

So, in this case the beds can be allotted in 5´5!ways = 600 ways.

Case 2 : Anju is allotted bed number 7. 

Then, Parvin cannot be allotted bed number 6 

As in Case 1, the beds can be allotted in 600 ways.

Case 3 : Anju is allotted one of the beds numbered 2,3,4,5 or 6. 

Parvin cannot be allotted the beds on the right hand side and left hand side of Anju’s bed. For example, if Anju is allotted bed number 2, beds numbered 1 or 3 cannot be allotted to Parvin.

Therefore, Parvin can be allotted a bed in 4 ways in all these cases.

After allotting a bed to Parvin, the other 5 can be allotted a bed in 5! ways.

Therefore, in each of these cases, the beds can be allotted in 4´ 5! = 480 ways. 

The beds can be allotted in (2x 600 + 5 x 480)ways = (1200 + 2400)ways = 3600 ways

We have to find number of permutations of 4 objects out of 6 objects.

This number is 6P4= 360

Therefore, cards can be sent in 360 ways.

We have to arrange 6 books.

The number of permutations of n objects is n! = n. (n – 1) . (n – 2) ... 2.1

Here n = 6 and therefore, number of permutations is 6.5.4.3.2.1 = 720

Kernel follows Round Robin scheme choosing a swap device among the multiple swap devices in Unix System V.