NAME: OGUNBAMERU ANTHONY OLUWATOBI

MATRIC NUMBER: CSC/2021/01/024

LEVEL: 400

1. Modeling of a system whether system is continuous or discrete

heavily used the concepts of Ordinary Differential Equation
(ODE), Partial Differential Equation (PDE) and probability and
statistics. Describe these concepts
2. Write the equation form of a linear differential equation of order n.
State the operations which are accepted for the variable y in a
linear differential equation of order n
3. To build a Model, we need to follow the 3 basic steps in building a
model. Itemized and describe each step.
4. In order to illustrate the use of differential equations with regard to
simple population problem. We consider the easiest mathematical
model offered to govern the population dynamics of a certain
species. It is commonly called the exponential model, that is, the
rate of change of the population is proportional to the existing
population. In other words, if P(t) measures the population, we
dP
have dt =KP, where the rate k is constant. It is fairly easy to see that
if k > 0, we have growth, and if k <0, we have decay.
Solve the linear equation where P0is the initial population, i.e.
P ( 0 )=P 0.
5. Another model was proposed to remedy the flaw in the exponential
model. This modification is called the logistic model (also called
Verhulst-Pearl model). The differential equation for this model is
dP
dt (
=KP 1−
P
M )
where M is a limiting size for the population (also called the
carrying capacity). Clearly, when P is small compared to M, the
equation reduces to the exponential one. Solve this equation by
recognizing a nonlinear equation, which is separable.
5. Historically, three equations were of fundamental interest and
exhibit distinctive behaviour. These led to the clarification of three
types of second-order linear differential equations of great interest.
Present the three types of equations.
6. List 14 applications and Related Fields of PDE
7. Systems for discrete simulation are most naturally described in
imperative terms, provide one example
8. Systems for continuous simulation are most naturally described in
declarative terms, provide one example
9. Discuss the use of simulation in Education
10. Every System based on the change of time. So in a system
model time counting is a crucial thing. In a graph time is recorded
by a number called clock time or time counter. Initially it is set on
zero. Two basic methods exist for updating clock time. Itemize and
discuss the two
11. What is Discrete Simulation?
12. Discrete event Simulation is a powerful computing technique for
understanding the behavior of systems. The particular nature of the
system and the properties we wish to understand can vary. Provide
three examples of discrete simulation scenarios
13. Write on any five key features found in the software simulation
model
14. There are also three approaches to describing the discrete
simulation (Event, Activities and Process). Describe them
15. Building a simulation of gas station with a single pump served
by a single service man. Assume that arrival of cars as well their
service times are random. At first we need to identify parameters
such as states, events, entities, queue, random realization and
distribution. Briefly talk about them
16. Describe a Queuing System Structure and Parameters for
Single-server Queue
17. Present the basic assumptions and Notation for Queuing
Systems
18. shows the structure of multiple single-server queues and the
Multi-Server Queue system
19. List the basic assumptions for Multi-server Queues (M/M/N)
20. What is the integral average number of customers in a

in the system varies over time as N ( t )=2+3 t2 where 𝑡 is

queuing system. In a queuing system, the number of customers

measured in hours. Calculate the average number of customers

in the system over a 4-hour period (𝑇=4)
21. Describe the following three terns: Average response time,
the Average waiting time and throughput
22. Differentiate between the Time-sharing systems and Multi
programmed batched system systems

ANSWERS

1. The concepts are:

 Ordinary Differential Equation (ODE): An ODE is a
mathematical equation that relates a function to its derivatives
with respect to a single independent variable (e.g., time or
space). These equations are widely used to model systems that
change continuously over time or space.

 Partial Differential Equation (PDE): A PDE involves partial

derivatives of a multivariable function with respect to more than
one independent variable (e.g., time and space). PDEs are used
for modeling systems where the change depends on multiple
factors.

 Probability and Statistics: Probability deals with quantifying

uncertainty in a system, while statistics involves analyzing and
interpreting data to infer properties of a population or process.

2.

The operations are:

 Differentiating y
 Multiplying y and its derivatives by a function of the
variable x
 Adding what you obtained in the second operation
and let it is equal to a function of x.
3. Steps in building a model are:
 Step 1: Clearly state the assumptions on which the
model will be based. These assumptions should
describe the relationships among the quantities to be
studied.
 Step 2: Completely describe the parameters and
variables to be used in the model.
 Step 3: Use the assumptions (from Step 1) to derive
