Technical Assessment

What sorting algorithm is this?

• Bubble Sort

• Insertion Sort

• Selection Sort

• None of the above

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?
 
4    8    3    9    2    6 
2    8    3    9    4    6
2    3    8    9    4    6

• Bubble Sort
• Selection Sort
• Insertion Sort

Predict the output of following program?

#include <stdio.h>

//Assume base address of “TechnoBoom” to be 1000

int main()

{

printf(6+ “TechnoBoom”);

return 0;

}

• TechnoBoom

• 1006

• Boom

• Compile-time error

Predict the output of the following code

//filename Test.java

class Test{

public static void main(String[] args){

for(int i=0;1;i++){

System.out.print("TechnoBoom");

break;

}

}

}

• TechnoBoom

• Compile time error

• T

• None of these

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

The time complexity of heap sort in worst case is

• a) O(logn)

• b) O(n)

• c) O(nlogn)

• d) O(n²)

What sorting algorithm is this?

• Merge Sort

• Heap Sort

• Quicksort

• Bubble Sort

What sorting algorithm is this?

• Insertion Sort

• Selection Sort

• Quicksort

• Bubble Sort

Which sorting algorithm is this?

• Quicksort

• Divide Sort

• Merge Sort

• Match Sort

What is the maximum number of comparisons if there are 5 elements to sort?

• 10
• 2
• 5
• 20