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)

Teradata Interview Experience

Written Test :

• 20 Technical questions (Gate range that covers OS,DS,C,CN)
• Aptitude – 1 hr

Technical Interview(1-3 rounds) :

• How to find the middle element in a linked list
• Reversing a linked list
• Merge sort
• All pairs shortest path program but they did not mentioned name they told procedure and asked to write program
• Explain logic of quick sort
• Write a program to print prime numbers up to 100.after writing program they asked twice to optimize that program.
• What is deadlock and deadlock prevention method.
• In a programs are asking for WRITE permission for a single file then what will happen
• How we implement a graph in program and data structure used for it.explain with example graph
• They asked a logical question  about candles. U have 2 vessels which measures 5 lts and 2ltrs how will u measure 4 ltrs using only these 2 vessels.

Source: Y Varalaxmi(M.Tech(IT))

TeraData Interview questions

1. Write a program for string copy using recursion?
2. Write a program for finding height of a tree?
3. Questions of const pointers and const variables?
4. Write a program for merge sort?
5. There is a n+1 size array and 1 to n numbers are there and one number is repeated. How to find the repeated element without extra space?
6. Implement stack and queue using SLL?
7. how to add 150 and 100 length numbers?
8. Find the third biggest element in array?
9. Questions on strings
10. Some Non-technical questions(are you manageable or accurate person?) to check our mind set.

Source: sridhar reddy(M.Tech(CS))