Permutations and CombinationsMCQMTP Nov 18Question 1707 of 251
All Questions

A Company wishes top simultaneously promotes three of its 8 department assistant mangers. In how many ways these promotions can take place?

Options

A336
B56
C8
D1680
For any discrepancies in this question, email contact@cadada.in

Correct Answer

✅ Option a — 336

All Options:

  • A336
  • B56
  • C8
  • D1680

Ad

Detailed Solution & Explanation

A company wants to promote 3 of its 8 assistant managers.
1. If the promotions are to 3 identical positions, then we simply choose 3 managers out of 8:
Ways=8C3=8×7×63×2×1=56 ways\text{Ways} = ^8C_3 = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = 56 \text{ ways}
This corresponds to Option B.
2. If the promotions are to 3 distinct roles/departments (so that the order in which they are chosen or assigned matters), the number of ways is:
Ways=8P3=8×7×6=336 ways\text{Ways} = ^8P_3 = 8 \times 7 \times 6 = 336 \text{ ways}
This corresponds to Option A.
Following the textbook answer key, Option A (336) is marked as correct, assuming the positions are distinct.
Hence, **Option A** is the correct answer.

About This Chapter: Permutations and Combinations

Paper

Paper 3: Quantitative Aptitude

Weightage

4-6 Marks

Key Topics

Factorials, Permutations, Combinations

This chapter deals with the fundamental principles of counting. It covers factorials, circular permutations, restricted permutations, combinations, and the differences between selecting items versus arranging them.

View Official ICAI Syllabus

Exam Strategy Tip

The most common mistake is confusing 'P' (Arrangement) with 'C' (Selection). If order matters (like opening a lock), use P. If order doesn't matter (like choosing a team), use C.

Related Comparison Tables

Permutations vs Combinations: The Quantitative Aptitude Guide

More Questions from Permutations and Combinations

The value of N\displaystyle N in N!+17!=18!\displaystyle N! + \frac{1}{7!} = \frac{1}{8!} is

A person can go from place 'A' to 'B' by 11 different modes of transport but is allowed to return to 'A' by any mode other than the one earlier. The number of different ways in which the entire journey can be completed is:

If a man travels from place A to B in 10 ways then by how many ways can he come back by another train?

If n!10(n−1)!=(n−1)!(n−3)!\displaystyle \frac{n!}{10(n-1)!} = \frac{(n-1)!}{(n-3)!} find 'n'.

Which of the following is a correct statement.

nP3=2⋅nP2\displaystyle ^nP_3 = 2 \cdot ^nP_2. Find n\displaystyle n.

Ready to Master Permutations and Combinations?

Practice all 251 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.

Start Practicing — It's Free