Skip to content
VUBuddy

MTH601 Midterm Solved Subjective by Hussnain Ali

Operations Research PDF 651 KBUpdated 23 Oct 2026
Midterm past paper MTH601 Midterm Solved Subjective by Hussnain Ali PDF 651 KB
vubuddy.com
Type
Midterm past paper
Course
MTH601 Operations Research
Size
PDF 651 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 651 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 4, 5, 7 of 53. Download the file for all 53 pages.

Practice Questions Lecture#5-6

Q1. Which of the following in the highway system has the same analogy as that of the flow branches and nodes of the network flow diagram.

  1. Roads
  2. Intersection
  3. Vehicles

Q2. Define the following

  1. Dummy activity and its use
  2. Looping error in network
  3. Dangling error in network.

Q3. What is PERT? How it is different from CPM?

Q4. Draw a network diagram for the set of activities below

Activity

A B A C A D B E C F D,E G F

Q5. Define the following terms

  1. Earliest Start Time
  2. Earliest Finish Time
  3. Latest Start Time
  4. Latest Finish Time

Q6. Construct a table for the network diagram which shows the relationship between activities and their predecessors.

Q7. Calculate EST and EFT for each job of the following data.

Activity

P(1-2) Q(1-3) R(2-3) P S(2-4) P T(3-4) R,Q

Q8. If project completion date is 38 days for the following data then find the LST and LFT for the following data.

H

D A C E G

F

B

J I

Q1. Find the critical path and the expected duration of the following project.

Solution

There are 7 possible paths to get from the starting point at node 1 and travel through the network to end at node 8.

Possible Paths

1-2-3-5-7-8=A-C-E-H-K=5+11+7+6+3=32

1-2-3-5-6-8=A-C-E-I-J=5+11+7+5+8=36

1-3-5-7-8=B-E-H-K=7+7+6+3=23

1-3-5-6-8=B-E-I-J=7+7+5+8=27

1-4-5-6-8=D-F-I-J=3+9+5+8=25

1-4-5-7-8=D-F-H-K=3+9+6+3=21

1-4-6-8=D-G-J=3+12+8=23

Hence the critical path is the longest distance with the shortest possible time i.e.

=1-2-3-5-6-8

=A-C-E-I-J

=5+11+7+5+8

=36 I(5) A(5) C(11)

D(3) B(7)

E(7) H(6)

K(3)

G(12) J(8)

All MTH601 files →
MTH601 Operations Research All MTH601 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.