Department : ECE
CGPA : 8.6
The initial round consisted of only one coding question which should be solved in 3 hours. There will be 50 test cases . They will shortlist only if all the test cases are evaluated.
Starting with tell me about yourself question , he asked me few questions on my project. Then he asked me to write full code to perform binary search in a sorted and rotated array.I wwrote
the code in recursive manner. Then he asked me to write the code in iterative manner. After that , he asked questions on complexity of binary search trees. Then he asked me
to write a code for insertion of an element in binary heap. As I am an ECE student , he asked me questions on fourier transform and its applications.
The first question was tell me about yourself. The he asked me few questions on my project. After explaining about my project , he asked me write to write a single mathematical functijon
to implement the logic in my project. I was unable to write that function. Then he asked me to write a code to swap two variables without using the third variable . I told him normal
method . He was expecting the xor approach. Then he asked how to find the intersection point of two linked lists. Then he asked me what was my favourite subject . I told him
communications. He asked me few questions on AM,FM. He asked me questions on sampling and filters. Then he asked me questions on probability. I told him that I am not good at
probability.Then he started asking puzzles.
There is a king who has 31 grams gold bar. On a month of january, a person can visit the king on any date. The king should give as many grams of gold to that person as the value of the date on that day. For example , if a person visits on 23rd , then he will receive 23 grams of gold. Find the minimum number of cuts such that the king can give gold on any date in the month of january.
Answer : 4 cuts which leads to 5 pieces (16 +8+4+2+1)(write 31 in binary format)
There is one 8 kg bar and a physical balance. Find the minimum number of cuts of that bar such that we can measure any weight from 1 to 8 kgs using that physical balance.
Answer: 2 cuts(If you write 8 in binary format you will need 3 cuts , but here the logic is you can place the weight you want to measure and some weight you got after cutting the bar on the same pan like what our local shop keepers do if they don't have proper weights).
There are 8 coins of which 7 are having same weight and one coin is having heavy weight. We have a physical balance. Find the minimum number of weighings needed to identify that heavy coin.
Answer: 2(divide that 8 coins into 3,3 and 2)
The only thing you need to do is clear the first round .My suggestion is don't give up after reading the question . Try to use the given 3 hours of time and solve it.