................... is an event oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

................... is an event oriented network diagram.
a. CPM
b. PERT
c. Histogram
d. Ogive
by

1 Answer

Answer :

b. PERT
by

Related questions

......................... is activity oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

Description : ......................... is activity oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

Last Answer : a. CPM

_____________ is an event-oriented approach . A. CPM. B. GERT. C. PERT. D. WASP.

Description : _____________ is an event-oriented approach . A. CPM. B. GERT. C. PERT. D. WASP.

Last Answer : 1

______________ is an activity-oriented approach. A. CPM B. PERT C. GERT D. WASP

Description : ______________ is an activity-oriented approach. A. CPM B. PERT C. GERT D. WASP

Last Answer : A. CPM

PERT emphasises on ........................... a. Activity b. Time c. Cost d. None of these

Description : PERT emphasises on ........................... a. Activity b. Time c. Cost d. None of these

Last Answer : b. Time

PERT stand for: a. Performance Evaluation Review Technique b. Programme Evaluation Review Technique c. Programme Evaluation Research Technique

Description : PERT stand for: a. Performance Evaluation Review Technique b. Programme Evaluation Review Technique c. Programme Evaluation Research Technique

Last Answer : b. Programme Evaluation Review Technique

What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate the interdependencies of all tasks c. They can be used to estimate the expected project completion dates as well as the probability that the project will be completed by a specific date d. All of the above

Description : What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate ... that the project will be completed by a specific date d. All of the above

Last Answer : d. All of the above

Completion of an activity on CPM network diagram, is generally known (A) Event (B) Node (C) Connector (D) All the above

Description : Completion of an activity on CPM network diagram, is generally known (A) Event (B) Node (C) Connector (D) All the above

Last Answer : (D) All the above

In a network diagram, activity is denoted by ............................ a. Node b. Arrow c. Triangle d. None of these

Description : In a network diagram, activity is denoted by ............................ a. Node b. Arrow c. Triangle d. None of these

Last Answer : b. Arrow

In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these

Description : In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these

Last Answer : b. Nodes

PERT is (A) An analytic in concept (B) Limited of event oriented diagrams (C) Used for research and development projects (D) All the above

Description : PERT is (A) An analytic in concept (B) Limited of event oriented diagrams (C) Used for research and development projects (D) All the above

Last Answer : (D) All the above

Why PERT is preferred over CPM for evaluation of project ?

Description : Why PERT is preferred over CPM for evaluation of project ?

Last Answer : PERT is based on the approach of multiple time estimates for each activity.

Which of the following statements is true? A. PERT is considered as a deterministic approach and CPM is a probabilis t ic techniques. B. PERT is considered as a probabilistic techniques and CPM is considered as a deterministic approach. C. PERT and CPM are both probabilistic techniques. D. PERT and CPM are both considered as deterministic approachs

Description : Which of the following statements is true? A. PERT is considered as a deterministic approach and CPM is a probabilis t ic techniques. B. PERT is considered as a probabilistic techniques ... and CPM are both probabilistic techniques. D. PERT and CPM are both considered as deterministic approachs

Last Answer : B. PERT is considered as a probabilistic techniques and CPM is considered as a deterministic approach

The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.

Description : The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.

Last Answer : a. PERT deals with events and CPM with activities

The first method invented for planning projects, was (A) Bar chart method (B) Milestone chart (C) Critical path method (CPM) (D) Programme Evaluation and Review Technique (PERT)

Description : The first method invented for planning projects, was (A) Bar chart method (B) Milestone chart (C) Critical path method (CPM) (D) Programme Evaluation and Review Technique (PERT)

Last Answer : (A) Bar chart method

_________ technique helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation

Description : _________ technique helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation

Last Answer : d. Transportation

An event which represents the beginning of more than one activity is a : a. Merge event b. Net event c. Burst event d. None of these

Description : An event which represents the beginning of more than one activity is a : a. Merge event b. Net event c. Burst event d. None of these

Last Answer : c. Burst event

......................... is a scheme or design of something intended to do. a. Network b. Float c. Project d. Program

Description : ......................... is a scheme or design of something intended to do. a. Network b. Float c. Project d. Program

Last Answer : a. Network

............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these

Description : ............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these

Last Answer : a. Critical path

......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these

Description : ......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these

Last Answer : a. Network

....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Description : ....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Last Answer : d. Network analysis

......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Description : ......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Last Answer : c. Decision theory

In a PERT network, slack time is _____. (a) The end point that represents the completion of a major activity (b) The time or resources required to progress from one event to another (c) The amount of time an individual activity can be delayed without delaying the whole Project (d) The longest or most time-consuming sequence of events and activities

Description : In a PERT network, slack time is _____. (a) The end point that represents the completion of a major activity (b) The time or resources required to progress from one event to another ( ... without delaying the whole Project (d) The longest or most time-consuming sequence of events and activities 

Last Answer : (c) The amount of time an individual activity can be delayed without delaying the whole Project 

CPM is (A) Synthesising in concepts (B) Is built of activities oriented programme (C) Is based on time estimate (D) All the above

Description : CPM is (A) Synthesising in concepts (B) Is built of activities oriented programme (C) Is based on time estimate (D) All the above

Last Answer : (D) All the above

The particular task performance in CPM is known A.Dummy B.Event C.Activity D.Contract.

Description : The particular task performance in CPM is known  A.Dummy  B.Event  C.Activity  D.Contract.

Last Answer : C.Activity

If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Last Answer : c. 0

Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Last Answer : d. Decision variables

The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : b. Uncontrollable variables

The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : a. Controllable variables

The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Last Answer : b. Service facility

.................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Last Answer : a. Hungarian Method

Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Description : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Last Answer : c. D Konig

Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Last Answer : d. All of the above

VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Last Answer : b. Penalty Method

Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Last Answer : d. F L Hitchcock

................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

Description : ................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

Last Answer : c. Both a and b

Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Last Answer : a. Dual price

Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Last Answer : d. All of the above

Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Description : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Last Answer : d. Von-neumann and Morgenstern

Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ

Description : Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ

Last Answer : a. λ/μ

Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Description : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Last Answer : c. Utilisation factor

..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson

Description : ..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson

Last Answer : d. Simeon Dennis Poisson

Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Description : Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Last Answer : a. Idleness of service capacity

............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Last Answer : c. Queue discipline

MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Last Answer : b. u. v. Method

Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these

Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

Last Answer : b. Least Cost Method

In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these

Description : In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these

Last Answer : c. North West Corner Method

Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

In queuing theory, FCFS stand for .............................. a. First Cum First Served b. First Customer Fist Served c. Fast Channel First Served

Description : In queuing theory, FCFS stand for .............................. a. First Cum First Served b. First Customer Fist Served c. Fast Channel First Served

Last Answer : a. First Cum First Served

...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory

Description : ...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory

Last Answer : c. Markov Analysis