Solicité el puesto a través de un captador. El proceso duró más de 1 semana. Acudí a una entrevista en Paragyte Technologies (Pune) en sept 2017
Entrevista
I had applied through Pragmatic, Pune.
Paragyte arranged the test in their office. You have to bring your own laptop for the test. Then after connecting to their network the test begins for 1:30 hr.
Test was surprising.
Everything Cpp.
15 questions
11 questions on Cpp snipets like pointers, enums, etc. All MCQs
Rest 4 were programming.
1. Cpp - Object addition using binary + operator.
2. Cpp - Second last max prime number from a 3x3 matrix.
3. Html - Get name and update in the list. If starting letter is vowel then text should be red else blue.
4. Html - Create a form with gender male female and age. If age > 18 Candidate can vote else not.
The results for that test aren't declared yet.
45
Otras opiniones sobre las entrevistas para el puesto de Java Developer en Paragyte Technologies
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 2 días. Acudí a una entrevista en Paragyte Technologies (Pune) en dic 2017
Entrevista
Apptitude + Technical Interview (F2F) + Technical & HR
Apptitude included MCQs on C++ and 2 programs in java and 2 programs in Javascript.
Technical Interview (F2F) Core and Advance Java Questions. Write Programs on related to Matrix. Some SQL related questions.
HR: Tricky questions, Data Structures. What are you planning after next 2 years?
Preguntas de entrevista [1]
Pregunta 1
Write a program to find whether the string Is Palindrome or Not, using recursion.
Note: Without declaring any variable inside the function. Time complexity must be O(n/2).
boolean Palindrome(String str, int length){
...............
}
Solicité el puesto a través de un captador. El proceso duró 3 semanas. Acudí a una entrevista en Paragyte Technologies en nov 2017
Entrevista
90 min test in which 11 Qestion are on C programing language all are mcq type and 4 Qestion are on java and JavaScript 2 ,2 Qestion respectively. In java 2 Qestion are shorting of an array and factorial using recursive function.
