Вы находитесь на странице: 1из 17

# RESOURCE MANAGEMENT TECHNIQUES

CS6704
UNIT I
1. In the simplex method, the slack, surplus and artificial variables are restricted to be
a. multiplied b. Negative c. non-negative d. divided
2. In simplex method basic solution set as (n-m), all the variables other than basic are
classified as
a. constant variable b.non positive variables
c. basic variables d. non-basic variable
3. In simplex method, the feasible basic solution must satisfy the
a. non-negativity constraint b.negativity constraint
c. basic constraint d.common constraint
4. According to algebra of simplex method, the slack variables are assigned zero
coefficients because
a. no contribution in objective function
b. high contribution in objective function
c. divisor contribution in objective function
d. base contribution in objective function
5. The third requirement of simplex method is that all the variables are restricted to
include
a. negative even values
b. odd values
c. even values
d. non-negative values
6. Decision Science approach is
a. Multi-disciplinary b. Scientific c. Intuitive d. All of the above
7. For analyzing a problem, decision-makers should study
a. Its qualitative aspects b. Its quantitative aspects
c. Both a & b d. Neither a nor b
8. Decision variables are
a. Controllable b. Uncontrollable c. Parameters d. None of the above
9. Every mathematical model
a. Must be deterministic b. Requires computer aid for its solution
c. Represents data in numerical form d. All of the above
10. The quantitative approach to decision analysis is a
a. Logical approach b. Rational approach
c. Scientific approach d. All of the above
11. The distinguishing feature of an LP model is
a. Relationship among all variables is linear
b. It has single objective function & constraints
c. Value of decision variables is non-negative
d. All of the above
12. Which of the following is not a characteristic of the LP
a. Resources must be limited
b. Only one objective function
c. Parameters value remains constant during the planning period
d. The problem must be of minimization type
13. Operations research is the application of ____________methods to arrive at the
optimal solutions to the problems.
a. Economical b. Scientific c. a and b both dD. Artistic
14. Mathematical model of Linear Programming is important because
a. It helps in converting the verbal description and numerical data into mathematical
expression
b. decision makers prefer to work with formal models
c. it captures the relevant relationship among decision factors
d. it enables the use of algebraic techniques
15. Operation research analysts do not
a. Predict future operation
b. Collect the relevant data
c. Build more than one model
d. Recommend decision and accept
16. In graphical method the restriction on number of constraint is __________
a. 2 b. not more than 3 c. 3 d. none of the above
17. An iso-profit line represents
a. An infinite number of solutions all of which yield the same profit
b. An infinite number of solution all of which yield the same cost
c. An infinite number of optimal solutions
d. A boundary of the feasible region
18. While plotting constraints on a graph paper, terminal points on both the axes are
connected by a straight line because
a. The resources are limited in supply
b. The objective function as a linear function
c. The constraints are linear equations or inequalities
d. All of the above
19. A constraint in an LP model becomes redundant because
a. Two iso-profit line may be parallel to each other
b. The solution is unbounded
c. This constraint is not satisfied by the solution values
d. None of the above
20. The solution space (region) of an LP problem is unbounded due to
a. An incorrect formulation of the LP model
b. Objective function is unbounded
c. Neither a nor b
d. Both a & b
21. Model which refers possibility for management to conduct sensitivity analysis can be
categorized under
a. investment planning models
b. financial planning models
c. cost planning models
d. revenues forecast models
22. Amount of money by which total revenues exceed breakeven revenues is classified as
a. margin of safety b.margin of profit
c. margin of loss d.margin of income
23. If budgeted revenue is \$20000 and breakeven revenue is \$15000, then margin of
safety will be
a. \$35,000 b. \$13,000 c. \$5,000 d. \$10,000
24. The amount by which an objective function coefficient can change before a different
set of values for the decision variables becomes optimal is the
a. Optimal solution. b. dual solution. c. range of optimality. d. range of
feasibility
25. If we wish to increase a constraint RHS value beyond the allowable increase value
shown in the Sensitivity Report, this means
a. the problem needs to be solved again to get a new Sensitivity Report
b. the shadow price in the report is still valid
c. such a change should never be made
d. there will no longer be a feasible solution for the problem.
26. If the objective function coefficient of a variable changes within its allowable range
a. the current variable values remain the same, but the objective value changes.
b. the current variable values and the objective value remain the same.
c. the current variable values and the objective value change.
d. No change
27. Unbounded solution in LPP is
a. Where the objective function is increased indefinitely
b. Which maximizes the objective function
c. Where the objective function is increased or decreased indefinitely
d. Where the objective function is increased indefinitely
28. In graphical solution the redundant constraint is
a. Which forms the boundary of feasible solution
b. Which do not optimizes the objective function
c. Which does not form the boundary of feasible solution
d. Which optimizes the objective function.
29. Decision variables
a. Tell how much or how many of something to produce, invest, purchase, hire, e
tc.
b. Represent the values of the constraints.
c. Measure the objective function.
d. must exist for each constraint
30. The region on the graph sheet which satisfies the constraints and non negativity
restrictions is called the ________ space.
a. Solution b. Interval c. Concave d. Convex
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
c d a A d a c a c c a d b a a

