Interview Questions and Answers for 'Amd' | Search Interview Question - javasearch.buggybread.com
Javasearch.buggybread.com

Search Interview Questions


 More than 3000 questions in repository.
 There are more than 900 unanswered questions.
Click here and help us by providing the answer.
 Have a video suggestion.
Click Correct / Improve and please let us know.
Label / Company      Label / Company / Text

   



Interview Questions and Answers - Order By Newest

   
 Q31. Write a program to rotate a matrix.Core Java
Ans. public class Matrix {

   public static void main(String[] args) {
      int[][] matrix = {
            {1, 2, 3},
            {4, 5, 6},
            {7, 8, 9}
      };
      Matrix.rotateMatrix(matrix);
      for (int i = 0; i < matrix.length; i ){
         for (int j = 0; j < matrix.length; j ){
            System.out.print(matrix[i][j] " ");
         }
         System.out.println();
      }
   }

   public static void rotateMatrix(int[][] matrix){
      int row = matrix.length;
      //first find the transpose of the matrix.
      for (int i = 0; i < row; i ){
         for (int j = i; j < row; j ){
            int temp = matrix[i][j];
            matrix[i][j] = matrix[j][i];
            matrix[j][i] = temp;
         }
      }
      //reverse each row
      for (int i = 0; i< row; i ){
         for(int j = 0; j< row/2; j ){
            int temp = matrix[i][j];
            matrix[i][j] = matrix[i][row - 1 - j];
            matrix[i][row - 1 - j] = temp;
         }
      }

   }

}

 Help us improve. Please let us know the company, where you were asked this question :   

   Like         Discuss         Correct / Improve          Asked in 1 Companies


 Q32. Given 3 arrays - A, B and C, Write all elements from C that are a sum of 1 element from A and 1 from B.

For example -

A -[1,2,4,6]
B-[3,9]
C-[2,4,5,6,7,9,10,12,15]

Output - 4,5,7,9,15
Ans. public class MyClass {

static boolean binarySearch(int [] c, int start, int end, int value) {
while (start <= end) {
int mid = (start end) / 2;
if (c[mid] == value) {
return true;
}
if (c[mid] > value) {
end = mid - 1;
} else {
start = mid 1;
}
}
return false;
}

public static void main(String args[]) {
int [] a = new int[] {1,2,4,6};
int [] b = new int[] {3,9};
int [] c = new int[] {2,4,5,6,7,9,10,12,15};

for (int i = 0; i < a.length; i ) {
for(int j = 0; j < b.length; j ) {
int value = a[i] b[j];
boolean find = binarySearch(c, 0, c.length - 1, value);
if (find) {
System.out.print(value " ");
}
}
}
}
}

 Help us improve. Please let us know the company, where you were asked this question :   

   Like         Discuss         Correct / Improve          Asked in 1 Companies


 Q33. Write an algorithm to shift a linked list n positions.Data Structure
 This question was recently asked at 'Amdocs'.This question is still unanswered. Can you please provide an answer.


 Help us improve. Please let us know the company, where you were asked this question :   

   Like         Discuss         Correct / Improve          Asked in 1 Companies


 Q34. How to sort an ArrayList of objectsData Structure
Ans. Using Collections.sort()

 Help us improve. Please let us know the company, where you were asked this question :   

   Like         Discuss         Correct / Improve          Asked in 1 Companies


 Q35. Can we assign the reference to this variable ?Core Java
Ans. No

 Help us improve. Please let us know the company, where you were asked this question :   

   Like         Discuss         Correct / Improve          Asked in 1 Companies


 Q36. What is the difference betwen Bean and Pojo ?
Ans. https://www.geeksforgeeks.org/pojo-vs-java-beans/

 Help us improve. Please let us know the company, where you were asked this question :   

   Like         Discuss         Correct / Improve          Asked in 1 Companies


previous 30   

Help us and Others Improve. Please let us know the questions asked in any of your previous interview.

Any input from you will be highly appreciated and It will unlock the application for 10 more requests.

Company Name:
Questions Asked: