1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
kolbaska11 [484]
3 years ago
5

There are eight different jobs in a printer queue. Each job has a distinct tag which is a string of three upper case letters. Th

e tags for the eight jobs are:
{LPW,QKJ,CDP,USU,BBD,PST,LSA,RHR}

a. How many different ways are there to order the eight jobs in the queue?
b. How many different ways are there to order the eight jobs in the queue so that job USU comes immediately before CDP?
c. How many different ways are there to order the eight jobs in the queue so that job USU comes somewhere before CDP in the queue, although not necessarily immediately before?
d. How many different ways are there to order the eight jobs in the queue so that either QKJ or LPW come last?
e. How many different ways are there to order the eight jobs in the queue so that QKJ is either last or second-to-last?
Mathematics
1 answer:
Vikentia [17]3 years ago
5 0

Answer:

a. 40320 ways

b. 10080 ways

c. 25200 ways

d. 10080 ways

e. 10080 ways

Step-by-step explanation:

There are 8 different jobs in a printer queue.

a. They can be arranged in the queue in 8! ways.

No. of ways to arrange the 8 jobs = 8!

                                                        = 8*7*6*5*4*3*2*1

No. of ways to arrange the 8 jobs = 40320 ways

b. USU comes immediately before CDP. This means that these two jobs must be one after the other. They can be arranged in 2! ways. Consider both of them as one unit. The remaining 6 together with both these jobs can be arranged in 7! ways. So,

No. of ways to arrange the 8 jobs if USU comes immediately before CDP

= 2! * 7!

= 2*1 * 7*6*5*4*3*2*1

= 10080 ways

c. First consider a gap of 1 space between the two jobs USU and CDP. One case can be that USU comes at the first place and CDP at the third place. The remaining 6 jobs can be arranged in 6! ways. Another case can be when USU comes at the second place and CDP at the fourth. This will go on until CDP is at the last place. So, we will have 5 such cases.

The no. of ways USU and CDP can be arranged with a gap of one space is:

6! * 6 = 4320

Then, with a gap of two spaces, USU can come at the first place and CDP at the fourth.  This will go on until CDP is at the last place and USU at the sixth. So there will be 5 cases. No. of ways the rest of the jobs can be arranged is 6! and the total no. of ways in which USU and CDP can be arranged with a space of two is: 5 * 6! = 3600

Then, with a gap of three spaces, USU will come at the first place and CDP at the fifth. We will have four such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 4 * 6!

Then, with a gap of four spaces, USU will come at the first place and CDP at the sixth. We will have three such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 3 * 6!

Then, with a gap of five spaces, USU will come at the first place and CDP at the seventh. We will have two such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 2 * 6!

Finally, with a gap of 6 spaces, USU at first place and CDP at the last, we can arrange the rest of the jobs in 6! ways.

So, total no. of different ways to arrange the jobs such that USU comes before CDP = 10080 + 6*6! + 5*6! + 4*6! + 3*6! + 2*6! + 1*6!

                    = 10080 + 4320 + 3600 + 2880 + 2160 + 1440 + 720

                    = 25200 ways

d. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways. Similarly, if LPW comes last, the remaining 7 jobs can be arranged in 7! ways. so, total no. of different ways in which the eight jobs can be arranged is 7! + 7! = 10080 ways

e. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways in the queue. Similarly, if QKJ comes second-to-last then also the jobs can be arranged in the queue in 7! ways. So, total no. of ways to arrange the jobs in the queue is 7! + 7! = 10080 ways

You might be interested in
You roll a fair 6-sided die. what is the probability rolling greater than 4
Readme [11.4K]

Answer:

1/3

Step-by-step explanation:

There are 6 possible outcomes when you roll this die: 1,2,3,4,5 and 6. Of these, only 5 and 6 are greater than 4, which is 2 successful outcomes. Probability is successful outcomes/total outcomes = 2/6 = 1/3. Hope this helps!

6 0
3 years ago
Can somebody help me I will mark brainliest
bixtya [17]

Answer:

Hope this helps

Step-by-step explanation:

a) <e and <c

b) <c and <b

c) <c and <a

d) <c and <b,  <c and <d, <d and <e, <e and <a, <a and <b

e) c = 30, a = 90, b= 60, e= 30, d= 150

6 0
3 years ago
Read 2 more answers
Y³+3x²y+3xy²+y³-3x²y what is the answer
bazaltina [42]
y^{2}  (2y + 3x) 
7 0
3 years ago
Find the product or type<br> "impossible"<br> 4<br> [1 -2 1] 5<br> 16]
pogonyaev
The product is 5 the answer
4 0
3 years ago
What is the square root of 9567.26?
Nuetrik [128]
There is no square root
7 0
3 years ago
Other questions:
  • The base of an exponential function cannot be a negative number true or false
    5·2 answers
  • How many more pepperoni pizza were sold than ham pizzas?
    12·2 answers
  • Write five million, seven hundred thousand,seven hundred fifty-two using digits
    10·2 answers
  • A committee is to consist of two members. If there are five men and six women
    15·1 answer
  • Pam flips a coin 12 times. The coin lands on heads 8 times. What is the theoretical
    7·1 answer
  • Which of the following will simplify to the
    6·1 answer
  • Solve for x? pls help
    5·1 answer
  • THere are 60 dogs in the park. 20% of them are golden retrievers. How many golden retrievers are there in the park? Use a propor
    14·1 answer
  • I'm struggling with this question that will be on my test. Our teacher said we're allowed to use our resources, including Brainl
    12·1 answer
  • Given that NQ ll PR, find NP
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!