i
Amdocs
Filter interviews by
I was interviewed before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Yes consist of two code and questions MCQ of ds ,algo,Linz,shell,English and DBMS
Test happens with your webcam access.
Calculate the Nth term in the Fibonacci sequence using the formula: F(n) = F(n-1) + F(n-2)
where F(1) = F(2) = 1
.
Given a number N, determine the Nth Fibonacci number.
O(N), where ‘N’ is the given number.
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:O(2^N), where ‘N’ i...
Round duration - 40 minutes
Round difficulty - Hard
Late night around at 8 pm
Environmental is positive.
Interviewer made me feel positive
Ninja is tasked with implementing a priority queue using the Heap data structure. Since Ninja is busy with tournament preparations, your help is requested to complete this ta...
Round duration - 10 Minutes
Round difficulty - Easy
Morning time
Positive environment
Nice interviewer
Tip 1 : practice on subject in which you are strong enough and unbeatable
Tip 2 : Always go through previous interview experiences on internet
Tip 3 : follow continuety
Tip 1 : mention only you strong topics ,don't include anything you don't know about
Tip 2 : always make your resume one pager
I applied via LinkedIn and was interviewed before Sep 2020. There were 4 interview rounds.
I applied via campus placement at Punjab Engineering College (PEC) and was interviewed before Jun 2020. There were 4 interview rounds.
Amdocs interview questions for designations
I applied via Campus Placement and was interviewed before Sep 2020. There were 3 interview rounds.
Get interview-ready with Top Amdocs Interview Questions
I applied via campus placement at Birla Institute of Technology (BIT), Ranchi and was interviewed before Nov 2019. There were 6 interview rounds.
I was interviewed before Jan 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 .
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using depth-first search (DFS) and keep track of the current path and its sum.
When reaching a leaf node, check if the sum equals 'K' and add the path to the result.
Continue DFS traversal for both left and right children, passing updated path and sum.
Return the list of paths that sum up to 'K'.
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DSA round where I was asked to solve 1 question and also code it in a production ready manner . I was also asked 2 puzzles in this round to check my problem solving skills . This round ended with some basic concepts from DBMS and I was also asked some queries related to SQL .
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...
Reverse a given stack of integers using recursion without using extra space or loop constructs.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order using recursion.
Base case of recursion should be when the original stack is empty.
Race horses in groups of 5, then race the winners to determine the top 3 fastest horses.
Divide the 25 horses into 5 groups of 5 horses each.
Race the horses in each group to determine the fastest horse in each group.
Race the winners from each group to determine the top 3 fastest horses.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Denormalization is the opposite process, adding redundancy to improve read performance.
Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy.
Denormalization involves combining tables to reduce the number of joins needed for queries, improv...
Primary key uniquely identifies a record in a table, while unique key ensures no duplicate values in a column.
Primary key is used to uniquely identify each record in a table
Primary key does not allow NULL values
Unique key ensures that all values in a column are unique
Unique key allows NULL values, except for the column with unique constraint
A table can have only one primary key, but multiple unique keys
Left Outer Join includes all records from the left table and matching records from the right table. Right Outer Join includes all records from the right table and matching records from the left table.
Left Outer Join returns all records from the left table and the matched records from the right table. Unmatched records from the right table will have NULL values.
Right Outer Join returns all records from the right table a...
To find the second highest salary in a table, you can use a SQL query with the ORDER BY and LIMIT clauses.
Use a SQL query to select the distinct salaries in descending order: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC
Use the LIMIT clause to retrieve the second row: LIMIT 1,1
Combine both queries to find the second highest salary: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC LIMIT 1,1
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, 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 have been actively involved in various extra curricular activities such as volunteering, sports, and leadership roles.
Volunteered at local animal shelter every weekend
Captain of the soccer team in high school
Organized charity events for underprivileged children
A friend function is a non-member function that has access to the private and protected members of a class.
Declared inside the class but defined outside the class scope
Can access private and protected members of the class
Not a member of the class but has access to its private members
Used to allow external functions to access and modify private data of a class
Can be declared as a friend in another class
atoi function converts a string to an integer in C.
The function takes a string as input and returns an integer.
Leading white spaces are ignored.
If the string contains non-numeric characters, the function stops conversion and returns the converted value.
The function returns 0 if the input string is not a valid integer.
Example: atoi('123') returns 123.
A program to print star pattern
Use nested loops to print the pattern
The outer loop controls the number of rows
The inner loop controls the number of stars to be printed in each row
Use print() or println() function to print the stars
Run time polymorphism is the ability of a program to determine the object type at runtime and call the appropriate method.
It is achieved through virtual functions and dynamic binding.
Allows for more flexible and extensible code.
Example: a base class Animal with virtual function makeSound() and derived classes Dog and Cat that override makeSound().
At runtime, if an Animal pointer points to a Dog object, calling makeSoun
Right outer join is a type of join operation that returns all the rows from the right table and the matching rows from the left table.
Right outer join is denoted by the RIGHT JOIN keyword in SQL.
It is used to combine rows from two tables based on a related column.
In the result set, unmatched rows from the right table will have NULL values for the columns of the left table.
A real-world scenario for using a right outer j...
Refrential integrity ensures that relationships between tables in a database remain consistent.
It is a database concept that ensures that foreign key values in one table match the primary key values in another table.
It prevents orphaned records in a database.
It maintains data consistency and accuracy.
For example, if a customer record is deleted, all related orders for that customer should also be deleted.
It is enforced...
Primary key uniquely identifies a record in a table, while Unique key ensures uniqueness of a column.
Primary key can't have null values, Unique key can have one null value
A table can have only one Primary key, but multiple Unique keys
Primary key is automatically indexed, Unique key is not necessarily indexed
Triggers are database objects that are automatically executed in response to certain events.
Triggers can be used to enforce business rules, audit changes, or replicate data.
There are two types of triggers: DML triggers and DDL triggers.
DML triggers are fired in response to DML statements (INSERT, UPDATE, DELETE).
DDL triggers are fired in response to DDL statements (CREATE, ALTER, DROP).
Swapping two character variables without using third
Use XOR operator to swap two variables without using third variable
Assign the XOR of both variables to the first variable
Assign the XOR of the first variable and second variable to the second variable
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