$1.$ What does it mean for a M$/$M$/1$ system to be memoryless?

a$)$ The interarrival time probability distribution is independent of its history.

b$)$ Any time may be marked down as time zero; the expected time you must wait for the next arrival has nothing to with the time of the last arrival.

c$)$ The arrival rate distribution can be assumed Poisson and the interarrival time distribution assumed exponential

d$)$ All of the above

e$)$ None of the above

$2.$ A queueing system works best when the average server utilization, r$,$ satisfies:

a$)$ r $=0\mathrm{.}0$

b$)0\mathrm{.}8<$ r $<1\mathrm{.}0$

c$)0\mathrm{.}0<$ r $<0\mathrm{.}8$

d$)$ r $<1\mathrm{.}0$

e$)$ r $=1\mathrm{.}0$

$3.$ The average number of entities, L$,$ in a queueing system at any given time does NOT depend on:

a$)$ Mean time arrived

b$)$ Mean arrival rate

c$)$ Mean service time

d$)$ it depends on all of these

e$)$ It doesn't depend on any of these

$4.$ An advantage of simulation over queueing theory models is:

a$)$ Simulation requires less data than queueing theory models

b$)$ Simulation is less complicated than queueing theory model

c$)$ Simulation allows us to relax our assumptions regarding arrival and service distributions

d$)$ All of the above are advantages of simulation

e$)$ None of the above are advantages of simulation