Atos Software Development Engineer Interview Questions and Answers

Game based reasoning

2 codes are given we have to solve them in python and 2 SQL queries are given we have to solve them and finally we should develop a website using HTML, CSS and js

General knowledge based like Ai

Q1. Find largest element in sorted rotated array.
Ans. 
Find largest element in sorted rotated array
• Start by finding the pivot element in the rotated array

• Compare the element at pivot index with the first element to determine which half to search

• Perform binary search in the appropriate half to find the largest element
Answered by AI
Add your answer
Q2. I was great interview, Interviewer was very friendly, I was able to answer the question correctly.
Add your answer
Q3. Java basics questions.
Add your answer

Q1. Explain how rest api authenticated
Ans. 
REST API authentication is the process of verifying the identity of clients accessing the API.
• Authentication can be achieved using various methods such as API keys, tokens, or OAuth.

• API keys are unique identifiers issued to clients and are included in the request headers for authentication.

• Tokens are generated upon successful login and are used to authenticate subsequent requests.

• OAuth is a protocol that allows clients...read more
Answered by AI
Add your answer

Q1. Not attended yet
Add your answer

It was simple and easy, anyone can solve it

Q1. In this round we had to record videos of ourselves speaking based on some topic they provide.
Add your answer

Q1. The most of the part was HR questions, they only asked for my previous projects as technical.
Add your answer

Q1. Basic java questions along with oops concepts
Add your answer
Q2. Spring mvc and spring boot
Add your answer

Some basic questions on maths and dfs and bfs.

Q1. On the basis of the project and your cs subjects mentioned in the resume
Add your answer
Q2. Height of the binary tree, factorial code in python
Ans. 
Calculate the height of a binary tree and implement factorial code in Python.
• To calculate the height of a binary tree, you can use a recursive approach where you find the height of the left and right subtrees and return the maximum height plus one.

• For factorial code in Python, you can use a recursive function that multiplies the current number with the factorial of the previous number until reaching 1.

• Example for calcu...read more
Answered by AI
Add your answer