i
Amdocs
Filter interviews by
I was interviewed in May 2021.
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 .
You are provided with an array/list ARR
of length N
containing only 0s and 1s. Your goal is to determine the number of non-empty subarrays where the numbe...
Count the number of subarrays where the number of 0s is equal to the number of 1s in a given array of 0s and 1s.
Iterate through the array and keep track of the count of 0s and 1s encountered so far.
Use a hashmap to store the count of 0s and 1s encountered at each index.
For each index, check if the count of 0s and 1s encountered so far are equal. If yes, increment the total count of subarrays.
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
The first lin...
Detect if an array contains a Pythagorean triplet by checking if x^2 + y^2 = z^2.
Iterate through all possible combinations of three numbers in the array.
Check if the sum of squares of any two numbers is equal to the square of the third number.
Return 'yes' if a Pythagorean triplet is found, otherwise return 'no'.
Round duration - 70 Minutes
Round difficulty - Medium
I was asked to solve 3 preety basic DSA questions in this round and discuss their respective time complexities and then we moved onto OOPS where the interviewer asked me some questions related to JAVA as well as C as I had mentioned both of them in my Resume . At the end , I was asked to write a simple SQL query to join two tables . Overall this round was preety intense and I tried to give my best .
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
Check if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.
Remove special characters and spaces from the input string
Convert the string to lowercase
Check if the modified string is a palindrome by comparing characters from start and end
Identify if the provided integer 'N' is a Fibonacci number.
A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...
The task is to determine if a given integer is a Fibonacci number or not.
Iterate through the Fibonacci sequence until the current number exceeds the given integer 'N'.
Check if the given integer 'N' matches any number in the Fibonacci sequence.
If a match is found, output 'YES'; otherwise, output 'NO'.
Given an integer 'N', your task is to print all the prime numbers that lie within the range from 2 to 'N' (inclusive).
Integer N
Prime numbers printe...
Print all prime numbers within the range from 2 to N.
Iterate from 2 to N and check if each number is prime
A prime number is a number greater than 1 that has no positive divisors other than 1 and itself
Use a nested loop to check divisibility by numbers less than the current number
Garbage collector in Java is a built-in mechanism that automatically manages memory by reclaiming unused objects.
Garbage collector runs in the background to identify and remove objects that are no longer needed.
It helps prevent memory leaks and optimize memory usage.
Examples of garbage collectors in Java include Serial, Parallel, CMS, and G1.
A static variable in C is a variable that retains its value between function calls.
Declared using the 'static' keyword
Retains its value throughout the program's execution
Useful for maintaining state across function calls
Singleton class in Java ensures that a class has only one instance and provides a global point of access to it.
Singleton class is implemented by making the constructor private to prevent instantiation from outside the class.
It provides a static method to access the single instance of the class.
The instance is created only once and reused throughout the application.
Example: Logger class in Java can be implemented as a S...
Write a SQL query to join two tables on a common attribute and select matching records.
Use the JOIN keyword to combine tables A and B on the common attribute ID
Specify the common attribute in the ON clause of the JOIN
Select the desired columns (ID_NAME) from the joined tables
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions like my interests, weaknesses, strengths, family background, are you willing to relocate or travel , why Amdocs, CEO of Amdocs etc.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
Moderate level questions based on arrays and strings
I applied via campus placement at Oriental Institute of Science and Technology, Bhopal and was interviewed before Sep 2022. There were 5 interview rounds.
Question level were average
Four coding questions in which two is of SQL queries.
Average level
I applied via Approached by Company and was interviewed before Jul 2021. There were 4 interview rounds.
This consists of aptitude,reasoning,coding qiestions,sql queries in hirepro platform
Amdocs interview questions for designations
I applied via campus placement at Centre for Development of Advanced Computing (CDAC) and was interviewed before Jul 2022. There were 4 interview rounds.
Hired from College -
Quantitative, Logical, Verbal Ability and 1 code
Get interview-ready with Top Amdocs Interview Questions
I applied via Campus Placement and was interviewed in Apr 2021. There were 3 interview rounds.
Singleton pattern is a design pattern that restricts the instantiation of a class to one object.
Used when only one instance of a class is needed throughout the application
Provides a global point of access to the instance
Implemented using a private constructor and a static method to return the instance
Example: Database connection, Logger, Configuration settings
Static variable is a variable that retains its value even after the function execution is completed.
Declared with static keyword
Memory is allocated once and shared among all instances of the class or function
Can be accessed without creating an object of the class
Query for deleting data from a database table.
Use the DELETE statement followed by the table name.
Add a WHERE clause to specify the condition for deleting specific rows.
Be careful when deleting data as it cannot be recovered.
Example: DELETE FROM customers WHERE customer_id = 1234;
Five commonly used Linux commands
ls - list directory contents
cd - change directory
mkdir - make directory
rm - remove files or directories
grep - search for a pattern in a file
Program to check if a string is a palindrome or not.
Remove all spaces and convert to lowercase for case-insensitive comparison.
Compare the first and last characters, then move towards the center until all characters have been compared.
If all characters match, the string is a palindrome.
If any characters do not match, the string is not a palindrome.
Time complexity refers to the amount of time taken by an algorithm to run as the input size increases.
It measures the efficiency of an algorithm.
It is usually expressed in Big O notation.
An algorithm with a lower time complexity is more efficient than one with a higher time complexity.
Garbage collection in Java is an automatic memory management process.
It frees up memory by removing objects that are no longer in use.
It is performed by the JVM in the background.
It helps prevent memory leaks and improves performance.
There are different types of garbage collectors in Java, such as Serial, Parallel, CMS, and G1.
Example: int[] arr = new int[1000]; arr = null; // Garbage collector will remove the array fr
I applied via Approached by Company and was interviewed before Jul 2022. There were 3 interview rounds.
General apti questions of train, mass velocity, family relations, logical reasoning, quantitative analysis etc
I applied via campus placement at K K Wagh College of Engineering, Nashik and was interviewed before Dec 2021. There were 4 interview rounds.
It Includes Logically, quantitative, english, programming questions, 2 coding questions for that we need to write code from scratch
I applied via Campus Placement and was interviewed before Mar 2022. There were 3 interview rounds.
Basic Aptitude test which includes quantitative verbal and logical reasoning
2 questions on programming language and 2 on sql
I applied via campus placement at Pune Institute of Computer Technology, Pune and was interviewed before Aug 2020. There were 4 interview rounds.
Convert string to integer without using inbuilt function
Iterate through each character and multiply by 10 and add the integer value of the character
Use ASCII values to convert character to integer
Handle negative numbers separately
Data structures are used to organize and store data in a computer program.
Arrays - used to store a collection of elements of the same data type
Linked Lists - used to store a collection of elements where each element points to the next element
Stacks - used to store a collection of elements where the last element added is the first element removed
Queues - used to store a collection of elements where the first element add...
Recursion is a process in which a function calls itself repeatedly until a base condition is met.
Recursion involves breaking down a problem into smaller subproblems and solving them recursively.
It uses a stack to keep track of function calls and their parameters.
Examples include factorial, Fibonacci sequence, and binary search.
Compiler executes recursion by allocating memory for each function call and storing the retur...
The data structure used in recursion is a stack.
Recursion uses a stack data structure to keep track of function calls.
Each time a function is called, its parameters and local variables are pushed onto the stack.
When the function returns, the values are popped off the stack.
This allows the program to keep track of where it is in the recursive process.
Examples of recursive algorithms that use a stack include depth-first
A program demonstrating recursion using factorial function.
Recursion is a technique where a function calls itself.
Factorial function is a classic example of recursion.
Each recursive call creates a new stack frame.
The base case is when the input is 1, and the function returns 1.
The final result is the product of all the recursive calls.
Example: factorial(5) = 5 * factorial(4) = 5 * 4 * factorial(3) = ... = 5 * 4 * 3 * 2
Addition and Deletion of a node in binary tree
For addition, traverse the tree to find the appropriate position and add the new node as a leaf
For deletion, find the node to be deleted and replace it with its successor or predecessor
In case of deletion, if the node has two children, find the inorder successor and replace it with the node to be deleted
Top trending discussions
Some of the top questions asked at the Amdocs Associate Software Engineer interview -
The duration of Amdocs Associate Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 35 interviews
4 Interview rounds
based on 119 reviews
Rating in categories
Software Developer
8.2k
salaries
| ₹5 L/yr - ₹17 L/yr |
Software Engineer
1.9k
salaries
| ₹4 L/yr - ₹16 L/yr |
Softwaretest Engineer
1.7k
salaries
| ₹3.8 L/yr - ₹14 L/yr |
Functional Test Engineer
1.2k
salaries
| ₹4 L/yr - ₹12.1 L/yr |
Associate Software Engineer
1k
salaries
| ₹3 L/yr - ₹12 L/yr |
TCS
IBM
Infosys
Wipro