USN 1 D A 1 MEE01

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY, BANGALORE – 560056

(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
Eighth Semester B.E. Degree (Autonomous) Continuous Internal Evaluation (CIE) – 1I
Even semester 2020-2021
Date: 23/06/2021 Sub Title: OPERATIONS RESEARCH Timing: 09:30 AM to 10:30 AM
Day: Wednesday Sub code: MEE01 Time duration: 60mins
Branch: All IDE Max marks : 25
Semester/Sec: 8th Semester Staff in-charge: Shashikantha N
Note: Answer ALL questions

Question Description Marks Course BTL

Number outcome
1. a) List the difference between Assignment problems and Transportation [05 CO - 3 L1
problems Marks]
b) Find the optimal assignment to the problem? [05 CO – 3 L3
20 17 22 16 Marks]
32 29 33 26
26 27 29 28
40 30 35 37
2. a) Define the following terms: [05 CO – 4 L1
i) Event, ii) Activity, iii) Critical path, iv) Total Float, v) Free Float. Marks]
b) A building project consists of 9 activities. Their estimated duration is [05 CO – 4 L2
given in the table. Marks]
Draw the network and determine critical path and project completion
time.
Activity A B C D E F G H I
Preceding - - - A A B,E C D,F G
Activity
Normal 10 15 20 8 12 16 20 7 8
Duration
(in days)
OR
c) For the above problem 2 (b) [05 CO - 4 L3
Find earliest and latest event times and EST, EFT, LST and LFT of all Marks]
activities.

Prepared By Approved By HOD

Name & Signature with date

N. Shashikanth

P.T.O
USN 1 D A 1 Sub Code MEE01

Note : Answer ALL the questions

1. How many feasible solutions does a 5 x 5 assignment problem have
a 120 b 125 c 100 d 10
2. How many variables does the formulation of 5 x 5 assignment problem have?
a 10 b 25 c 50 d 100
3. How many constraints does a 5 x 5 assignment problem have?

a 5 b 25 c 50 d 10
4. In a 4 x 4 assignment problem where 4 jobs are assigned to 4 machines, job 1 is assigned to M2,

job 2 to M4, Job 3 to M3. What is the fourth assignment?

a Job 4 to M4 b Job 4 to M3 c Job 4 to M2 d Job 4 to M1
5. Activity in a network diagram is represented by?

a Rectangles b Arrows c Squares d Circles

6.
What is PERT analysis based on?
a Optimistic time b Pessimistic time c Most likely time d All of the above
7. Which of the following is not a step in Hungarian algorithm?
Draw lines Tick unassigned
Subtract row Subtract column
through ticked rows
a minimum from b minimum from c d
rows and unticked
every row every column
columns
8. Which of the following statements is not TRUE about the Assignment problem:
The LP LP can give non
When solving, the
It is a transportation formulation will integer solution
a b c cost matrix is d
problem give binary sometimes
square
solutions
9. Which method usually gives a very good solution to the assignment problem?
Hungarian
a VAM b NWC c LCM d
algorithm
10. The particular task performance in CPM is known
a Dummy b Event c Activity d None of these

**********