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

Wednesday, 11 November 2015

CDK Global Interview Experince

Written test: 
  • 50questns - 60min - no negative marking 
  • 30 Quantitative, Reasoning, English
  • 20 Programming (C,Java) + subjects(major is DBMS)
Group Discussion: 
completely based on English
Technical:
Went for 50 min approximate.
  1. Asked to explain my project. Asked 5-6 research questions in my project(why this happens, what if something happens, what of that fails etc)
  2. Code related to my project( database connection and sockets connections)
  3. Cohesion n coupling, spiral model vs waterfall model, different testings.
  4. Duplicates in doubly linked list program.
  5. Program of Doubly linked list insertion at a particular index.
  6. Given a sentence write a program to reverse each word without an extra array. 
  7. Given a sentence write a program to to reverse each alphabet upto a particular given index and the rest of the sentence should be normally printed. Asked to optimise the code for 3 times.
  8. DFS and BFS and their applications.
  9. Program on Febinoci series without recursion in two ways and with recursion. 
  10. Why object oriented? Procedural lang Vs Object Oriented languae, Concepts of OOP and examples.
  11. Different access specifiers and their working.
  12. What is user defined data types, structure and a sample program. Difference between class and a struct.
  13. Gave 3 puzzles(i did two and one partially).
  14. Why have you chosen Java as your comfortable lang rather than c?
Senior Managerial:
For me its just for 10min. They are testing not only your communication but your attitude and your confidence at a particular situation.
  1. Given a situation and asked what will you do if your are there.
  2. Why have you chosen M.Tech? What was the most interesting question asked for you and y its interesting for you?
  3. Why are you comfortable with Java?
  4. Justify yourself that your acts and decisions are perfect all the time so far in your life (  he is impressed n ans was appreciated )
Note: for this round just don't go with the question try to answer differently and frankly what you think.
H.R:
  1. Tell me about yourself.
  2. Tell me about your family background.
  3. How passionate you are in coding?
  4. Have you given up on any program?
  5. Will you help and also take help from others if required even if you don't like that person in personal ?
  6. What are your hobbies in technical and non technical side ? discuss why?
  7. Why M.Tech? Y didn't u go for a job after B.Tech?
  8. What is difference that can you observe in yourself from B.Tech to M.Tech as a human not in technical(He appreciated my ans )
  9. Any current offers ? Y are u leaving your current offer?
  10. In which way u think CDK is apt work place for you?
  11. Where do you want to look yourself in long term and short term how will you achieve them?
  12. What are your motivations in technical and non technical ?
Source: Yeswanth M.Tech IT(2014 - 2016)

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)