Menu Close

Amadeus Interview questions | set-1

This is first set of Amadeus interview questions . These given below amadeus Interview questions were asked candidate who was having 5 years of experience in networking domain.

Date of Interviews: 06 / 02/ 2020

No of Rounds: 2 face to face

1: Tell me about yourself and bit about the projects.

2: People are standing in a circle. You are given starting point which is pointing to particular one person. Each person will kill who is standing next to each other in sequential order. Find out last person.

Data structure: Circular Linked list


People standing in a circle like: 

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11

Given starting point: 1

In 1st iteration:
1 will kill 2.
3 will kill 4.
5 will kill 6.
7 will kill 8.
9 will kill 10.
11 will kill 1.

Final list: 3, 5, 7, 9, 11

2nd iteration:
3 will kill 5.
7 will kill 9.
11 will kill 3.

Final list: 7, 11

3rd iteration:
7 will kill 11.

Now, there is only one node i.e 7.

So the answer is 7.

3: Delete a node from Binary search tree.

4: Define Macro for sizeof operator in C

5: You are given an integer array and n stacks. You have to write one generic push function which will take two parameters as input. first parameter in push function is integer value and 2nd parameter is stack pointer. You have to perform push operation into these stacks.


arr[] = {1,2,3,4,5,6,7}

There are given three stacks say:

stack_1, stack_2, stack_3.

Given Operations like:

push(1, stack_1)
push(2 stack_2)
push(3, stack_3)
push(4, stack_2)
push(5, stack_1)
push(6, stack_2)

stack_1: 1, 5
stack_2: 2, 4, 6
stack_3: 3

6: You are given an array and Implement a stack to find max element in o(1). You have to use only stack operations.

7: How to debug core dump in c.

8: Which tool do you use to debug memory leaks and how this works. I said about valgrind.

To learn more about technical stuff, Please refer given below link.


Posted in Amadeus, Interview questions

Leave a Reply

Your email address will not be published. Required fields are marked *