Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Evive (Jaipur, Rajasthan) nel mese di ott 2016
Colloquio
Ist round was online round. some questions related to QA and data structures were asked.
IInd round was F2F round in which I was asked data structures and java as mentioned in my resume.
IIIrd round was with one of the senior engineer at Evive health on google hangout.
firstly he asked me some general question than some questions related to my projects.he was not satisfied by my answers but I liked the questions he asked me he wanted not the bigger concepts.he wanted the strong fundamentals there should be no errors in fundamental questions.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Evive (Patiala)
Colloquio
Worst Interview of all time. Most miss managed interview. They needed java programmers but got upset when I told them I knew java. Arrogant and inexprerienced interviewers from this company are there only to waste your time.
They dont even disclose the compensation.
Domande di colloquio [1]
Domanda 1
Questions about java interfaces and abstract classes.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 4 giorni. Ho sostenuto un colloquio presso Evive (Gāndhīnagar, Gujarat) nel mese di ago 2016
Colloquio
There were 5 phases of the recruitment process.
Round 1: Written Test
There were 10 questions in the written Test. Questions from OS, Probability and C fundamentals were asked. There were also 3 coding questions for which we had to write code with Test Cases.
Round 2: F2F
There were some questions related to written test itself and then discussion about the projects which I have done.
Round 3: F2F Technical interview
I was asked 1 coding question and then questions related to Data Structures and OS.
1) Given an array of size n, find subarray of size k which has maximum product of its elements.
2) Find inorder successor of an element in BST and also find kth largest element in BST.
Round 4: Google Hangout Interview
This was the toughest interview among 3 rounds. Questions from OS, Discrete Math and Hashing were asked. Very little time was given to answer a question. Although, I could not answer around 30 percent of the questions, I was selected for the next round. Interviewer was testing how you perform under pressure.
Round 5: HR round
HR round was also on Hangout early in the morning. He asked general HR questions and what is my dream profile. Some other questions are: Why do you want to join Evive? Which technical subjects you are weak at and how will you improve it?
The entire process took 4 days, but it was worth it.
Domande di colloquio [2]
Domanda 1
What are the cons of FIFO page replacement algorithm and which algorithm is better than FIFO?