16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
d a c D c b a c c b a c c a a
UNIT II
1. The purpose of the transportation approach for locational analysis is to minimize
a. Total costs
b. Total shipping costs
c. Total variable costs
d. Total fixed costs
2. When the number of shipments in a feasible solution is less than the number of rows
plus the number of columns minus one
a. the solution is optimal
b. there is degeneracy, and an artificial allocation must be created
c. dummy source must be created
d. a dummy destination must be created
3. In case of an unbalanced problem, shipping cost coefficients of ______ are assigned
to each created dummy factory or warehouse very high positive costs
a. very high negative costs
b. very high positive costs
c. 10
d. zero
4. The transportation method assumes that
a. there is only one optimal solution for each problem.
b. the number of occupied squares in any solution must be equal to the number of
rows in the table plus the number of columns in the table plus 1.
c. the number of dummy sources equals the number of dummy destinations.
d. there are no economies of scale if large quantities are shipped from one source
to one destination.
5. The purpose of a dummy source or dummy destination in a transportation problem is
to
a. make certain that the total cost does not exceed some specified figure.
b. obtain a balance between total supply and total demand.
c. provide a means of representing a dummy problem.
d. prevent the solution from becoming degenerate.
6. When there is no column and no row without assignment in such case, the current
assignment is…………………
a. Optimal
b. Maximum
c. Minimum
d. Zero
7. Number of basic allocation in any row or column in Assignment Problem can be
a. Exactly one
b. at least one
c. at most one
d. Exactly two
8. An assignment problem is considered as a particular case of a Transportation problem
because
a. the number of rows equals columns
b. all xij= 0
c. all rim conditions are 1
d. all of above
9. The Hungarian method for solving an assignment problem can also be used to solve
a. a transportation problem
b. both a and b
c. a traveling salesman problem
d. only b
10. While solving an assignment problem, an activity is assigned to a resource through a
square with zero opportunity cost because the objective is to_________.
a. minimize total cost of assignment
b. reduce the cost of assignment to zero
c. reduce the cost of that particular assignment to zero
d. reduce total cost of assignment
11. The variable in dual problem which can assume the negative values, positive values or
zero values is classified as
a. unrestricted constant
b. restricted constant
c. restricted variable
d. unrestricted variable
12. In primal-dual solutions, the dual problem solution can be obtained by solving other
problems classified as
a. unrestricted problem
b. original problem
c. double problem
d. restricted problem
13. Two linear programs (P1) and (P2) are given with the same set of variables and the
same set of constraints except that (P1) has all variables non-negative and (P2) has all
variables free. The dual of (P2) is unbounded. Then, which of the following are
possible?
a. The dual of (P1) is infeasible.
b. The dual of (P1) is unbounded or the dual of (P1) has a feasible solution
c. The dual of (P1) has no feasible solution.
d. The dual of (P1) has no optimal solution.
14. For any primal problem and its dual______________.
a. optimal value of objective function is same
b. primal will have an optimal solution if and only if dual does too
c. both primal and dual cannot be infeasible
d. dual will have an optimal solution if and only if primal does too
15. If primal linear programming problem has a finite solution, then dual linear
programming problem should have____________.
a. finite solution
b. infinite solution
c. bounded solution
d. alternative solution
16. If the given Linear Programming Problem is in its standard form then primal-dual pair
is ____________.
a. Symmetric
b. Unsymmetric
c. slack ******
d. square
17. If the primal has an unbound objective function value then the other problem has
___________ .
a. solution
b. basic solution
c. feasible solution
d. no feasible solution
18. Using ________method, we can never have an unbounded solution
a. Simplex Method
b. Dual Simplex Method
c. Big-M Method
d. Search Approach Method
19. Variable in dual problem which can assume negative values, positive values or zero
values is classified as
a. unrestricted constant
b. restricted constant
c. restricted variable
d. unrestricted variable
20. The dual simplex starts with a
a. Feasible but super optimal solutions
b. Feasible but sub optimal
c. Infeasible but super optimal solutions
d. Infeasible but sub optimal
21. The number of basic techniques involved in post optimality analysis is
a. One b. Two c. Three d. four
22. Post optimality test is impartment to
a. Determine the best trade off
b. Demonstrate validity of final model
c. Find errors and weakness in models
d. All of the above
a. The work of an additional unit
b. Value of decision variables
c. Utilization of resources
d. Available resources
24. The calculation of opportunity cost in the MODI method is analogous to a
a. cj – zj value for non-basic variable columns in the simplex method.
b. Value of a variable in b-column of the simplex method.
c. Variable in xb-column.
d. All of the above.
25. In the linear programming formulation of the shortest route problem, there is one
constraint for each node indicating
a. capacity on each path
b. whatever comes into a node must also go out
c. capacity on each arc
d. a maximum capacity on a path
26. The linear programming model for a transportation problem has constraints for supply
at each ______ and _______ at each destination.
a. destination / source
b. source / destination
c. demand / source
d. source / demand
27. An assignment problem is a special form of transportation problem where all supply
and demand values equal
a. 0
b. 1
c. 2
d. 3
28. The shipping company manager wants to determine the best routes for the trucks to
take to reach their destinations. The problem can be solved using the
a. shortest route solution technique
b. minimum spanning tree solution method
c. maximal flow solution method
d. minimal flow solution method
29. The objective of the maximal flow solution approach is to _________ the total
amount of flow from an origin to a destination
a. minimize
b. maximize
c. discriminate
d. Divide
30. The assignment model is a special case of the ________ model.
a. maximum-flow
b. transportation
c. shortest-route
d. none of the above

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
b b d D b a a d c a d b b b a

16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
b d b D c d d a a d b b a a b
UNIT III
1. Which of the following is not a requirement for a goal programming problem?
a. prioritization of goals
b. a single objective function
c. linear constraints
d. linear objective function
2. If we wish to develop a stock portfolio where in we maximize return and minimize
risk, we would have to use
a. Pure integer programming
b. Goal programming
c. Zero – one integer programming
d. Mixed – integer programming
3. Dynamic programming is a mathematical technique dealing with the optimization of
_______ stage decision process.
a. multi
b. single
c. both A and B
d. none of them
4. Let (IP) be an integer program (in maximization form) and (LP) be its linear
programming relaxation. Suppose (LP) has an integral solution. Then which of the
following are always true?
a. The optimal solution value of (LP) is strictly higher than the optimal solution
value of (IP).
b. The optimal solution value of (LP) is not equal to the optimal solution value
of (IP).
c. The optimal solution value of dual of (LP) is equal to the optimal solution
value of (IP).
d. The dual of (LP) may be unbounded.
5. A relaxation of an integer program (in maximization form) must satisfy which of the
following requirements.
a. It must have the same objective function as the integer program.
b. It’s feasible region must include the feasible region of the integer program.
c. For every point in the feasible region of the integer program, the objective
function of the relaxed problem must have higher value than the objective
function of the integer program.
d. The optimal solution of the relaxed problem must coincide with the optimal
solution of the integer program.
6. When using branch and bound method in integer programming maximization
problem, the stopping rule for branching is to continue until
a. The objective function is zero
b. The new upper bound exceeds the lower bound
c. The new upper bound is less than the lower bound or no further branching is
possible
d. The lower bound reaches zero
7. Potential problems with cutting plane method include
a. It may never converge to a solution
b. It can be used only for problems with two dimensions
c. It may take a great deal of computer time to find a solution
d. It does not produce a good integer solution until the final solution is reached
8. The first step in a branch and bound approach to solving integer programming
problem is to
a. Graph the problem
b. Change the objective function coefficients to whole integer numbers
c. Solve the original problem using LP by allowing continuous non integer
solutions
d. Compare the lower bound to any upper bound of your choice
9. Which of the following is/are property/properties of a dynamic programming
problem?
a. Optimal substructure
b. Overlapping sub problems
c. Greedy approach
d. Both optimal substructure and overlapping sub problems
10. If an optimal solution can be created for a problem by constructing optimal solutions
for its sub problems, the problem possesses ____________ property.
a. Overlapping sub problems
b. Optimal substructure
c. Memoization
d. Greedy
11. If a problem can be broken into sub problems which are reused several times, the
problem possesses ____________ property.
a. Overlapping sub problems
b. Optimal substructure
c. Memoization
d. Greedy
12. If a problem can be solved by combining optimal solutions to non-overlapping
problems, the strategy is called _____________
a. Dynamic programming
b. Greedy
c. Divide and conquer
d. Recursion
13. In dynamic programming, the technique of storing the previously calculated values is
called ___________
a. Saving value property
b. Storing value property
c. Memorization
d. Mapping
14. When a top-down approach of dynamic programming is applied to a problem, it
usually _____________
a. Decreases both, the time complexity and the space complexity
b. Decreases the time complexity and increases the space complexity
c. Increases the time complexity and decreases the space complexity
d. Increases both, the time complexity and the space complexity
15. When a top-down approach of dynamic programming is applied to a problem, it
usually _____________
a. Decreases both, the time complexity and the space complexity
b. Decreases the time complexity and increases the space complexity
c. Increases the time complexity and decreases the space complexity
d. Increases both, the time complexity and the space complexity
16. Which of the following problems is NOT solved using dynamic programming?
a. 0/1 knapsack problem
b. Matrix chain multiplication problem
c. Edit distance problem
d. Fractional knapsack problem
17. Which of the following problems should be solved using dynamic programming?
a. Merge sort
b. Binary search
c. Longest common subsequence
d. Quick sort
18. In a dynamic programming problem the output to stage n problem becomes the input
to
a. Stage n-1
b. Stage n it self
c. Stage n-1
d. Stage b+a
19. The relationship stages of a dynamic programming problem is called a
a. State
b. Random variable
c. Node
d. transformation
20. Dynamic programming problem divides problem into a number of
a. Conflicting objective functions
b. Decision stages
c. Unrelated constraints
d. Policies
21. Solving an integer programming problem by rounding off answers obtained by
solving it as a linear programming problem(using simplex), we find that
a. the values of decision variables obtained by rounding off are always very close
to the optimal values
b. the value of the objective function for a maximization problem will likely be
less than that for the simplex solution
c. the value of the objective function for a minimization problem will likely be
less than that for the simplex solution
d. all constraints are satisfied exactly
22. In cutting plane algorithm , each cut which is made involves the introduction of
a. An ‘=’ constraint
b. An artificial variable
c. A ‘≤’ constraint
d. A ‘≥’ constraint
23. Which of the following effects does the addition of a Gomory have? (i) adding a new
variable to the tableau; (ii) elimination of non-integer solutions from the feasibility
region; (iii) making the previous optimal solution infeasible by eliminating that part of
the feasible region which contained that solution
a. (i) only
b. (i) and (ii)
c. (i) and (iii)
d. All the above
24. For a typical integer programming problem, the number of feasible solutions
________________________ as the number of variables in the problem increases.
a. Increases linearly
b. Increases exponentially
c. Decreases exponentially
d. Decreases linearly
25. Branching in the branch and bound method refers to:

