Interview questions
Software Developer interview questions – page 11
945 questions. Tap “Show answer” to check yourself.
-
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
-
Will your family allow you to move to Hyderabad
-
Discussion on internship at IBM' Cloud Unit
-
Difference between C and C++
-
Explain projects which you made in college?
-
Do you know anything about DBMS? Where is it used?
-
Can a constructor be private?
-
Explain the background process that takes place during an atm transaction
-
Cut cake into 8 pieces .You can use knife 3 times only
-
A shot fired from a gun pointing towards a tree full of birds. All birds left except one. Why ?
-
Singlton pattern?
-
How many types of trigger?
-
Can trigger be used with select statement?
-
Indexing in mysql? How many types of indexing in mysql?
-
Engines in mysql?
-
Find 2 elements in array whose sum is equal to given number?
-
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?
-
What do you do when your schedule is interrupted? How you handle it?
-
PreOrder traversal without recursion?
-
Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
-
Singleton pattern, observer pattern?
-
String pool and how garbage collection functionality works?
-
HashMap , how can you synchronize ?
-
Process vs Thread differences and synchronization,deadlock examples?
-
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
-
Change Binary tree so that parent node is the sum of root nodes
-
Reverse a linkedlist ?
-
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)
-
Given a situation and asks you which search algorithm suits the best in that situation
-
Inorder Travesal of a tree without recursion(write the code)