# Amdocs Online Test Interview Questions

Get the latest Amdocs C++ Technical Test Free Practice Papers. Analyze your skill and knowledge of attempting online tests and get world rankings to see where you stand in the exam.

Attempt this free Amdocs C programming Online Mock Test and check out your eligibility for the exam among everyone.

To score well, make online practice test by youth4work for Amdocs SQL Technical Mock Test Series part of your preparations.

Attempt this free Amdocs Unix Free Practice Paper and check out your eligibility for the exam among everyone.

Get a complete evaluation of your performance by taking free Amdocs JAVA Online Mock Test and improve it until you are satisfied with your performance and score in the exam.

To score well, make online practice test by youth4work for Amdocs SQL Technical Mock Test Series part of your preparations.

Attempt this free Amdocs Unix Free Practice Paper and check out your eligibility for the exam among everyone.

Attempt this free Amdocs C programming Online Mock Test and check out your eligibility for the exam among everyone.

Get the latest Amdocs C++ Technical Test Free Practice Papers. Analyze your skill and knowledge of attempting online tests and get world rankings to see where you stand in the exam.

Get a complete evaluation of your performance by taking free Amdocs JAVA Online Mock Test and improve it until you are satisfied with your performance and score in the exam.

Before getting into the Amdocs interview questions, here is the Amdocs recruitment process. It consists of three rounds:

Amdocs selection procedure is quite vigorous and challenging. This often leads to the rejection of people who are skilled enough in case they aren’t able to take up the pressure.

## 60interviewsfound Sort by:

Round duration – 90 minutes Round difficulty – Medium

This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were of easy to medium difficulty .

• Q1. Nth Fibonacci Number Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula – F(n) = F(n-1) + F(n-2), Where,read more View Answers (4)
• Q2. Subarray with equal occurrences You have been given an array/list ARR of length N consisting of 0s and 1s only. Your task is to find the number of subarraysread more View Answers (3)
• Round duration – 60 Minutes Round difficulty – Medium

This round consisted of 1 question from DSA with medium level of difficulty and then the rest of the questions were asked from DBMS and OOPS. I was also made to execute a SQL query in my laptop .

• 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 noderead more View Answers (4)
• Q3. DBMS Question Table my_numbers contains many numbers in column num including duplicated ones. Can you write a SQL query to find the biggest number, which onread more View Answers (1)
• Round duration – 60 Minutes Round difficulty – Medium

This was a mixed round where I was asked to code 1 basic Programming question and later I was asked some important concepts from Operating Systems/Linux and the famous SOLID principles from Object Oriented Design .

• Q1. Merge Sort Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithread more View Answers (3)