Amdocs Technical Specialist Interview Questions and Answers

Traverse through a matrix of uppercase english alphabets to find a given word. you are allowed to make up to k jumps, and same position can be repeated too.

Q1. Compression of 0-1 matrix of particular size.
Ans. 
Compression of 0-1 matrix involves reducing the size of the matrix by storing only the necessary information.
• Use run-length encoding to compress the matrix by storing consecutive repeated values as a single value and count.

• Identify patterns in the matrix that can be represented more efficiently.

• Consider using sparse matrix representation if the matrix has a lot of zeros.

• Implement efficient algorithms to compress and de...read more
Answered by AI
Add your answer

Q1. Machine learning questions
Add your answer
Q2. Decision trees, random forest
Add your answer

Q1. ML Ops related questions
Add your answer

Q1. Tell me about yourself. Why do we hire u
Add your answer

Q1. Lots of academic questions besides excel related questions
Add your answer

Q1. Very difficult round to crack, as there were many academic questions related to accounting and financial management questions.
Add your answer

Q1. Implement custom reduce function in js
Ans. 
Custom reduce function in JavaScript
• Create a function that takes an array, a callback function, and an initial value as parameters

• Iterate through the array and apply the callback function to each element, updating the accumulator

• Return the final accumulator value
Answered by AI
Add your answer
Q2. Box sizing in css
Ans. 
Box sizing in CSS determines how the total width and height of an element is calculated.
• Box-sizing property can have values of content-box (default) or border-box

• content-box includes only the content, border, and padding in the width and height calculations

• border-box includes the content, padding, and border in the width and height calculations
Answered by AI
Add your answer

Q1. Design book my show
Add your answer
Q2. Implement Binary First Search
Ans. 
Binary First Search is a search algorithm that explores the nodes in a binary tree in a level-order traversal.
• Start at the root node and add it to a queue.

• While the queue is not empty, dequeue a node and visit it. Then enqueue its children.

• Repeat until all nodes have been visited.
Answered by AI
Add your answer

Q1. .net full stack
Add your answer

Q1. Why do you want to change
Add your answer