Big Data Engineer applicants have rated the interview process at Exadatum with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 33% positive. To compare, the company-average is 66.7% positive. This is according to Glassdoor user ratings.
Candidates applying for Big Data Engineer roles take an average of 1 day to get hired, when considering 3 user submitted interviews for this role. To compare, the hiring process at Exadatum overall takes an average of 1 day.
Common stages of the interview process at Exadatum as a Big Data Engineer according to 3 Glassdoor interviews include:
Group panel interview: 40%
Presentation: 40%
Other: 20%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 1 day. I interviewed at Exadatum (Pune) in Mar 2017
Interview
Rounds are usual - Aptitude test, Coding round ( 1-2 as required), Technical Interview and lastly HR round.
They are more focused on writing clean and readable codes and will to do more than what you know at the time.
Interview questions [1]
Question 1
Coding questions had above average difficulty, and Interview is mostly dependent on problem-solving skills and project work.
I applied through a staffing agency. The process took 1 day. I interviewed at Exadatum (Pune) in Oct 2017
Interview
interview had three rounds in total
first round was aptitude test it contained questions on data structures, and quantitative aptitude questions..
test was of 30 mins and had 25 questions, most of the questions were on DS and few on quantitative aptitude
I applied online. I interviewed at Exadatum (Almeirim) in Jul 2017
Interview
The first round of interview contains a pen paper based MCQ which contains 15 dsa based questions and 5 quant questions. The question of dsa is mostly from tree, linked list, tree-traversal and graph.
I applied online. I interviewed at Exadatum (Pune) in Jun 2017
Interview
The 3 Rounds of Algorithmic Coding, Followed by another 2 rounds of Behavioral Interview.
The algorithmic Coding was strictly based on the usual data structures including stacks, queues, hashmaps, trees.
Interview questions [1]
Question 1
1. Reversing Binary Tree
2. Cascaded Stack-Queues
3. Graphs Problems
4. Frequency Updater class