# Simulation is basically a technique which is used for

1.  Optimisation

2.  Testing alternatives

3.  Cost minimisation

4.   Computerisation

4

Testing alternatives

Explanation :
No Explanation available for this question

# Simulation technique is used

1.  To analyse and evaluate a system performance

2.  To accommodate a great degree of complexity

3.  To determine the system outcome

4.  All of these

4

All of these

Explanation :
No Explanation available for this question

# The pseudo random number generated should produce the sequence which is

1.  Uniformly distributed

2.  Statically independent

3.  Reproducible

4.  All of these

4

All of these

Explanation :
No Explanation available for this question

# Method used to generate Pseudo-random number is

1.  Mid – square method

3.  Multiplicative congruence method

4.  Mixed congruence method

5.   All of these

5

All of these

Explanation :
No Explanation available for this question

# If seed number = 3, a = 2, b = 3, m = 10, then period of cycling by congruential method will be

1.  1

2.  2

3.  4

4.  8

4

4

Explanation :
No Explanation available for this question

# If a = 2, b = 3, m = 10. If r3 = 1, then seventh random number will be

1.  0

2.  1

3.  2

4.  4

4

1

Explanation :
No Explanation available for this question

# A set of two or more vertices which belong to the network and may represent event, place, stage or a storage point is called

1.  Node

2.  Vertices

3.  Points

4.  All of these

4

All of these

Explanation :
No Explanation available for this question

# The final | end | destination node is called

1.  Source node

2.  Sink node

3.  Burst node

4.  None of these

4

Sink node

Explanation :
No Explanation available for this question

# For any network, value of the maximum flow from the source to sink is equal to the capacity of

1.  Cut

2.  Minimal cut

3.  Both (a) and (b)

4.   None of these

4

Minimal cut

Explanation :
No Explanation available for this question

# A collection of oriented branches such that every oriented path from source to sink contains at least one branch in it, is

1.  A cut in a network

2.  Capacity of the cut

3.  Minimal cut

4.  None of these

4