Amdocs Associate Software Engineer Interview Questions and Answers

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

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

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

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);

Calculate the Nth Fibonacci number using the given formula and constraints.

• Implement a function to calculate the Nth Fibonacci number using the formula F(n) = F(n-1) + F(n-2) with base cases F(1) = F(2) = 1.

• Use dynamic programming or recursion to efficiently compute the Fibonacci number for large N values.

• Ensure the input N is within the constraints 1 <= N <= 10000.

• Example: For N = 5, the output should be 5 ...read more

Implement a priority queue using Heap data structure with functions like push, pop, getMaxElement, and isEmpty.

• Implement push() function to insert element into the priority queue.

• Implement pop() function to delete the largest element from the queue.

• Implement getMaxElement() function to return the largest element.

• Implement isEmpty() function to check if the queue is empty.