Sheorey Digital System Limited 2014

1



Date: 4
th
Jun 2014
Time: 11.00 AM



Name: Gunjan Sikheria

Email Address: gsikheria@gmail.com

This test comprises of two sections. We expect that each section should take around Half an
hour; however, you are free to allocate as much time as you need in each section, provided
that the total duration of the test does not exceed One hour.

In taking this test, you are not allowed to use any unfair means (constitute of, but
not limited to, help from other individuals, books, or internet).

















Sheorey Digital System Limited 2014

2


Section -1 (Operations Research)
1. There are four demand points in a fixed region. The problem is related to determine where
to construct factories. The minimum number of factories is to be constructed. At least one
factory should be placed near 20 km of each demand point. The distance in km between
demand points are given in below table. Formulate the problem as a set covering problem.
(10 points)
To


From


1 2 3 4
1 0 15 25 30
2 15 0 35 10
3 25 35 0 20
4 30 10 20 0

Ans: Let the demand point where factory can be constructed X1,X2,X3,X4
Min X1+ X2+X3+X4
X2+X3+X4>=20
X1+X3+X4>=20
X1+X2+X4>=20
X1+X2+X3>=20










Sheorey Digital System Limited 2014

3







2. Consider the undirected network shown in the figure. The graph consists of nodes and
edges, and each edge has an associated certain cost. Determine minimum cost spanning
tree by using Prims or Krushkals algorithm. (5 points)





















Sheorey Digital System Limited 2014

4










3. Which of the following is false about the Dijkstras shortest path problem (2 points)
(a) From a given source to a given destination
(b) From a given source to any destination
(c) From any source to a given destination
(d) From every source to every destination
(e) Doesnt give the shortest path
Ans[d]


4. Consider the problem of solving a linear programming problem with simplex method. Find
which of the following statements is false with respect to the simplex method. (2 points)
(a) The optimality conditions for the maximization and minimization problems are different
in the simplex method
(b) The feasibility conditions for the maximization and minimization problems are different
in the simplex method
(c) In a simplex method, the pivot element cannot be zero or negative
(d) In the simplex method, if the leaving variable does not correspond to the minimum
ratio, at least one variable will definitely become negative in the next iteration.

Ans(c)


5. Consider the following problem: (2 points)
Minimize z= c
T
x subject to, Axb , x0, AR
mxn
, cR
n
and bR
m

If Rank [A,b] Rank [A] which of the following is true
(a) The problem has a unique solution
(b) The problem has no solution
(c) The problem has infinite number of solutions
(d) The problem has unbounded solution
Sheorey Digital System Limited 2014

5



5.Ans[c]




6. The following table for a maximization type LPP is produced after few iterations of simplex
method: (5 points)

C
J
4 10 0 0 0
C
B
X
1
X
2
S
1
S
2
S
3
RHS
4 X
1
1 0 5/8 -1/8 0 15/4
1
0
X
2
0 1 -1/4 1/4 0 5/2
0 S
3
0 0 -1/2 -1/2 1 3
Which of the following statements is correct?
(a) The LP problem has a unique solution
(b) The LP problem has no solution
(c) The LP problem has alternative optimum solutions
(d) The LP problem has unbounded solution
(Give explanation)









Sheorey Digital System Limited 2014

6








7. The best practice in Integer programming deals with integer solution by (1 points)
(a) Rounding of the fractional values to the nearest integer and applying dual simplex
method
(b) Rounding of the fractional values to the nearest integer and simplex method
(c) Introducing Gomorys constraints and applying dual simplex method
(d) Introduction Gomorys constraint and applying simplex method

Ans [a]



8. Write down the Lagrangian function and KKT conditions for the problem: (3 points)
Min f[X] = X
1
2
+ X
2
2
+ X
3
3

Subject to constraints:
-X
1
+ X
2
X
3
-10
X
1
+ X
2
+4X
3
20














Sheorey Digital System Limited 2014

7














9. Assume you are the production manager for a lecture of an online course. For the
production, n tasks have to be executed. A task j requires a working time of p
j
hours to be
completed. You have m employees at your disposal that can each, due to his or her
qualifications, work on a subset of the tasks. Denote by S
i
the set of jobs that employee i can
work on.
As the production manager you want to create a work allocation plan that ensures that all
tasks are completed. However, this allocation should also be fair. Consider the maximum
number of working hours of each employee. You would like to minimize this quantity.
Model this problem as a linear program. (10 points)




















Sheorey Digital System Limited 2014

8














10. Write down the pseudo code for SIMPLEX algorithm. (10 points)

















Sheorey Digital System Limited 2014

9









Section 2 (General Aptitude)
Q 1 (5 Points)
In a certain community there are 1000 married couples. Two thirds of the husbands who are taller than
their wives are also heavier than their wives. Three quarters of the husbands who are heavier than their
wives are also taller than their wives. If there are 120 wives who are taller and heavier than their
husbands, how many husbands are taller and heavier than their wives?


No of husband taller than wife =x
No of husband heavier than wife =y
No of husband taller and heavier =z
2/3*x=z=3/4*y
X=3/2z
Y=4/3z
X+y+z+120=1000
Z=3/8*880=330

















Q 2 (5 points)
Sheorey Digital System Limited 2014

10


There is a 4 inch cube painted on all sides. This is cut down into of 1 inch cubes. What is the number of
cubes which have no painted sides?

Ans: After cutting 4inch cube into 1 inch cube we have total 64 cubes
No of painted cube = 16+16+8+8+4+4= 56
Unpainted cube =64-56 =8


















Q 3 (5 points)
What row of numbers comes next?
1
11
21
1211
111221
312211
13112221

Ans:1113213211
















Sheorey Digital System Limited 2014

11



Q 4 (5 points)
There are five trains A, B, C, D and E that run between the following stations: Bombay and Pune;
Calcutta and Bombay; Pune and Goa; Goa and Bombay; Pune and Calcutta. Trains A & D do not go to
Bombay, B & C do not go to Calcutta and C & D do not touch Goa.
i) Train E goes from . To . And vice versa
A. Pune and Calcutta
B. Bombay and Goa
C. Bombay and Calcutta
D. Goa and Pune
Ans [c]
ii) Which train runs between Calcutta and Pune?
A. A
B. B
C. C
D. D
Ans [d]







Q 5 (5 points)
A car is travelling at a uniform speed. The driver sees a milestone showing a 2-digit number. After travelling for an
hour the driver sees another milestone with the same digit in reverse order. After another hour the driver sees
another milestone containing the same two digits with a zero in between (0). What is the average speed of the
driver?
Ans: Driver first see 16 ten in reverse 61 then after some time it see 106
Therefore 106- 61=45
61-16= 45
Therefore avg speed is 45






Sheorey Digital System Limited 2014

12












Q-6 (5 points)
There are three baskets: the first containing apples, the second containing oranges and the third
containing both apples and oranges. There are stickers outside each basket indicating their contents but
all stickers are wrong. Explain how by just picking out one fruit from one basket (without looking what is
inside the basket), you can correctly label each of the three baskets.