Aristocrat Gaming Interview Experience | Set 1 (Off Campus)
Round-1 (Online Coding Test)
There were 10 basic C based Multiple choice questions And 6 Code based in which I have to write code and run.
Coding Questions were :-
- https://www.geeksforgeeks.org/count-possible-decodings-given-digit-sequence/
- https://www.geeksforgeeks.org/program-for-array-rotation-continued-reversal-algorithm/
- https://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/
There were 3 more Questions of easy(or average) difficulty level. All next rounds were in their office at Noida.
Round-2 (Written-C based)
18 C based Multiple choice questions(Mainly Pointers) And 3 easy programming questions like:
- Count No. of set bits in a number
- Reverse the words in a string. Ex.- Str[]-”hello mr X” Output- str- “X mr hello”
Round-3 (Written- C++ based)
Mainly STL and Template Based
Round-4 (Face-to-face)
- Discussion on C and C++ Concepts like
- What happens if we return address of a local variable and solution (Heap or Static)
- Difference b/w macro and inline and how they works
- Difference b/w New and Malloc
- What is Virtual Function And how Virtual table and Virtual pointer Works.
- Famous diamond Problem.
- When Should we write our own Assignment operator and Copy Constructor. etc
- https://www.geeksforgeeks.org/find-a-repeating-and-amissing-number/ discussion and he wanted optimal solution.
Round-5(Face-to-Face)
- Mainly STL and Template Based Discussion.
- Write a program to implement Generic Queue class.
- Apply all Oops Concepts.
- Implement set STL class etc.
Round-6(With Project Lead)
- What are the various Oops Concepts .
- Do you know any SDLC Model ? Explain .
- Discussion on Project and what difficulty I have faced etc.
- Do you have any Prior Experience of Gaming.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above