Amdocs ETL Developer Interview Questions and Answers

Q1. About project details
Add your answer
Q2. Explain use of lookup
Ans. 
Lookup is used in ETL processes to search for a specific value in a dataset and retrieve related information.
• Lookup is used to search for a specific value in a dataset

• It retrieves related information based on the search criteria

• Lookup can be used to join data from different sources based on a common key
Answered by AI
View 1 more answer
Q3. Type of lookup transformation
Ans. 
There are three types of lookup transformations: Connected, Unconnected, and Cached.
• Connected lookup transformation is used to look up data from a relational table or view.

• Unconnected lookup transformation is used to look up data from a flat file or external source.

• Cached lookup transformation stores the lookup data in memory for faster access.
Answered by AI
View 1 more answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Find All Anagrams Problem Statement
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
Explanation:
An anagram of a string is another string ...read more
Ans. 
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
• Create a frequency map of characters in PTR.

• Use sliding window technique to check anagrams in STR.

• Return the starting indices of anagrams found.
Answered by AI
Add your answer
Q2. 
Subset Sum Problem Statement
Given an array of integers, find the sum of all subsets in non-decreasing order of the given array.
Example:
Input:
N = 3, array = [1, 2]
Output:
[0, 1, 2, 3]
Explanatio...read more
Ans. 
Find sum of all subsets in non-decreasing order of given array.
• Use recursion to generate all subsets of the array

• Calculate sum of each subset and store in a list

• Sort the list in non-decreasing order to get the final result
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

First he asked me to tell about myself, then he asked me some OOPS Concepts,difference in shallow copy and deep copy,
asked me to write a code for boundary traversal of binary tree.

Q1. 
Boundary Traversal of Binary Tree Problem Statement
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...read more
Ans. 
Boundary traversal of a binary tree to find left boundary, right boundary, and leaf nodes in an anti-clockwise direction.
• Perform a pre-order traversal to get the left boundary nodes

• Perform an in-order traversal to get the leaf nodes

• Perform a post-order traversal to get the right boundary nodes

• Combine the results to get the boundary nodes in anti-clockwise direction
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The second tech interview lasted for about an hour and half. First he asked me to tell about myself. Then he asked me how my first interview was. He then asked me where should I start, data structures, databases, to which I replied anywhere.
He started asking questions about C. He asked difference between call by pointer and call by reference. Whether a function can be defined as
void function(int &x, int &y);
Then he asked what is volatile data type in C. Then about the static data class.
He also asked me to write a program to find length of a string.
Then he asked about how functions in C work. How does the program know where to go back after a function is over, etc.
He then asked me if I knew C++, I said no. So he continued to ask a few questions on data structures.
He then asked about the ACID properties which a good database must have. He asked how are transactions managed by a database, what are commits, how, in case of a power failure, data is reverted back, etc.
Then he asked me whether I like to work individually or in a team. I said in a team. He then gave me scenario where I have to decide between a project I am working on, whose deadline is approaching, and helping a friend working on another project whose deadline is also approaching, and asked me what would I do in such a case.

Q1. 
Find the Middle of a Linked List
This problem requires you to return a pointer that references the middle node of a singly linked list.
Explanation:
If the number of elements in the linked list is odd, ...read more
Ans. 
Return the middle node of a singly linked list, considering odd and even number of elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• Return the node pointed to by the slow pointer as the middle node
Answered by AI
Add your answer

Numerical and logical aptitude test

There are 5 rounds on datastructure and algorithm

Round duration - 1 hour
Round difficulty - Medium

Q1. 
First Missing Positive Problem Statement
You are provided with an integer array ARR of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...read more
Ans. 
Find the smallest positive integer missing from an array of integers.
• Iterate through the array and mark positive integers as visited by changing the sign of the corresponding index.

• After marking all positive integers, iterate again to find the first positive integer with a positive value.

• Return the index of the first positive integer found plus one as the answer.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was in the late afternoon. I was vey nervous, but the interviewer was very friendly. I managed to solve the questions early, so we discussed general things about the company and its culture.

Q1. 
Rooms and Keys Problem Statement
Given some information about rooms in a military camp, where rooms are numbered from 0 to 'N-1'. Each room may contain keys to some other rooms. You can only visit a room ...read more
Ans. 
Determine if all rooms can be visited starting from room 0 with given keys information.
• Use depth-first search (DFS) to traverse through rooms and keys.

• Keep track of visited rooms to avoid infinite loops.

• Check if all rooms have been visited at the end.
Answered by AI
Add your answer
Q2. 
Detect the First Node of the Loop in a Singly Linked List
You are provided with a singly linked list that may contain a cycle. Your task is to return the node where the cycle begins, if such a cycle exist...read more
Ans. 
To detect the first node of the loop in a singly linked list, we can use Floyd's Cycle Detection Algorithm.
• Use Floyd's Cycle Detection Algorithm to find the meeting point of the slow and fast pointers in the linked list.

• Reset one of the pointers to the head of the linked list and move both pointers at the same speed until they meet at the start of the cycle.

• The node where the pointers meet is the first node of the loop...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

The duration of the round was 30 minutes. It was conducted in the morning hours. The interviewer asked me many questions regarding my internship experience and my project. Later we discussed some problem solving.

Round duration - 75 minutes
Round difficulty - Hard

This round was conducted early in the morning. The interviewer was highly experienced and very friendly. He discussed about his life journey and his experience with the company.
Overall the experience was good, getting interviewed by such experienced person

Q1. 
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...read more
Ans. 
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
• Traverse the tree to find the longest path from the start node to a leaf node.

• The time to burn the entire tree is equal to the length of the longest path.

• Simulate the burning process by incrementing the time for each level of the tree.
Answered by AI
Add your answer