Least common ancestor without using recursion
Sdet Interview Questions
4,412 sdet interview questions shared by candidates
Questions were easy. Asked about Queue
None. CS fundamentals. LList, Sorting, Arrays etc.
An array that has 8 bit slots but is storing 12 bit integers, so position zero stores the first eight bits of the integer, and the first 4 bits of position one store the last 4 bits. The second 4 bits of position one store the highest bits in the second integer and position two stores the lowest 8 bits and so on. Devise a way to read these numbers from the array (in C)
Linked List Related
Recursivity, BST, string manipulation
I would rather not disclose any interview questions. I will say that half the questions I got were very personalized, while the other half are similar to the ones you can find online... Know your algorithms, data structures, and design patterns. My networks, information security, databases, compilers, and finite state automata knowledge came in handy as well.
what was your most difficult programming project and how were you able to work through it?
Problem of concurrent transactions done by two persons of a joint account at two different ATM Machines. How is it managed without introducing any inconsistency in balance of the account holders?
Prepare a detailed Test Plan Document: Resources required, Hardware required,Test Scenarios, Time required etc for "testing a Simple Web application form with 3 text fields and 2 numeric fields". He asked me to first ask him all the requirements as one would ask the client.
Viewing 2101 - 2110 interview questions