GGK Technologies campus interview experience

Interview experience of GGK Technologies:

Hi, I am M. Kalyan, a final year (ECE) student from VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY, Hyderabad. GGK technologies visited our campus on 3^rd December, 2013. Only CSE/IT/ECE/EEE branches were eligible. Package offered was 3.3 LPA. The recruitment process is as follows:

Written test:

Number of questions: 32

Time: 40 minutes

It was a paper based test. For some questions there were no options, we have to write the numerical in the bracket. Questions were asked on time and speed, time and work, probability, permutations and combinations, problems on ages, percentages and averages, simple and compound interests, profit and loss, blood relations, missing number in a given series of numbers etc. And there were two passages (reasoning puzzles similar to those asked in Bank PO exams). There were 5 questions on each passage and important thing is that the questions related to these passages are not asked at one place sequentially but rather the questions were scattered all over the question paper randomly. My advice is that 1^st solve the passage puzzles and search for all the questions on passages and try to answer them (in the question it is given like “refer passage1”). For each correct answer 1 mark is awarded and for each wrong answer ‘0.5’ mark is deducted (yes, literally half!!). So make sure you solve considerable number of questions. You need to get atleast 18 marks to clear the test. Time management is very important as it is only a 40 min test.

There was no Group Discussion.

Read Written Test Tips

Interview:

After written test, there was only one round of interview and it was more of a logical interview. Around 5-6 logical problems were asked. The puzzles asked were:

1.       Two trains approaching each other at a speed of 20 km/hr and 10 km/hr. If they meet exactly after 1 hr, then what is the distance travelled by both of them together in this 1 hr.

Ans: 30 km(as both travel for 1 hr)

2.       There are two trains approaching each other at a speed of 25 km/hr and 15 km/hr respectively. The trains are at a distance of 200 km. There is a bird sitting in the first train and it is flying (back and forth) between two trains. The bird stops after the trains meet. Speed of the bird is 200 km/hr. What is the distance travelled by the bird?

Ans: 1000 km ( just find the time required by the trains to meet, the bird travels for that period of time)

3.       There is a train approaching a tunnel at a certain velocity. The length of the tunnel is ‘l’. You are in the tunnel at a distance of ‘l/4’ from starting of the tunnel. You have to get out of the tunnel in order to save yourself. You can only run at some constant velocity. You can run towards the train or away from the train, because in both the cases you will just miss the train(you just come out of the tunnel). What is the velocity of train in terms of velocity of yourself?

Ans: velocity of train=2 x (velocity of person in the tunnel)

4.       This is the question that requires presence of mind and common sense. An electrical train is travelling in North direction and then it takes U turn and then it takes this turn, that turn.....etc, now in which direction the smoke is emitted from the train?

Ans: It’s an electrical train, so there will not be any emission of smoke.

5.       There is a goldsmith working at a jewellery shop. The goldsmith takes 1 gm of gold for the work every day. The shop owner has gold biscuits of 7 gm each. He can mark the gold with a scale and cut it to the required weight that he wants. What is the minimum number of cuts required per gold biscuit so that the owner can pay 1 gm of gold daily to blacksmith?. Assume that goldsmith will not use any biscuit to convert it to cash.

Ans: 2 cuts. Logic is something similar to Binary Coded Decimal in Digital electronics. By combining the digits 4,2,1 in various ways(combining linearly or adding) we can create any digit below 7 including 7, similarly by combining digits 8,4,2,1 we can create any digit below 15 and we can combine 16,8,4,2,1 to create any digit below 31 and so on. In the given problem owner makes 2 cuts such that biscuits divided into 4, 2 and 1 gm pieces. First day he will give 1 gm biscuit, second day he will take it back and give 2 gm piece, 3^rd day he will give 1 gm biscuit that he has taken back and 4^th day he will take 3 gm and he will give 4 gm piece, 5^th day he will give 1 gm biscuit that is taken back and so on..

6.       Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person A can cross the bridge in one minute, B in two minutes, C in five minutes, and D in eight minutes. What is the minimum time that they all cross the bridge.

Ans: 17 min( it’s a famous problem, check in Wikipedia)

After that questions were asked on family background, interest in further studies and project. If you can answer the logical questions, then you are almost done.

Read Interview Tips

Coding test:

After interview, there was a coding test. Two programs were given and you need to develop an algorithm or write a C program for each of them, choice is yours. The programs given were:

1.       Print a square using ‘*’(star) symbols. Input is the number of stars per side of the square. For example if I give 4 as input then output should be

****

*    *

*    *

****

As you can see there are 4 stars on each side of the square.

2.       A random array of elements is given. Your program needs to find all the sections(sequences) in the array that are in ascending order, find the sum of those sequences, then find the largest sum and print the largest sum along with the sequence of numbers. For example if the array is like

4, 5, 6, 2, 1, 2, 3, 4, 12, 6, 4, 2, 1, 5, 8, 9

Then ascending sequences in the given array  are

·         4,5,6 with sum 15

·          1,2,3,4,12 with sum 22

·         1,5,8,9 with sum 23

So your program should print the sequence 1 5 8 9 and the sum 23, as it’s the largest sum of ascending sequences.

Visit this link Cracking toughest coding questions in campus interviews

Around 2-3 hrs of time was given to write the code, at each and every stage you can show them your program or algorithm and they will help find out the mistake in the logic by giving some hints, that’s the best part.

Do help out others by sharing your interview experiences here.

You can mail your placement interview experiences or placement papers to us and we will share them here. Mail to

kalyanpavan82@gmail.com

or

jagadeep.surakarp@gmail.com