2
Q:

# In how many ways the word 'SCOOTY' can be arranged such that 'S' and 'Y' are always at two ends?

 A) 720 B) 360 C) 120 D) 24

Explanation:

Given word is SCOOTY

ATQ,

Except S & Y number of letters are 4(C 2O's T)

Hence, required number of arrangements = 4!/2! x 2! = 4!

= 4 x 3 x 2

= 24 ways.

Q:

In how many ways word of 'GLACIOUS' can be arranged such that 'C' always comes at end?

 A) 3360 B) 5040 C) 720 D) 1080

Explanation:

Given word is GLACIOUS has 8 letters.

=> C is fixed in one of the 8 places

Then, the remaining 7 letters can be arranged in 7! ways = 5040.

0 186
Q:

From a group of 7 boys and 6 girls, five persons are to be selected to form a team, so that at least 3 girls are there in the team. In how many ways can it be done?

 A) 427 B) 531 C) 651 D) 714

Explanation:

Given in the question that, there are 7 boys and 6 girls.

Team members = 5

Now, required number of ways in which a team of 5 having atleast 3 girls in the team =

3 408
Q:

The number of ways in which 8 distinct toys can be distributed among 5 children?

 A) 5P8 B) 5^8 C) 8P5 D) 8^5

Explanation:

As the toys are distinct and not identical,

For each of the 8 toys, we have three choices as to which child will receive the toy. Therefore, there are $58$ ways to distribute the toys.

Hence, it is $58$ and not $85$.

2 921
Q:

In how many different ways can the letters of the word 'THERAPY' be arranged so that the vowels never come together?

 A) 1440 B) 720 C) 2250 D) 3600

Explanation:

Given word is THERAPY.

Number of letters in the given word = 7

These 7 letters can be arranged in 7! ways.

Number of vowels in the given word = 2 (E, A)

The number of ways of arrangement in which vowels come together is 6! x 2! ways

Hence, the required number of ways can the letters of the word 'THERAPY' be arranged so that the vowels never come together = 7! - (6! x 2!) ways = 5040 - 1440 = 3600 ways.

2 620
Q:

In how many different ways can the letters of the word 'HAPPYHOLI' be arranged?

 A) 89,972 B) 90,720 C) 72,000 D) 81,000

Explanation:

The given word HAPPYHOLI has 9 letters

These 9 letters can e arranged in 9! ways.

But here in the given word letters H & P are repeated twice each

Therefore, Number of ways these 9 letters can be arranged is

5 667
Q:

How many words can be formed with or without meaning by using three letters out of k, l, m, n, o without repetition of alphabets.

 A) 60 B) 120 C) 240 D) 30

Explanation:

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 =

7 758
Q:

The letters of the word PROMISE are to be arranged so that three vowels should not come together. Find the number of ways of arrangements?

 A) 4320 B) 4694 C) 4957 D) 4871

Explanation:

Given Word is PROMISE.

Number of letters in the word PROMISE = 7

Number of ways 7 letters can be arranged = 7! ways

Number of Vowels in word PROMISE = 3 (O, I, E)

Number of ways the vowels can be arranged that 3 Vowels come together = 5! x 3! ways

Now, the number of ways of arrangements so that three vowels should not come together

= 7! - (5! x 3!) ways = 5040 - 720 = 4320.

7 1254
Q:

In how many different ways can the letters of the word 'POVERTY' be arranged ?

 A) 2520 B) 5040 C) 1260 D) None

The 7 letters word 'POVERTY' be arranged in $7P7$ ways = 7! = 5040 ways.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 4, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.sawaal.com/permutations-and-combinations-questions-and-answers/in-how-many-ways-the-word-scooty-can-be-arranged-such-that-s-and-y-are-always-at-two-ends_15158", "fetch_time": 1532263244000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-30/segments/1531676593223.90/warc/CC-MAIN-20180722120017-20180722140017-00551.warc.gz", "warc_record_offset": 994025996, "warc_record_length": 16266, "token_count": 1088, "char_count": 3431, "score": 4.21875, "int_score": 4, "crawl": "CC-MAIN-2018-30", "snapshot_type": "longest", "language": "en", "language_score": 0.8788491487503052, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00013-of-00064.parquet"}