Interview Experience 104

#2017

##Engineer

Round: 1

It was a 3 hours coding round and the maximum number of submissions allowed was 10, but we could compile it as much as we want.

Attempt:1 A Doctor travels from a division to other division where divisions are connected like a graph (directed graph) and the edge weights are the probabilities of the doctor going from that division to other connected division but the doctor stays 10 mins at each division. Given a time T, you have to determine the division at which doctor will be found at time T. The doctor moves in the direction of highest probability.

Input is number of test cases followed by number of nodes, edges, time after which we need find the division in which he will be there then the edges starting point, end point, probability.

Note: If he reach a point where there are no further nodes then he leaves the lab after 10 mins and the travelling time is not considered and during that 10 min at 10th min he will be in next division, so be careful

Those who didn't clear the first round in 1st attempt, were allowed for 2nd attempt.

Attempt:2 There is a source (S) and destination (D) and a spacecraft has to go from S to D. There are N number of wormholes in between which has following:

• Each wormhole has an entry and an exit.

• Each wormhole is bi-directional i.e. one can enter and exit from any of the ends.

• The time to cross the wormhole is given and the space craft may or may not use the wormhole to reach D.

• The time taken to travel outside wormhole between two points (x1, y1) and (x2, y2) is given by a formula |x1 - x2| + |y1 - y2| where (x1, y1) and (x2, y2) are the co-ordinates of two points.

The co-ordinates of S and D are given and we have to find the minimum time to reach D from S.

Round:2

• Tell me about yourself
• Discussion about project
• Questions related to OOPS
• inline function
• code to print the mirror of a tree,some questions related to tree
• questions related to OS,DBMS.

Round:3

• Tell me about yourself
• What are your interests
• Why this organization
• And some basic HR questions