SPRING SEMESTER EXAMINATION-2020(online)

2nd Semester M. Tech (CIVIL)

SCHOOL OF CIVIL ENGINEERING
COMPUTATIONAL METHODS
CE6002
Time: 2 Hours Full Marks: 50
(SECTION-A:1 Hour, SECTION-B:1 Hour)

Question paper consists of two sections-A, B.

Section A is compulsory.
Attempt any TWO questions from Sections B.
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words

SECTION-A(Time: 1 Hour )

1. Consider the following network: [12.5]

The distance (in miles) between different stations is shown on

each link. Write down Dijkstra’s algorithm and using it find
the shortest route from station 1 to station 8 and its distance.

KIIT-DU/2020/SOT/Spring End Semester Examination-2020 KIIT-DU/2020/SOT/Spring End Semester Examination-2020

 2. A company has three plants at locations A, B, and C which [12.5] 4. From the following inspection results in September 2019, [12.5]
supply to warehouses located at D, E, F, G, and H. Monthly prepare a p-chart and suggest better control limits.
plant capacities are 800, 500, and 900 units respectively.
Date No. of Date No. of Date No. of
Monthly warehouse requirements are 400, 400, 500, 400, and
defective defective defective
800 units respectively. Unit transportation cost is given below
/100 /100 /100
Warehouses
Plants D E F G H 1 22 11 70 21 66
A 5 8 6 6 3 2 40 12 80 22 50
B 4 7 7 6 5
C 8 4 6 6 4 3 36 13 44 23 46
Determine an optimum distribution for the company to 4 32 14 22 24 32
minimize the total cost of transportation.
5 42 15 32 25 42
SECTION-B(Time:1 Hour )
6 40 16 42 26 46
3. Determine the optimal sequence that minimizes the total time [12.5]
required in performing the following jobs on two machines in 7 30 17 20 26 30
the order AB: 8 44 18 46 28 38
Job 1 2 3 4 5 6
9 42 19 28 29 40
Machine
A 8 3 7 2 5 1 10 38 20 36 30 24
B 3 4 5 2 1 6 The subgroups from which the defectives were taken out were
If those jobs are to be processed through another machine C in of the same size i.e. 1000 items.
the sequence ABC with the processing time as mentioned
below, then determine the optimal sequencing: 5 Use the two-phase method to solve the following LPP: [12.5]
Job 1 2 3 4 5 6 Max
Machine Subject to the constraints:
C 8 7 6 9 10 9
And also find the total idle time for each of these machines. ,
,
,
.
*****

Dr. B. B. Mishra(Mathematics)
Name of the Moderator/Course Coordinator

KIIT-DU/2020/SOT/Spring End Semester Examination-2020 KIIT-DU/2020/SOT/Spring End Semester Examination-2020

KIIT-DU/2020/SOT/Spring End Semester Examination-2020 KIIT-DU/2020/SOT/Spring End Semester Examination-2020