b. removing a constraint
c. either adding or removing a constraint
d. removing a constraint and extending the feasible set.
26. For a pure 0-1 integer programming problem with 3 variables, the maximum number
of potential solutions is
a. 9
b. 27
c. 16
d. 8
27. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions
a. Dynamic programming
b. Backtracking
c. Branch and bound
d. Greedy method
28. When dynamic programming is applied to a problem, it takes far _________ time as
compared to other methods that don’t take advantage of overlapping sub problems.
a. More
b. Less
c. Same
d. Neither lass nor more
29. Problem A is a two variable linear programming problem with a maximization
objective function. Problem B is a two variable pure integer programming problem
obtained from Problem A by requiring the variables to be integers and leaving other
things unchanged. If Problem A has an optimal solution, then Problem B must have an
optimal solution.
a. True
b. False
30. A feasible solution to a two variable pure integer programming problem can always
be found by first solving the corresponding linear programming problem
a. True
b. False

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
B b a C b c a c d b a c c c c

16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
D c A D b b c b B d a a b b b
UNIT IV
1. optimization problems with equality constraints:
a. The number of constraints equals the number of choice variables.
b. The number of constraints must exceed the number of choice variables.
c. The number of constraints may exceed the number of choice variables.
d. The number of constraints must be smaller than the number of choice
variables.
2. In optimization problems with inequality constraints:
a. the number of constraints equals the number of choice variables.
b. the number of constraints may equal the number of choice variables.
c. the number of constraints must exceed the number of choice variables.
d. the number of constraints must be smaller than the number of choice variables.
3. In optimization problems with inequality constraints, a sufficient set of conditions for
the existence of a maximum is:
a. f(.) convex and g(.) convex.
b. f(.) convex and g(.) concave.
c. f(.) concave and g(.) convex.
d. f(.) concave and g(.) concave.
4. In optimization problems with inequality constraints, a sufficient set of conditions for
a local maximum to be a global maximum is
a. f(.) convex and g(.) convex.
b. f(.) convex and g(.) concave.
c. f(.) concave and g(.) convex.
d. f(.) concave and g(.) concave
5. In optimization problems with inequality constraints, the value of the Lagrange
function, in an optimum:
a. equals the value of the objective function.
b. may be smaller than the value of the objective function.
c. is always smaller than the value of the objective function. d may be greater
than the value of the objective function.
d. is always greater than the value of the objective function.
6. In optimization problems with inequality constraints, the Kuhn-Tucker conditions are:
a. sufficient conditions for (x0, ..., xN ) to solve the optimization problem.
b. necessary conditions for(x0, ..., xN ) to solve the optimization problem.
c. sufficient but not necessary conditions for (x0, ..., xN ) to solve the optimization
problem.
d. neither sufficient nor necessary conditions for (x 0, ..., xN ) to solve the
optimization problem.
7. Consider the Hessian, H, of f(x1, x2). If f(x1, x2) is concave, then the eigen values of H
are as follows:
a. e1 ≥ e2 ≥ 0.
b. e1 ≤ 0, e2 ≤ 0.
c. e1 ≥ 0, e2 ≤ 0.
d. e1 ≤ 0, e2 ≥ 0.
8. Consider u(x, y) = x + a ln(y), with a, x, y > 0. Calculate the Hessian of u(x, y).
Calculate the eigenvalues of the Hessian. Then:
a. e1 = 0 e2 = 0
b. e1 < 0 e2 > 0
c. e1 < 0 e2 = 0
d. e1 > 0 e2 < 0
9. If f(x) is strictly concave, the Kuhn Tucker conditions are sufficient for
a. Absolute minimum b. Absolute maximum
c. Local maximum d. Local minimum
10. In the Kuhn Tucker conditions if the problem is one of maximum, and the constraints
are of type gi < 0 then λj have to be
a. Zero b) non negative c) Non positive d) unrestricted in sign
11. S1: In an NLPP the concept of partial derivative is used to optimize the multivariable
function.
S2: The general NLPP with inequality constraints are usually solved using Kuhn
Tucker conditions
a. S1:True, S2: False b. S1:False, S2: True
c. S1:True, S2: True d. S1:False, S2: False
12. A Hessian matrix H(x) is positive definite if
a. Some of the eigen values are negative and zero
b. All eigen values are negative
c. Some of the eigen values are positive and zero
d. All eigen value are positive
13. When the function f consists of more than one variable, we form a Hessian matrix

 f 2 
