Question

Discrete Mathematics. Counting problem.

Please answer question A), question B), question C), question D), question E), question F)

Exercise 10.12.5: Ordering jobs in a printer queue. About There are eight different jobs in a printer queue. Each job has a 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} (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 either QKJ or LPW come last? (d) How many different ways are there to order the eight jobs in the queue so that QKJ is either last or second-to-last? e) 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? (f)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) and CDP comes somewhere before BBD (again, not necessarily immediately before)?

Answer 1

et Jls Tu4 at not dilkereut usays A odes BBD 8 40310 oLe uSu, cD p aj ou ut Ca idor tu ardar dws jibs 4th CDP 1M 3 y usu in'tハ-)t tun tual uits Same rdor. y Co tt copin 1d ays 1341 to order th etgut jo tedtey to CDP Caure S Htat u Su a jueue CDPin 4th ttu usu in is BRp iy rtL C Lao dilled tn tw Tu usu in cpp in ind aueue arrenud in 7! way' Seuen in akj) LPw F32 ouete dak Ce in lau or Se ond la y euSu nd Lefere cop nd Taa JeSC6) amjd in 61 COP in su in P-i eop in 1d tu, usu 12 faey ele Sld Co Con a in s s! C3+60415 41) 6710