Self Studies

Permutation Tes...

TIME LEFT -
  • Question 1
    1 / -0

    Directions For Questions

     

    A tournament is arranged as per the following rules: in the beginning 16 teams are entered and divided in 2 groups of 8 teams each where the team in any group plays exactly once with all the teams in the same group. At the end of this round top four teams from each group advance to the next round in which two teams play each other and the losing teams goes out of the tournament. Then the winning teams play for semi finals and finally there is one final. The rules of the tournament are such that every match can result only in a win or a loss and not in a tie. 

    ...view full instructions

    The total number of matches played in the tournament is equal to

  • Question 2
    1 / -0

    Directions For Questions

     

    A tournament is arranged as per the following rules: in the beginning 16 teams are entered and divided in 2 groups of 8 teams each where the team in any group plays exactly once with all the teams in the same group. At the end of this round top four teams from each group advance to the next round in which two teams play each other and the losing teams goes out of the tournament. Then the winning teams play for semi finals and finally there is one final. The rules of the tournament are such that every match can result only in a win or a loss and not in a tie. 

    ...view full instructions

    Find the maximum number of matches that a team going out of the tournament in the first round itself can win.

  • Question 3
    1 / -0

    Directions For Questions

     

    A tournament is arranged as per the following rules: in the beginning 16 teams are entered and divided in 2 groups of 8 teams each where the team in any group plays exactly once with all the teams in the same group. At the end of this round top four teams from each group advance to the next round in which two teams play each other and the losing teams goes out of the tournament. Then the winning teams play for semi finals and finally there is one final. The rules of the tournament are such that every match can result only in a win or a loss and not in a tie. 

    ...view full instructions

    Which of the following statements about a team which has already qualified for the second round is true?

  • Question 4
    1 / -0

    Directions For Questions

    Number of ways of distributing 'n' different things into 'r' different groups is equal to 'rn'  when blank groups are taken into account and is equal to rn - rC1(r - 1)n  +  rC2 (r - 2)2 - .....+ (-1)r - 1  rCr - 1 when blank groups are not permitted. 

    ...view full instructions

    6 different balls have to be given to 3 children. Find the number of ways of distribution if each child gets at least one ball.

  • Question 5
    1 / -0

    Directions For Questions

    Number of ways of distributing 'n' different things into 'r' different groups is equal to 'rn'  when blank groups are taken into account and is equal to rn - rC1(r - 1)n  +  rC2 (r - 2)2 - .....+ (-1)r - 1  rCr - 1 when blank groups are not permitted. 

    ...view full instructions

     A function is defined from a set A containing 6 elements to a set B containing 4 elements. In how many of these functions exactly one element of the set B is not an image

  • Question 6
    1 / -0

    Directions For Questions

    A cricket team of 11 players is to be selected from 8 batsmans, 6 bowlers, 4 all rounder and 2 wicket keepers. Answer the following question based on the information given.

    ...view full instructions

    Find the number of selections when at most 1 all rounder and 1 wicket keeper will play.

  • Question 7
    1 / -0

    Directions For Questions

    A cricket team of 11 players is to be selected from 8 batsmans, 6 bowlers, 4 all rounder and 2 wicket keepers. Answer the following question based on the information given.

    ...view full instructions

    Find the number of selection when 2 particular batsmen don't want to play when a particular bowler will play.

  • Question 8
    1 / -0

    The largest integer 'n' such that 33! is divisible by 2n is

Submit Test
Self Studies
User
Question Analysis
  • Answered - 0

  • Unanswered - 8

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
Submit Test
Selfstudy
Selfstudy
Self Studies Get latest Exam Updates
& Study Material Alerts!
No, Thanks
Self Studies
Click on Allow to receive notifications
Allow Notification
Self Studies
Self Studies Self Studies
To enable notifications follow this 2 steps:
  • First Click on Secure Icon Self Studies
  • Second click on the toggle icon
Allow Notification
Get latest Exam Updates & FREE Study Material Alerts!
Self Studies ×
Open Now