Amdocs Associate Software Engineer Interview Questions, Process, and Tips

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...read more

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...read more

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