:: Share Your Experience And Make People Share Like You ::

Sunday 20 September 2015

TCS Service Interview Experience 2015

Pattern:
Three rounds 1. written  2. technical 3. HR

written exam will be of 80 min - 30 questions of quantitative aptitude

Technical Round: 
  1. Gave three logical questions(numerical puzzles)
  2. About project
  3. As I mentioned java in my resume they started asking java like OOPS concepts, collections, generics
  4. Extends vs implements
  5. Sample socket programming code
  6. Database connectivity code
  7. Prepared statements and stored procedures
  8. Object serialization
  9. What do threads shares? how many diff ways that you can write a thread code
  10. Few questions on multi threading.
  11. Abstract vs interface
  12. Binary search tree algorithm
  13. Asked me to write a program to implement two threads accessing count variable
  14. Wait() vs join() vs notify()
  15. Gave a question and asked to implement the same in SQL, relational algebra and relational calculus.
  16. Jvm architecture
  17. Exception handling in java
  18. Finally vs catch with a code 
  19. Life cycle of a thread
 For me its 45-50 mins of technical interview. 

HR Round:
  1. Tell me about your family.
  2. Recent movie and narrate the story of it.
  3. About hobbies
  4. Are you willing to relocate
  5. Bond and package

Note: keep a smile on your face throughout and what ever they ask just answer confidently. They just want to check your communication skills and confidence.

Source: Yeswanth (M.Tech IT 2014-16)

TeraData Interview Experience 2015

Technical Round 1:

  1. Write a code to determine the length of a string with and without using Recursion?
  2.  Write a code for binary search tree tand how will you determine the height of that tree?
  3.  What is segmentation fault? Write a program to generate segmentation fault?
  4.  Write a program to check whether two strings are anagrams or not? He asked me to write the code in an optimized way.
    Anagrams: Two words are said to be anagrams of each other if the letters from one word can be rearranged to form the other word.
  5. What does the below function will do?  
    func ( char *str1, char *str2) {
    while( *str1++ = *str2++);
    }
  6. Create mirror image of binary search tree. 
    Refer the following link: http://www.geeksforgeeks.org/write­an­efficient­c­function­to­convert­a­tree­into­its­mirror­tree/
  7. I am having 5 million files. How will you find out the lager file(in terms of size) among all the files?How will you solve this problem using MapReduce approach?
In the first round, he asked more about strings and pointers.

Technical Round 2:

  1. Write a code to determine the duplicate elements in the given array and he asked me to optimize the code in terms of time complexity?
  2. Given an array of elements, how will you find out the mean,median and mode?Which is the best data structure to solve this problem?
  3. How will you implement the heap data structure and why we need heeps?
  4. How will you balance the tree? Some questions on AVL tress?
  5.  Asked my B.Tech project in detail and implementation details?
  6. How will you find out the kth smallest element in the given array? He asked me about optimizations? Solutions: 1. Navie approach  2. Heap datastructure  3. Using partitioning approach(Quick Sort idea)
Third approach is the best solution.
http://www.geeksforgeeks.org/kth­smallestlargest­element­unsorted­array/

Technical Round 3 & HR:

  1. Why quick sort is best sorting algorithm compared to other sorting algorithms. Give your observations?
  2. He given some C puzzles and asked me the output?(Basic C concepts:storage classes and memory management)?
  3. Why TeraData?
  4. Asked project details
  5. What are your future goals?
  6. Asked background, and my personal details
Source: K Chaitanya Priyadarsini (M.Tech IT 2014-16)

One Convergence Interview Experience 2015

Written Test:
I  had 5 sections (1.CN 2.C 3.OS 4.Java 5.Algo and DBMS), each section had 15 questions and duration was 75 min. There was sectional cutoff and negative marking as well. These were GATE level questions.

Interview was on a later date and had elimination rounds.

Round 1:
  1. A new protocol is defined with following header fields : 2 bytes for holding the size of the payload, 2 bits to set the fields, 1 byte to hold the description of the protocol. Create a packet with header and payload and how you would set the flags. Based on the above question explain structure padding and why is it needed.
  2.  Given two strings, treat them as parent string and a child string. Check whether the child string is present in the parent string or not. If child string is present in the parent string, then reverse the child string part of the parent string and print the parent string.
  3. You do "ping www.google.com" , explain the step-by-step process of how this is implemented in linux and in OSI.
  4. For the above question, he asked how would it happen if there were VLAN's.
  5. What is NAT, why you need it and what is static NAT and dynamic NAT.

Round 2:
  1. Tell me about yourself.
  2. What is the difference between mutex and semaphore.
  3. When you use mutex and when you use semaphore.
  4. Write a program using mutex and semaphores
  5. How you achieve synchronization in DB.
  6. Where do you use trees in real world?
  7. Tell me different stages of compilation and give an example of what happens at each stage.
  8. Program to reverse linked list.

Round 3:
  1. There was a program written on board with all the storage classes in it and asked me to explain each statement in it with respect to C program memory layout.
  2. What happens when i call a recursive function indefinitely
  3. Why does stack overflow happen.
  4. What data structure will you use to implement a routing table and why did i choose it. 
  5. What is the time complexity of all quicksort. Is there any sorting technique with a better, worst case time complexity. Which would you prefer quick sort or mergesort and why did i prefer it.
  6. What is IPC. What would you use to make it happen.
  7. How will you create a child process and a thread.Where are threads created and where are child created. How are they different from one another.
  8. What is segmentation fault and how does it occur.
  9. When you initialize a variable and later access it, will there be any context switching from user mode to kernel mode. If segmentation fault occurs at this point of time, what part of the kernel detects it.
  10. What would you do to reduce the context switching from user to kernel modes.
Note:
      In my resume i mentioned CN, DS and OS as my areas of interest. So all the questions were based on them. In all, i was interviewed for 3 hrs. After every round HR will take you to next panel and during this time he will make small talk, i believe that was the HR round. Also they might ask questions from your written test, though they dint ask me any.


Source: Srikanth K(M.Tech(2014-16))