........................... is the latest time by which an activity can be finished without delaying the completion of the project. a. LST b. LFT c. EFT d. EST

........................... is the latest time by which an activity can be finished without delaying the completion of the project. a. LST b. LFT c. EFT d. EST
by

1 Answer

Answer :

b. LFT
by

Related questions

..................... is the duration by which an activity can be delayed without delaying the completion of the project. a. Earliest Start Time b. Earliest Finish Time c. Latest Start Time d. Latest Finish Time

Description : ..................... is the duration by which an activity can be delayed without delaying the completion of the project. a. Earliest Start Time b. Earliest Finish Time c. Latest Start Time d. Latest Finish Time

Last Answer : c. Latest Start Time

Independent float is the amount of time by which: A. Start of the activity can be delayed without affecting the EST of subsequent activity B. reduces the float of subsequent activities C. completion of an activity can be delayed beyond EFT without affecting EST D. completion of an activity can be delayed beyond earliest possible finishing time

Description : Independent float is the amount of time by which:  A. Start of the activity can be delayed without affecting the EST of subsequent  activity  B. reduces the float of subsequent ... without affecting EST  D. completion of an activity can be delayed beyond earliest possible finishing time

Last Answer : A. Start of the activity can be delayed without affecting the EST of subsequent  activity

The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Description : The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Last Answer : A. Equals the min. of LFT − t for al immediate successors

.......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Description : .......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Last Answer : b. Total float

The EST + activity duration = .............................. a. Earliest Finish Time b. Latest Start Time c. Latest Finish Time d. None of these

Description : The EST + activity duration = .............................. a. Earliest Finish Time b. Latest Start Time c. Latest Finish Time d. None of these

Last Answer : a. Earliest Finish Time

In a PERT network, the earliest(activity) start time is the a. Earliest time that an activity can be finished without delaying the entire project b. Latest time that an activity can be started without delaying the entire project c. Earliest time that an activity can be started without violation of precedence requirements d. Latest time that an activity can be finished without delaying the entire project

Description : In a PERT network, the earliest(activity) start time is the a. Earliest time that an activity can be finished without delaying the entire project b. Latest time that an activity can ... of precedence requirements d. Latest time that an activity can be finished without delaying the entire project

Last Answer : c. Earliest time that an activity can be started without violation of precedence requirements

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 

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

An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity

Description : An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity

Last Answer : c. Dummy activity

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

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 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

An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these

Description : An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these

Last Answer : b. Predecessor activity

The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Last Answer : d. All the above

At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and latest finish c. Difference between latest start and early finish d. Difference between latest start and latest finish

Description : At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and ... c. Difference between latest start and early finish d. Difference between latest start and latest finish

Last Answer : c. Difference between latest start and early finish

......................... 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

An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important

Description : An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important

Last Answer : c. Critical

In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .............................. a. Infeasible b. Alternative c. Unbounded d. Unique

Description : In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .............................. a. Infeasible b. Alternative c. Unbounded d. Unique

Last Answer : c. Unbounded

.................... defined Operations Research as “the art of winning wars without actually fighting.” a. H M Wagner b. H A Taha c. T L Saaty d. Arthur Clark

Description : .................... defined Operations Research as “the art of winning wars without actually fighting.” a. H M Wagner b. H A Taha c. T L Saaty d. Arthur Clark

Last Answer : d. Arthur Clark

What is a project phase? A. A collection of logically related project activities that culminate in the completion of one or more deliverables (Ans.) B. A singular activity that completes a deliverable C. Consists of work that has very similar parts D. A consistent period of time that is used throughout a project

Description : What is a project phase? A. A collection of logically related project activities that culminate in the completion  of one or more deliverables (Ans.)  B. A singular activity that completes a ... that has very similar parts D. A consistent period of time that is used throughout a project

Last Answer : A. A collection of logically related project activities that culminate in the completion  of one or more deliverables (Ans.)

Project crashing is the method for ------------- A. Shortening the project duration by reducing the time of one or more critical activities B.Adding resources at critical points C.Doing technical analysis of the finished work for review D.Adding duration to each activity

Description : Project crashing is the method for -------------  A. Shortening the project duration by reducing the time of one or more critical  activities  B.Adding resources at critical points  C.Doing technical analysis of the finished work for review  D.Adding duration to each activity

Last Answer : A. Shortening the project duration by reducing the time of one or more critical  activities

a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : d. Balking

Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Description : Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Last Answer : c. Average length of queue

.......................models consider time as one of the important variable. a. Dynamic b. Static c. Botha and b d. None of these

Description : .......................models consider time as one of the important variable. a. Dynamic b. Static c. Botha and b d. None of these

Last Answer : a. Dynamic

........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Description : ........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Last Answer : b. Static

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