Skip to contentSkip to footer

Desarrollador Java Interview Questions

Salaries
Interviews

Desarrollador Java Interview Questions

En una entrevista para un puesto de desarrollador Java, prepárate para responder preguntas técnicas destinadas a evaluar tus conocimientos básicos de Java. El posible que también te formulen preguntas abiertas para evaluar tus habilidades de programación y de resolución de problemas. Prepárate para afrontar preguntas no técnicas centradas en tus habilidades de comunicación interpersonal, de organización del tiempo y de ética en el trabajo.

Preguntas de entrevista más frecuentes para desarrollador/a Java y cómo responderlas

Question 1

Pregunta n.º 1: ¿Cuál es la diferencia entre HashTable y HashMap en Java?

How to answer
Respuesta recomendada: Los entrevistadores usarán preguntas técnicas para evaluar tu cualificación formal y tus conocimientos del lenguaje de programación Java. Aprovecha tu respuesta para exponer tus habilidades de comunicación. Aunque lleves años programando, quizás te convenga repasar tus nociones básicas de Java antes de la entrevista.
Question 2

Pregunta n.º 2: Escribe un programa para determinar si 243 es un número Armstrong.

How to answer
Respuesta recomendada: Usarán preguntas abiertas para poner a prueba tus habilidades de programación. Esta pregunta permite evaluar tu capacidad para resolver un problema utilizando un algoritmo de Java. Explica tu planteamiento mientras utilizas un editor de código o pizarra.
Question 3

Pregunta n.º 3: ¿Cómo lograrías elaborar código de calidad si tuvieras que simultanear varios proyectos Java?

How to answer
Respuesta recomendada: Los desarrolladores Java a menudo tienen que trabajar en varios proyectos a la vez. Las personas que realizan la entrevista utilizan preguntas como esta para poner a prueba tus habilidades organizativas y de gestión. Las empresas también intentan evaluar tu compromiso de calidad con tu trabajo. Si tienes experiencia como desarrollador, incluye ejemplos de tu experiencia profesional que demuestren tu capacidad para producir trabajo de calidad y para gestionar el tiempo de manera eficiente.

710,996 desarrollador java interview questions shared by candidates

Had 30 minutes to do this quiz. 1.Which of the following decimal numbers has an exact representation in binary notation? (Zero or more may be correct.) A. 0.1 B. 0.2 C. 0.3 D. 0.4 E. 0.5 F. None of the above. 2 .Bob writes down a number between 1 and 1000. Mary must determine that number by asking "yes/no" questions of Bob. Mary knows that Bob always tells the truth. If Mary uses an optimal strategy, then she will determine the answer at the end of exactly how many questions in the worst case? A. 1,000 B. 999 C. 500 D. 32 E. 10 3. Consider a singly linked list of the form cid:image001.gif@01CEF279.4C2C0140 where F is a pointer to the first element in the list and L is a pointer to the last element in the list. The time of which of the following operations depends on the length of the list? (Exactly one answer is correct.) A. Delete the last element of the list. B. Delete the first element of the list. C. Add an element after the last element of the list. D. Add an element before the first element of the list. E. Interchange the first two elements of the list. 4. p = 1; k = 0; while( k < n ) { p = 2 * p; k = k + 1; } For the program fragment above, which of the following is a loop invariant; i.e., true at the beginning of each execution of the loop and at the completion of the loop? A. p = k + 1 B. p = (k + 1)2 C. p = (k + 1)2k D. p = 2k E. p = 2k+1 5. A particular BNF definition for a "word" is given by the following rules. <word> ::= <letter> | <letter><pairlet> | <letter><pairdig> <pairlet> ::= <letter><letter> | <pairlet><letter><letter> <pairdig> ::= <digit><digit> | <pairdig><digit><digit> <letter> ::= a|b|c|...|y|z <digit> ::= 0|1|2|...|9 Which of the following lexical entities can be derived from <word>? (Zero or more answers may be correct.) A. word B. words C. c22 D. 42 E. None of the above. 6. If the variables below are properly initialized, and if i remains within array bounds, then the code below implements the stack operations Push and Pop. Note that the stack is held in an array S[1..N] indexed by the variable i. Push: begin S[i] := x; i :=i + 1 end Pop: begin i:=i - 1; x:= S[i] end Which of the following statements correctly initializes i for this implementation of a stack? A. i := N B. i := N-1 C. i := 1 D. i := 0 E. i := N/2 7. Consider a virtual memory with M resident pages and a page reference sequence p1, p2, . . ., pN of N distinct requests. Assume that physical memory is initially filled with unrelated pages, N = 2M, and a FIFO page replacement algorithm is used. If the access pattern is p1, p2, . . ., pN repeated three times, then the number of page faults is A. N/2 B. N C. N + 3 D. 2N E. 3N 8. Consider the following subroutine. int Func( int n ) { if( n == 4 ) return 2; else return 2 * Func( n + 1 ); } What value is returned by the subroutine call Func(2) ? A. 2 B. 4 C. 8 D. 16 E. 24 9. Consider a queue between the two processes indicated below. N is the capacity (maximum length) of the queue; e, f, and b are semaphores. "P" refers to the operation of acquiring (decrementing) a semaphore, and "V" refers to the operation of releasing (incrementing) a semaphore. init() { e = N; f = 0; b = 1; queue = EMPTY; } process1() { for(;;) { P(e); P(b); queue.enqueue(...); V(b); V(f); } } process2() { for(;;) { P(f); P(b); ... = queue.dequeue(); V(b); V(e); } } Which of the following statements is (are) true? (Zero or more may be correct.) A. The purpose of semaphore f is to ensure that dequeue is not executed on an empty queue. B. The purpose of semaphore e is to ensure that deadlock does not occur. C. The purpose of semaphore b is to provide mutual exclusion for queue operations. D. None of the above. 10. If V is a vector with n items and subroutine Exchange swaps its arguments, then the following code fragment sorts V in descending order. for( j = 0; j < n - 1; j++ ) for( k = 0; k < n - j - 1; k++ ) if( V[k] < V[k+1] ) Exchange( V[k], V[k+1] ); How many calls to Exchange are made if initially, V[i]=i, for i = 0, 1, 2, ..., n - 1 ? A.n-1 B. n C. n(n-1)/2 D.(n-1)(n-2) E. n(n-1)