defined by H(x0) =  x x 
 i j  xx
0

## a. f(x) is relative minimum at x = x0, if H(x0) is negative definite

b. f(x) is relative maximum at x = x0, if H(x0) is negative definite
c. There exists a point of inflection at x = x0, if H(x0) is indefinite
d. There exists a saddle point, if H(x0) is indefinite
14. Hessian matrix H(x) is positive definite if all its leading principal minors of order
a. 1×1 are positive b) 1×1 are scalars
c) 2×2 are positive d)2×2 are Scalars
15. Kuhn Tucker necessary conditions for maximizing becomes sufficient conditions if
a) f(x) is concave and gi(x) is convex
b) f(x) is convex and gi(x) is concave
c) f(x) is concave and gi(x) is concave
d) f(x) is convex and gi(x) is convex
16. The Newton-Raphson method of finding roots of nonlinear equations falls under the
category of _____________ methods.
a) Bracketing b) open c) random d) graphical
17. The root of the equation f (x) = 0 is found by using the Newton-Raphson method. The
initial estimate of the root is x0 = 3 , f (3) = 5 . The angle the line tangent to the
function f (x) makes at x = 3 is 57° with respect to the x-axis. The next estimate of the
root, 1 x most nearly is
a) –3.2470 b) −0.24704 c) 3.2470 d) 6.2470
18.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
d D C C A a a b b b a c c A a
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
b b
UNIT V
1. A major limitation of Gantt charts in project management is that they do not
a. indicate the major activities involved
b. show activity times
c. show the timing of activities.
d. show precedence relationships.
e. give a visual portrayal.
2. Which is not a feature of PERT/CPM?
a. An estimate of how long a project will take.
b. A graphical display of project activities
c. An indication of critical activities
d. All of the above
3. Which of these may require the use of a dummy activity?
a. Gantt chart.
b. Activity-on-arrow network.
c. Activity-on-node network.
d. Both b and c
4. The distribution that is used to represent path times is the
a. Bivariate
b. Beta
c. Normal
d. Poisson
5. The standard deviation of a path is computed as:
a. the sum of the standard deviations of all activities on the path.
b. the square root of the sum of the standard deviations of all activities on the
path.
c. the sum of the variances of all activities on the path.
d. the square root of the sum of the variances of all activities on the path.
6. An important assumption in PERT calculations is:
a. activity times are normally distributed.
b. activity times are independent.
c. a computer will be available to do the calculations.
d. Both a and b
7. The latest finish time for an activity
a. equals the min. of LFT − t for all immediate successors
b. equals the max. of LFT − t for all immediate predecessors
c. equals the min. of EST + t for all immediate successors
d. equals the max. of EST + t for all immediate predecessors
8. Which of the following statements is true?
a. The variance of the time taken to complete an activity is equal to (b − a)/6
b. The critical path is the path with the largest probability of being completed on
time
c. The standard deviation of a project completion time is the sum of the standard
deviations for the critical path activities
d. Three time estimates are necessary so that we can estimate the parameters of
the Beta distribution
9. An expected project completion time follows a normal distribution with a mean of 21
days and a standard deviation of 4 days. What is the probability that the project will
be completed in a time between 22 to 25 days inclusive?
a. 0.0819
b. 0.8413
c. 0.2426
d. 0.7734
10. Which of the following statements is true?
a. When considering the possible crashing of a project, the normal time equals
the length of the shortest path prior to any crashes.
b. The EFT for an activity is equal to the EST minus the slack for that activity.
c. Dummy activities do not require any resources.
d. For the beta distribution, m will always be exactly in the middle of a and b.
11. Activity A B C D
IP - - A,B A,C
Based on the list of activities above which of the following can be said?
a. Activity D can begin as soon as both activities A and C are complete.
b. Activity D can begin as soon as both activities A and B are complete.
c. Activity C can begin as soon as activity B is complete.
d. Activity C can begin as soon as activity A is complete.
12. Which of the following can shorten the duration of an activity or project?
a. Subcontracting
b. Overtime
c. Hiring extra labour
13. The critical path in a network of activities
a. will be the path with the most number of activities.
b. cannot be delayed or else the entire project will be delayed
c. will always have all activities with positive slack
d. must have at least three activities
14. The Gantt Chart is used to
a. track the cost of the activities
b. provide a schedule and track costs of activities
c. control cost of all the activities
d. provide a schedule of the activities
15. Which of the following statements is true?
a. PERT and CPM are both probabilistic techniques.
b. PERT and CPM are both considered as deterministic approaches
c. PERT is considered as a probabilistic techniques and CPM is considered as a
deterministic approach
d. PERT is considered as a deterministic approach and CPM is a probabilistic
techniques.
16. The immediate predecessors of any node in a project network drawn as a AON
diagram :
a. may be no nodes to many nodes
b. may be one or more node(s).
c. may be two or more nodes.
d. is always only one node.
17. Which is not a significant challenge of project scheduling?
b. activities are independent.
c. many employees could be required.
d. delays are costly.
18. PERT and CPM
a. are most valuable when a small number of activities must be scheduled.
b. have different features and are not applied to the same situation.
c. do not require a chronological relationship among activities.
d. have been combined to develop a procedure that uses the best of each
19. Activities G, P, and R are the immediate predecessors for activity W. If the
earliest finish times for the three are 12, 15, and 10, then the earliest start time for
W
a. is 10.
b. is 12.
c. is 15.
d. cannot be determined
20. When activity times are uncertain
a. Assume they are normally distributed
b. Calculate expected time using (a+4m+b)/6
c. Use most likely time
d. Calculate expected time using (a+m+b)/6
21. The critical path
a. is any path that goes from the starting node to the completion node
b. is a combination of all paths.
c. is the shortest path.
d. is the longest path
22. The three phases involved in the management of large projects are
a. scheduling, operating, evaluating
b. scheduling, designing, operating
c. planning, scheduling, controlling
d. planning, scheduling, evaluating
23. A dummy activity is required when
a. the network contains two or more activities that have identical starting and
ending events.
b. two or more activities have the same ending events
c. two or more activities have the same starting events
d. two or more activities have different ending events
24. Which of the following is a direct responsibility of the project manager?
a. Calculating completion probabilities for all tasks in the project
b. Drawing the network diagram
c. Making sure that the people assigned to the project receive the motivation,
direction, and information needed to do their jobs.
d. Performing all of the activities in the project.
25. The EF of an activity is the
a. LF-Activity time
b. Max{EF of all immediate predecessors}
c. ES + Activity time.
d. Min{LS of all immediate following activities}
26. What is the probability that a project with a mean completion time of 23.9 days
and a variance of 6 days will be finished in 26 days?
a. 0.63
b. 0.80
c. 0.37
d. 0.20
27. Activities A and B are both 6 days long and the only immediate predecessors to
activity C. Activity A has ES=8 and LS=8 and activity B has ES=7 and LS=10.
What is the ES of activity C?
a. 14
b. 15
c. 13
d. 16
28. A project's critical path is composed of activities A, B, and C. Activity A has a
standard deviation of 2, activity B has a standard deviation of 1, and activity C
has a standard deviation of 2. What is the standard deviation of the critical path?
a. 9
b. 25
c. 5
d. 3
29. In project time management, crashing means:
a. Reducing project duration by redefining logical relationships.
b. Reducing computer network downtime for schedule risk modeling.
c. Applying additional resources to all project activities.
d. Randomly applying resources to critical path activities.
30. The time by which activity completion time can be delayed without affecting the start
of succeeding activities, is known as
a. Total float
b. Duration
c. Free float
d. Interfering float

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
d d C c d b a d c c a d b d c

16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
a b d c b d c a c c b a d d a

## Нижнее меню

### Получите наши бесплатные приложения

Авторское право © 2021 Scribd Inc.