Axiscades Graduate Engineer Interview Questions and Answers

Basic Aptitude questions and tech questions

Q1. Prepare networking and your CV
Add your answer
Q2. Networking , subnet, tcp,. Osi
Add your answer

Q1. Your hobby and who inspires you
Add your answer
Q2. Questions on project
Add your answer
Q3. Why do you want to join us Your hobby What motivates you Contributions in project
Add your answer
Q4. Contributions in project
Add your answer
Q5. What do you know about the company
Add your answer

Easy numerics, logical, coding, technical

Q1. Reverse a array
Ans. 
Reverse an array of integers in place
• Create two pointers, one at the start and one at the end of the array

• Swap the elements at the two pointers and move them towards the center until they meet

• Time complexity: O(n), Space complexity: O(1)
Answered by AI
Add your answer
Q2. Create a list of duplicates in array
Ans. 
Function to find duplicates in an array of integers and return a list of unique duplicates.
• Iterate through the array and keep track of elements seen before using a hash set.

• If an element is already in the hash set, add it to the result list.

• Return the list of unique duplicates found.
Answered by AI
Add your answer

Basic apptitude question and technical question

Q1. Networking question
Add your answer

Basic aptitude questions

Q1. British council App
Add your answer

Q1. Ask about some technical questions based on my resume 1.self intro 2.Java basic questions 3.Asked about HTML and CSS Concepts
Add your answer

Q1. Basic questions bond and she said about company
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

MCQ's as well some basic coding questions were there in this round

Q1. Cycle Detection in a Singly Linked List
You have given a Singly Linked List of integers, determine if it forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the ...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered Anonymously
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

Questions on DBMS and OS were asked in this round

Q1. Operating System Question
What is the difference between paging and segmentation?
Add your answer
Q2. Operating System Question
What do you mean by FCFS?
Add your answer
Q3. DBMS Question
Difference between Normalization and Denormalization
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Basic HR questions like why do you want to join this company and some questions on behavioural and resume.

Arithmetic, reasoning, English

Q1. Communication,grammar and vocabulary
Add your answer

Q1. Java,c,dbms basics
Add your answer

Q1. Basic interview questions
Add your answer

Basic Aptitude questions and tech questions

Q1. Prepare networking and your CV
Add your answer
Q2. Networking , subnet, tcp,. Osi
Add your answer

Q1. Your hobby and who inspires you
Add your answer
Q2. Questions on project
Add your answer
Q3. Why do you want to join us Your hobby What motivates you Contributions in project
Add your answer
Q4. Contributions in project
Add your answer
Q5. What do you know about the company
Add your answer