Amdocs Associate Software Engineer Interview Questions, Process, and Tips

They usually ask fundamental question like, palindrome, string inversion etc.

Q1. Will ask about your projects
Add your answer
Q2. SQL question majorly focusing on Join
Add your answer

Basic Aptitude and reasoning

Intermediate String questions.
Buy and sell stocks.
Second largest salary SQL.
Basic linux commands.

Q1. What are your strength and weaknesses
Add your answer
Q2. Why you want to join amdocs
Add your answer

The aptitude test was quite hard because the platform does not have questions which are in online

There are 5 questions 3 programming questions and 2 Sql Queries

Q1. The interviewer was good he asked questions on java sql and linux
Add your answer
Q2. Introduction ,Oops concept, types of join ,about project, linux commands
Add your answer

Q1. Introduction , strength and , weakness why amdocs, about relocation
Add your answer

It consisted of MCQ questions related to sql, dbms, OS and computer networking. And then 2 easy level coding questions.

Q1. Asked about the projects mentioned in my résumé and questions related to java and sql joins
Add your answer

Q1. Asked me for my introduction and basic hr questions like describe your strengths and weaknesses and why do you want to join Amdocs and if you will be leaving for higher studies.
Add your answer

Q1. 1. Debugging question in C
Add your answer
Q2. 10 words stating with letter "q"
Add your answer

Q1. Location conformation asked via phone
Add your answer

Mcq questions math c c c c c c c c v v v v v v v v

Q1. Unix commands, basic coding question, basic friendly interaction, hypothetical situation based question etc etc etc
Add your answer

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. 
Maximum Sum Increasing Subsequence of Length K Problem Statement
You are given an array NUMS consisting of N integers and an integer K. Your task is to determine the maximum sum of an increasing subsequen...read more
Ans. 
Find the maximum sum of an increasing subsequence of length K in an array.
• Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences of different lengths.

• For each element, check all previous elements to find the increasing subsequences and update the maximum sum accordingly.

• Return the maximum sum of the increasing subsequence of length K.

• Example: For input [1,...read more
Answered by AI
Add your answer
Q2. 
First Unique Character in a String Problem Statement
Given a string STR consisting of lowercase English letters, identify the first non-repeating character in the string and return it. If no such characte...read more
Ans. 
Identify the first non-repeating character in a given string and return it, or '#' if none exists.
• Iterate through the string to count the frequency of each character

• Iterate through the string again to find the first character with frequency 1

• Return the first non-repeating character or '#' if none exists
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round consisted of questions from DS/Algo , OOPS and Operating Systems primarily usage of some basic UNIX commands .

Q1. 
Implement Atoi Function
You have a string 'STR' of length 'N'. Your task is to implement the atoi function, which converts the string into an integer. If the string does not contain any numbers, the funct...read more
Ans. 
Implement a function to convert a string to an integer, ignoring non-numeric characters and considering negative numbers.
• Iterate through the characters of the string and check if they are numeric.

• Handle negative numbers by checking the first character of the string.

• Ignore non-numeric characters while converting the string to an integer.

• Return 0 if there are no numbers in the string.

• Ensure the resulting number is within
Answered by AI
Add your answer
Q2. Can you explain run time polymorphism in C++?
Ans. 
Run time polymorphism in C++ allows objects of different classes to be treated as objects of a common parent class.
• Run time polymorphism is achieved through virtual functions and function overriding.

• It allows a function to behave differently based on the object it is called on.

• Example: Using a base class pointer to call a virtual function that is overridden in a derived class.
Answered by AI
Add your answer
Q3. What is a friend function in C++?
Ans. 
A friend function in C++ is a function that is not a member of a class but has access to the private and protected members of the class.
• Friend functions are declared inside a class with the keyword 'friend'.

• They can access private and protected members of the class they are friends with.

• Friend functions are not member functions of the class.

• Example: friend void displayDetails(Student);
Answered by AI
Add your answer
Q4. Can you explain any 5 essential UNIX commands?
Ans. 
Essential UNIX commands include ls, cd, pwd, mkdir, and rm.
• ls - list directory contents

• cd - change directory

• pwd - print working directory

• mkdir - make directory

• rm - remove files or directories
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why do you want to work at Amdocs?
Add your answer