Home
Class 10
BIOLOGY
In a forest there are two types of deers...

In a forest there are two types of deers, in which one type of deer can run very fast. Where as second type of deer can not run as fast as the first one. Lions, Tigers hunt deers for their food. Imagine which type of deers are going to survive in the forest and which type of deers population is going to be eliminated? And why?

Promotional Banner

Similar Questions

Explore conceptually related problems

In a forest there are two types of deer, in which one type of deer can run very fast . Whaereas second type of deer can not run as fast as the first one. Lions, tigers hunt der for their food. Imagine which type of deer is going to survive in the ofrest, which type of deer population is going to be eliminated? And why ?

A deer in a forest can not run properly and it is not possible for it to live for a long time which law of darwin explains it?

A : the number of ways in which 5 boys and 5 girls can sit in a row so that the boys and girls sit alternatively is 28800 . R : the number of ways in which n ( first type of differernt ) things and n ( second type of different ) things cna be arranged in a row alternatively is 2 xx n! xx n! ,

A : the number of ways in which 5 boys and 5 girls can be sit in a row so that all the girls sit together is 86400. R : The number of ways in which m ( first type of different ) things and n ( second type of different things cna be arranged in a row so that all the second type of things come together is n ! ( m+ l) ! .

Assertion (A): The number of ways in which 5 boys and 5 girls can sit in a row so that all the girls sit together is 86400. Reason (R) : The number of ways in which m (first type of different) things and n (second type of different) things can be arranged in a row so that all the second type of things come together is n!""^((n+1))P_(m) The correct answer is

A : the number of ways in which 5 boys and 3 girls can sit in a row so that two girls come together is 5 ! ""^(6) P_(5) R : the number of ways of ways in which m ( first type of different ) things and n ( second type of different ) things ( m + 1 ge n) can be arranged in a row so that no two things of second kind come together is m! ""^((m+1)) P_(n)