How does Java Garbage Collection work? How would you implement garbage collection?
Desenvolvedor De Software Interview Questions
Desenvolvedor De Software Interview Questions
A área de desenvolvimento de projetos está em alta e oferece bons salários e realização profissional. Em entrevistas para cargos de desenvolvimento de software, são normalmente feitas perguntas relacionadas às suas habilidades técnicas e comportamentais e a como você gerencia projetos de maneira eficiente.
Principais perguntas de entrevista para desenvolvedor(a) de software e como respondê-las
Pergunta 1: Com qual tipo de desenvolvimento de software você trabalha no momento?
Pergunta 2: Descreva um problema de desenvolvimento que você tenha tido e como o solucionou.
Pergunta 3: Como é seu processo de garantia de qualidade?
93,166 desenvolvedor de software interview questions shared by candidates
The question he asked was how to reverse the string by words. For example: "This is a car" -> "car a is This"
Reverse Integer, Two LinkedList intersects with each other, general question about heap, Buy and sell stock, Fabonacci, find the smallest common mutiples of two numbers.
Find repeating characters in string. Count occurrences of number in a stream of numbers. Print elements of a linked list in a particular order. Eg: 2-4-5-6-7-10-13 . output - "2,4-7,10,13". If the numbers are consecutive print the starting and ending number of the range, otherwise print the numbers as such in the form of string
Interview 1: 1. virtual functions, inheritance, etc..easy to answer c++ questions. Conversation was for about 20-25 minutes 2. Can't exactly recall, but it was about Binary Search Tree, pretty easy to find on the web. I think it was to do with levels in BST, I used recursion in the solution. Interviewer was happy with the solution. Overall call lasted for about 1 hour and 5 minutes including some questions I asked him. Interview 2: 1. What is mutex, semaphore? 2. What is a singleton pattern and can you write one that is thread-safe 3. Write a consumer producer problem. Producer produces 1000 objects and there are five consumers that consume 10 objects at a time in round robin fashion until all of them are consumed. This means that if consumer 1 consumes 10 objects, it has to wait for consumer 2, 3, 4, 5 to consume 10 objects each before it can consume other 10.
Given a list of ones and zeros, how would you sort the list efficiently so the zeros are in the front and the ones are in the second half.
template<class T1; class T2; class T3> int Product (T1 a, T2 b, T3 c) { return a * b * c; } What is the error in the sample code above?
what is the return type of sizeof()
C#, if you set lock in a method, will you be able to do a recursive call again?
Count the number of appearance of h from given passage
Viewing 521 - 530 interview questions