Software Engineer

Interviewed at Glimmerglass Networks

3.2★
Mar 3, 2014

Had 30 minutes to do this quiz. 1.Which of the following decimal numbers has an exact representation in binary notation? (Zero or more may be correct.) A. 0.1 B. 0.2 C. 0.3 D. 0.4 E. 0.5 F. None of the above. 2 .Bob writes down a number between 1 and 1000. Mary must determine that number by asking "yes/no" questions of Bob. Mary knows that Bob always tells the truth. If Mary uses an optimal strategy, then she will determine the answer at the end of exactly how many questions in the worst case? A. 1,000 B. 999 C. 500 D. 32 E. 10 3. Consider a singly linked list of the form cid:image001.gif@01CEF279.4C2C0140 where F is a pointer to the first element in the list and L is a pointer to the last element in the list. The time of which of the following operations depends on the length of the list? (Exactly one answer is correct.) A. Delete the last element of the list. B. Delete the first element of the list. C. Add an element after the last element of the list. D. Add an element before the first element of the list. E. Interchange the first two elements of the list. 4. p = 1; k = 0; while( k < n ) { p = 2 * p; k = k + 1; } For the program fragment above, which of the following is a loop invariant; i.e., true at the beginning of each execution of the loop and at the completion of the loop? A. p = k + 1 B. p = (k + 1)2 C. p = (k + 1)2k D. p = 2k E. p = 2k+1 5. A particular BNF definition for a "word" is given by the following rules. <word> ::= <letter> | <letter><pairlet> | <letter><pairdig> <pairlet> ::= <letter><letter> | <pairlet><letter><letter> <pairdig> ::= <digit><digit> | <pairdig><digit><digit> <letter> ::= a|b|c|...|y|z <digit> ::= 0|1|2|...|9 Which of the following lexical entities can be derived from <word>? (Zero or more answers may be correct.) A. word B. words C. c22 D. 42 E. None of the above. 6. If the variables below are properly initialized, and if i remains within array bounds, then the code below implements the stack operations Push and Pop. Note that the stack is held in an array S[1..N] indexed by the variable i. Push: begin S[i] := x; i :=i + 1 end Pop: begin i:=i - 1; x:= S[i] end Which of the following statements correctly initializes i for this implementation of a stack? A. i := N B. i := N-1 C. i := 1 D. i := 0 E. i := N/2 7. Consider a virtual memory with M resident pages and a page reference sequence p1, p2, . . ., pN of N distinct requests. Assume that physical memory is initially filled with unrelated pages, N = 2M, and a FIFO page replacement algorithm is used. If the access pattern is p1, p2, . . ., pN repeated three times, then the number of page faults is A. N/2 B. N C. N + 3 D. 2N E. 3N 8. Consider the following subroutine. int Func( int n ) { if( n == 4 ) return 2; else return 2 * Func( n + 1 ); } What value is returned by the subroutine call Func(2) ? A. 2 B. 4 C. 8 D. 16 E. 24 9. Consider a queue between the two processes indicated below. N is the capacity (maximum length) of the queue; e, f, and b are semaphores. "P" refers to the operation of acquiring (decrementing) a semaphore, and "V" refers to the operation of releasing (incrementing) a semaphore. init() { e = N; f = 0; b = 1; queue = EMPTY; } process1() { for(;;) { P(e); P(b); queue.enqueue(...); V(b); V(f); } } process2() { for(;;) { P(f); P(b); ... = queue.dequeue(); V(b); V(e); } } Which of the following statements is (are) true? (Zero or more may be correct.) A. The purpose of semaphore f is to ensure that dequeue is not executed on an empty queue. B. The purpose of semaphore e is to ensure that deadlock does not occur. C. The purpose of semaphore b is to provide mutual exclusion for queue operations. D. None of the above. 10. If V is a vector with n items and subroutine Exchange swaps its arguments, then the following code fragment sorts V in descending order. for( j = 0; j < n - 1; j++ ) for( k = 0; k < n - j - 1; k++ ) if( V[k] < V[k+1] ) Exchange( V[k], V[k+1] ); How many calls to Exchange are made if initially, V[i]=i, for i = 0, 1, 2, ..., n - 1 ? A.n-1 B. n C. n(n-1)/2 D.(n-1)(n-2) E. n(n-1)

There were 2 questions I tackled. The first was a power function that needed to be implemented in logn time and a Java encapsulation question (asking questions about making arrays inaccessible from outside the object).
avatar

Software Engineer Intern

Interviewed at Wealthfront

4.2★
Mar 25, 2014

There were 2 questions I tackled. The first was a power function that needed to be implemented in logn time and a Java encapsulation question (asking questions about making arrays inaccessible from outside the object).

Viewing 921 - 930 interview questions

Glassdoor has 710,996 interview questions and reports from Desarrollador java interviews. Prepare for your interview. Get hired. Love your job.