mathematical equations relating the parameters and
variables (from Step 2).

4.
5.
6. The three types of second-order linear differential
equations of great interest are:
 The Laplace Equation: ((d*d*u)/(d*x*x)) +
((d*d*u)/(d*y*y)) = 0 applies to potential energy
functions u= u(x, y) for a conservative force field in
the plane. PDEs of this type are called elliptic.
 The Heat Equation: ((d*d*u)/(d*x*x)) +
((d*d*u)/(d*y*y)) = d*u/d*t applies to the
temperature distribution u(x, y) in the plane when
heat is allowed to flow from warm areas to cool
ones. PDEs of this type are parabolic.
 The Wave Equation: ((d*d*u)/(d*x*x)) +
((d*d*u)/(d*y*y)) = ((d*d*u)/(d*t*t)) applies to the
heights u(x, y) of vibrating membranes and other
wave functions. PDEs of this type are called
hyperbolic.

7. Applications and Related Fields of PDE

 Differential geometry
 Global analysis, analysis on manifolds
 Probability theory and stochastic processes
 Numerical analysis
 Mechanics of solids
 Fluid mechanics
 Optics, electromagnetic theory
 Classical thermodynamics, heat transfer
 Quantum Theory
 Statistical mechanics, structure of matter
 Relativity and gravitational theory
 Geophysics
 Biology and other natural sciences
 Systems theory; control

8. Systems for discrete simulation are most naturally

described in imperative terms:
 Operation 23:
When activated:
Do certain things:
If some condition schedule operation 17 after 0 ticks;
Schedule operation 3 after 25 ticks;
Schedule operation 23 after 10 ticks.

9. Systems for continuous simulation are most naturally

described in declarative terms:
dm/ dt = 2LA - k2mA - 2k3m2 - k4mr
dr/ dt = k2mA - k4mr - 2k5r2

10. Use of Simulation in Education

Simulation in education is an innovative approach to
teaching and learning that uses virtual or real-world
scenarios to replicate real-life processes or systems. It
provides a dynamic, interactive way to enhance
understanding and skill acquisition across various
disciplines.
11. Basic c Exist for Updating Clock Time
 Time Slicing: Advances the model by a fixed
amount each time, regardless of the absence of any
events to carry out.
 Next Event: Advances the model to the next event
to be executed, regardless of the time interval. This
method is more efficient than Time Slicing,
especially where events are infrequent.
12. What is discrete simulation?
 The technique of imitating the behaviour of some
situation or system (Economic, Mechanical etc.) by
means of an analogous model, situation, or
apparatus, either to gain information more
conveniently or to train personnel.

13. Examples of discrete simulation scenarios

  A natural scientist may be interested in a system of
wolves and sheep, where the number of wolves
changes with a constant birth rate and a death rate
that is inversely proportional to the number of sheep,
and the number of sheep changes with a constant
birth rate and a death rate that is directly proportional
to the number of wolves. The scientist would like to
know the following: Do the number of wolves and
the number of sheep stabilize in the long run, and if
so to what values? Or do they vary cyclically, and if
so with what period and phase?
 A computer scientist may be interested in a system of
jobs that circulate in a network of servers (e.g.,
CPU’s and I/O devices). The computer scientist
would like to know whether a particular server is a
‘‘bottleneck’’, i.e., in the long run, is that server
always busy while the other servers are mostly idle.

 A classical system example is a queuing system with

a single server. Here, customers arrive with certain
service requirements, get served in some order, say
first-come-first-served, and depart when their service
is completed. Note that a customer who arrives when
the server is busy must wait (in a queue). For this
system, we would like to determine the average
waiting time for customers, the average number of
customers in the system, the fraction of time the
server is busy, etc.

14. Key features found in the software simulation model

are:
 Entities: Representations of real-life elements e.g. in
manufacturing these could be parts or machines.
  Relationships: Link entities together e.g. a part may
be processed by a machine.
 Simulation Executive: Responsible for controlling
the time advance and executing discrete events.
 Random Number Generator: Helps to simulate
different data coming into the simulation model.
Important that the random data can be reproduced in
different simulation runs.
 Results & Statistics: Important in validating the
model and for providing performance measures.

15. Approaches to describing the discrete simulation

 Event: This approach describes an instantaneous
change, usually from a stop event to a start event.
This is the most common one used, easy to
understand and efficient and is acceptable to
implement.
 Activities: Represents duration. Essentially groups a
