Madras Institute of Technology, Chennai

Chennai, Tamil Nadu

What if you can't knock at your Madras Institute of Technology, Chennai seniors' door for advice? Read their placement interview questions and crack your next interview. 🏆

filter iconFilter interviews by

Madras Institute of Technology, Chennai Placement Interview Questions

Updated 3 Jun 2024

1 interview found

user image Sethu Bargavi

posted on 17 Aug 2017

I was interviewed in Aug 2017.

5 Interview Rounds

Interview Questions

  • Q1. Input a file. Select first 3 lines of the file. Select the longest line and count the number of words in that line. It was easy. I used Java methods to solve th...read more
  • Q2. Given an array of strings, find the shortest length palindrome. I solved it in O(n2)
  • Q3. There exists a 3x3 matrix, start from the first element reach the last element of the matrix, between each edges there exists a weight. Reach the destination su...read more
  • Q4. Application of Fibonacci series in day-to-day life.
  • Q5. Balancing parantheses – I defined my own algorithm. He tested it for all test cases. He told me some modifications and I rectified my algorithm.
  • Q6. There was a discussion about my projects and he was quite satisfied with it.
  • Q7. He asked me what happens when I type www.google.com in the web browser. -----/
  • Q8. He asked me how I will check whether I have internet connection in my system? ping www.google.com will respond.
  • Q9. Find the kth largest element in an array. I used MaxHeap concept but he asked me to define it using MinHeap. I modified the code and he accepted it.
  • Q10. When you search for a particular product in amazon, it displays some of the search results. But, only few particular products which are available in amazon are ...read more
  • Q11. What data structure do they use? Hash tables.
  • Q12. What will be the key and what will be the values? The product will be the key. The brands will be the values.
  • Q13. Do you know Radix Sort? Where it is used? Radix sort can be applied in amazon.
  • Q14. Running time of Radix sort? O(nk)
  • Q15. But amazon can do the search in O(n). Why it has to go for O(nk)? For data structures like Hash tables and for large data, n will be large. So O(nk) is better t...read more
  • Q16. Tell me about your projects.
  • Q17. If you don’t get selected for PayPal, what will you do?

Interview Preparation Tips

Round: Test
Experience: It was conducted in Hackerrank which consisted of 10 aptitude questions that included C, C++, Java MCQ
share interview