There are eight different jobs in a printer queue. Each job has a distinct tag which...

70.2K

Verified Solution

Question

Basic Math

There are eight different jobs in a printer queue. Each job hasa distinct tag which is a string of three upper case letters.
The tags for the eight jobs are: { LPW, QKJ, CDP, USU, BBD, PST,LSA, RHR }
How many different ways are there to order the eight jobs in thequeue so that job USU comes somewhere before CDP in the queue(although not necessarily immediately before) and CDP comessomewhere before BBD (again, not necessarily immediatelybefore)?

Answer & Explanation Solved by verified expert

4.5 Ratings (926 Votes)

Job USU comes somewhere before CDP in the queue although not necessarily immediately before CDP Case 1 If CDP is in the 1st position there is no chance to job USU to be in the before position CDP Case 2 If CDP is in the 2nd position then job USU must be in position 1 to be in the before position CDP Then the remaining 6 jobs can be ordered in 6 Ways Case 3 If CDP is in the 3rd position See Answer

Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:

Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!

Become a Member