Interview questions

Software Developer interview questions – page 11

945 questions. Tap “Show answer” to check yourself.

  1. Variation of http://www.geeksforgeeks.org/find-possible-words-phone-digits/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n

  2. Will your family allow you to move to Hyderabad

  3. Discussion on internship at IBM' Cloud Unit

  4. Difference between C and C++

  5. Explain projects which you made in college?

  6. Do you know anything about DBMS? Where is it used?

  7. Can a constructor be private?

  8. Explain the background process that takes place during an atm transaction

  9. Cut cake into 8 pieces .You can use knife 3 times only

  10. A shot fired from a gun pointing towards a tree full of birds. All birds left except one. Why ?

  11. Singlton pattern?

  12. How many types of trigger?

  13. Can trigger be used with select statement?

  14. Indexing in mysql? How many types of indexing in mysql?

  15. Engines in mysql?

  16. Find 2 elements in array whose sum is equal to given number?

  17. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?

  18. What do you do when your schedule is interrupted? How you handle it?

  19. PreOrder traversal without recursion?

  20. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?

  21. Singleton pattern, observer pattern?

  22. String pool and how garbage collection functionality works?

  23. HashMap , how can you synchronize ?

  24. Process vs Thread differences and synchronization,deadlock examples?

  25. given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times

  26. Change Binary tree so that parent node is the sum of root nodes

  27. Reverse a linkedlist ?

  28. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)

  29. Given a situation and asks you which search algorithm suits the best in that situation

  30. Inorder Travesal of a tree without recursion(write the code)

Companies that ask Software Developer questions