



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Key concepts and questions related to arena simulation software, including the primary modeling approach 'world view', the sequence of arena modules for customer arrivals and server usage, the properties of various random number generators, and the statistical tests used to evaluate the quality of pseudo-random number generators. A comprehensive overview of fundamental arena simulation modeling techniques and random number generation principles, making it a valuable resource for students and professionals working with discrete-event simulation tools like arena.
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!




What is the name of Arena's primary modeling approach
"world view"?
A) Process-
Interaction B) Event-
Scheduling C) Continuous Modeling
FlowchartD) Mixed
ModelingE) Event-Interaction - ANSWER-A) Process
Interaction
What sequence of Arena modules would you
usegenerate to customer arrivals, use a
server, and then have customers leave the
system after they're done with the server? - ANSWER-Create-Process-
Dispose
(ARENA) TRUE or FALSE? A Create module allows you the use a variety of
customerinterarrival time distributions. - ANSWER-
(ARENA) What is Seize-Delay-Release? - ANSWER-Grab at least one
resource(server), spend time getting served, and then free the server for the next
customer.you seize andIf the server isn't available, you may have to wait in
a queue.
(ARENA) What is a seize-delay? - ANSWER-Grab at least one resource and
spend time getting served. Remember to release the server sometime later,
elsedeadlocked he gets and a giant line will
form.
(ARENA) What is a delay-release? - ANSWER-Use a previously seize'd for a
while, and then free him for the next guy
to use.
(ARENA) Which of the following action sequences can you find in a Process
module?
Delay B) Seize-
DelayC) Delay-
ReD) leaSeize-Delay-se
Release E) All of the above - ANSWER-all of duh
abuv
(ARENA) TRUE or FALSE? A process is generally considered to consist of
bothresource a and its associated queue. - ANSWER-
(ARENA) TRUE or FALSE? You can change the number of servers on duty
(i.e., the capacity) for a resource using the Resource spreadsheet. -
(ARENA) TRUE or FALSE? You can a queue discipline from FIFO to LIFO with
one click by using the Queue spreadsheet. - ANSWER-
Which property is not desirable for a good pseudo-random number
generator?(a) The numbers must appear to be
Unif(0,1).(b) The numbers be approximately
independent. (c) We should be able to generate the PRNs very, very
quickly.(d) We must be able to look up the series of PRNs from
a(e) table. We can reproduce any sequence of PRNs if called upon to do so. -
ANSWER-(d)must be able We to look up the series of PRNs from a
table.
What is a random device? - ANSWER-Considered a lousy generator, nice
randomnessproperties. However, Unif(0,1) sequence storage is tough so it's tough
toexperimen repeat
t.
An example is flip a coin or least significant digits of
atomic clock
What is a random number table? - ANSWER-It is a lousy random number
generatorused to be that used in like the 1950s, lots of digits supplied
in tables.
What is the mid-square method (J. von Neumann) for random number
generation?
ANSWER-Idea: Take the middle part of the square of the previous random
number.
Its pretty shitty and it tends to degenerate (all results end up being 0 at
some point when you are
iterating)
Which of the following PRN generators aren't very
good?a) Generators involving physical devices such as coin flips or least
significant digit readings from an atomic
clock.b) Random number
tables. c) von Neumann's mid-square
method.d) Fibonacci and additive congruential
generators.e) All of the above. - ANSWER-e) All of the
above.
What are the most commonly used random number generators in
practiceANSWER-Linear today? - Congruential
Generators
What is the LCG general formula? - ANSWER-Xi = (aXi-1 + c)
mod m Ri =
Xi/m
What is the period in a random number generator? - ANSWER-The amount of
time until the LCG starts to repeat itself. Also called cycle length and you generally
want a long one for a good
generator.
c) Accept the goodness-of-fit test and declare that the PRNs are probably
uniform.
d) Accept the goodness-of-fit test and declare that the PRNs are probably
independent. e) Panic at the disco! - ANSWER-a) Reject the goodness-of-fit test and
declare that the PRNs are probably not
uniform.
What is a run? - ANSWER-A run is a series of similar
observations.
What is a run test? - ANSWER-A runs test will reject the null
hypothesisindependence of if there are too many or too few runs, whatever
that means.
TRUE or FALSE? Unif(0,1) pseudo-random numbers can be used to generate
pretty much any other random variates, e.g., exponential, normal, and
Poisson. - ANSWER- True
If is a continuous random variable with
c.d.f.
(), what's the distribution
of ()?
Unif(0,
1 Nor(0,1)
)Triangula
r Exp()
All of the
above -
Unif(0,1)
If is a
Unif(0,1)
random
variable,
what's
the
distributi
on of
Unif(0,
1 Nor(0,1)
)Triangula
r Exp()
All of the
above -
Exp()
TRUE or FALSE? If you can't find a good theoretical distribution to model a
certain random variable, you might want to use the empirical distribution of
the data to do so. - ANSWER-True
TRUE or FALSE? The convolution method involves sums of random
variables. - ANSWER-True
Suppose that 1 and 2 are PRNs. What's the distribution of 1+2?
Unif(0,
2 Nor(0,2)
)Triangular(0,1,
Exp( 2 ) -
Triangular(0, 1 ,
YES or NO? As in the notes, suppose that I want to generate a simple Unif(2/3,
R. Suppose I generate a
1=0.16. Do I
accept
1 as my Unif(2/ 3 , 1)? -
ANSWER- No
Suppose that is a continuous RV with p.d.f. ()=304(1−), for
0<<1.acceptance-rejection Why is a good method to use to
generate
Because is always
positiveBecaus
e
is almost
Becaus normal
e
is almost
exponential Because the c.d.f.
of
is very hard to
invert None of the above - ANSWER-Because the c.d.f. of is very hard
to invert
TRUE or FALSE? The A-R algorithm
for
∼𝑜𝑖() tells us to generate
PRNs until
for the first time, and then
set
True