J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Amadeus (New Delhi) en août 2016
Entretien
The campus recruitment process consisted of a preliminary online test which was conducted on SHL platform. Majority portion was on Data Interpretation and calculators will be allowed. This tells you how much calculation is required. I would suggest you to take a practice test a day prior to the actual test. It helped me a lot.
Out of 125 students, 16 were shortlisted for the interviews.
The panel was very friendly, especially the director. Normal coding questions and puzzles in addition to your resume.
A total of 3 rounds: Tech + Director + HR
The final list had 6 students.
First round was a coding OA, then I gave a quantitative aptitude test, then I attended an interview where they asked two coding questions and a lot of behavioural questions, this was an on campus process.
It was good with 3 round of interview. Solid questions of c++ and technical aspect. Questions was about critical thinking and details of c++. My prior experience was not mentioned at all.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Amadeus (Vellore) en août 2024
Entretien
The process was an on-campus recruitment drive for freshers. It has 2 online rounds, the 1st was a technical MCQ and DSA round. It has around 35 technical MCQs from various topics like Java, DBMS, OS, CN, Cloud, Ruby, R, Swift, Golang and 2 DSA easy questions.
The next online round was based on a shortlist from the above round and had only English aptitudes like passages, grammar and synonyms, antonym and a section of maths (mostly data interpretation).
The final was an HR plus technical interview and questions were based on the resume and core topics with a discussion and problem-solving of a few easy to medium-level DSA questions. Make sure to solve some puzzles from GFG as they also asked for puzzles and only selected applicants who could solve them.
Questions d'entretien [1]
Question 1
Which sorting algorithm is the fastest in term of TC ?