number of events in order to describe an activity
carried out by an entity e.g. a machine loading. This
approach is easy to understand and to implement but
is not efficient.
 Process: This approach groups activities to describe
the life cycle of an entity e.g. a machine. This is less
common and more difficult to plan and implement
but is generally thought to be the most efficient.

16. Building a simulation of gas station with a single

pump served by a single service man:
 States: Number of cars waiting for service and
number of cars served at any moment
 Events: Arrival of cars, start of service, end of
service
 Entities: These are the cars
  Queue: The queue of cars in front of the pump,
waiting for service
 Random realizations: Inter-arrival times, service
times
 Distributions: We shall assume exponential
distributions for both the inter-arrival time and
service time.

17. Queuing System Structure and Parameters for

Single-server Queue

18. Basic Assumptions and Notation for Queuing

Systems:
 Item population: Typically, we assume an infinite
population. This means that the arrival rate is not
altered by the loss of population. If the population is
finite, then the number of items reduces the
population available for arrival currently in the
system; this would typically reduce the arrival rate
proportionally.
 Queue size: Typically, we assume an infinite queue
size. Thus, the waiting line can grow without bound.
With a finite queue, it is possible for items to be lost
from the system. In practice, any queue is finite. In
many cases, this will make no substantive difference
to the analysis. We address this issue briefly, below.
 Dispatching discipline: When the server becomes
free, and if there is more than one item waiting, a
decision must be made as to which item to dispatch
next. The simplest approach is first in, first out; this
discipline is what is normally implied when the term
queue is used. Another possibility is last in, first out.
One that you might encounter in practice is a
dispatching discipline based on service time. For
example, a packet-switching node may choose to
dispatch packets on the basis of shortest first (to
generate the most outgoing packets) or longest first
(to minimize processing time relative to transmission
time). Unfortunately, a discipline based on service
time is very difficult to model analytically.
NOTATION FOR QUEUING SYSTEMS
λ Arrival rate; mean number of arrivals per
second
Ts Mean service time for each arrival; amount of
time being served, not counting time waiting
in the queue
σTs Standard deviation of service time
ρ Utilization; fraction of time facility (server or
servers) is busy
u Traffic intensity
r Mean number of items in system, waiting and
being served (residence time)
R Number of items in system, waiting and being
served
Tr Mean time an item spends in system
(residence time)
TR Time an item spends in system (residence
time)
σr Standard deviation of r
σTr Standard deviation of Tr
w Mean number of items waiting to be served
 σw Standard deviation of w
Tw Mean waiting time (including items that have
to wait and items with waiting time = 0)
Td Mean waiting time for items that have to wait
N Number of servers
mx(y) The yth percentile; that value of y below
which x occurs y percent of the time

19. Structure of multiple single-server queues and the

Multi-Server Queue system

Multiple single-server queues

Multi-Server Queue system

20. Assumptions for Multi-server Queues (M/M/N)
 Poisson arrival rate.
 Exponential service times
 All servers equally loaded
 All servers have same mean service time
 First-in, first-out dispatching
 No items are discarded from the queue

21. Ggghhhh

22. Describe the following:

 Average response time: The response time of
customer n, denoted by Rn, is the time spent by the
customer in the system. For a given evolution, the
average response time, which we shall denote by R,
is the average of the Rn’s for the customers departing
in the evolution.
 Average waiting time: The waiting time of customer
n, denoted by Rn n, is defined by Sn = Rn – Sn. For
an evolution, the average waiting time, denoted W, is
the average of the Wn’s for the customers departing
in the evolution. (For the above evolution, the
steady-state W equals 0.5 seconds per customer.)
 Throughput: For an evolution, the throughput,
denoted by X, indicates the number of departures
over the total time of the evolution. (For the above
evolution, the steady-state X equals 0.4 customers
per second.)
23. Differentiate between the Time-sharing systems and
Multi programmed batched system systems.
Time-sharing systems Multi programmed
batched system
Focus on interactive Aim to maximize CPU
computing for multiple utilization by
users. processing jobs in
batches.
Allow real-time user Do not allow user
interaction through interaction; jobs are
terminals. preloaded and
processed.
Provide fast response Focus on throughput,
times to support user not response time.
interaction.
Allocate CPU time Execute jobs
slices to users. sequentially without
interruption.
Support multiple active Handle multiple jobs
users simultaneously. but without active user
presence.