end

Question 1

Which sorting algorithm uses the divide-and-conquer approach?

Answer 1

c.
Quick Sort

Question 2

In a graph with multiple connected components, how many times will BFS be called?

Answer 2

d.
The number of connected components

Question 3

when an algorithm generates the same address for different identifiers it is known as

Answer 3

a.
Collisions

Question 4

What data structure is used in DFS to keep track of the visited nodes?

Answer 4

d.
Stack

Question 5

The capacity and load factor are parameters that affect the Hash Table performance

Answer 5

True

Question 6

Which of the following techniques can be used to search an element in an unsorted array?

Answer 6

b.
Iterative linear search

Question 7

What is the worst case runtime of linear search algorithm?

Answer 7

b.
O(n)

Question 8

Each class provides its own implementation of hashCode()

Answer 8

False

Question 9

Which of the following sorting algorithm has best case time complexity of O(n^2)?

Answer 9

b.
selection sort

Question 10

What is the minimum number of edges required for a connected undirected graph with n vertices?

Answer 10

c.
n-1

Question 11

In a weighted graph, which of the following algorithms can be used to find the shortest path from a source node to all other nodes?

Answer 11

d.
Dijkstra’s algorithm

Question 12

Which of the following sorting algorithms not has a worst-case time complexity of O(n^2)?

Answer 12

a.
Merge Sort

Question 13

Object class contains hashCode() method with its default implementation

Answer 13

True

Question 14

Selected pivot point can be only first element in quick sort.

Answer 14

False

Question 15

Which of the following methods can be used to search an element in a linked list?

Answer 15

d.
Iterative linear search

Question 16

The following method is an implementation of ___________.

public static void XXX(int[] arr, int left, int right) {

if (left >= right) {

return;

}

int pivot = YYY(arr, left, right);

XXX(arr, left, pivot - 1);

XXX(arr, pivot + 1, right);

}

public static int YYY(int[] arr, int left, int right) {

int pivot = arr[right];

int i = left - 1;

for (int j = left; j < right; j++) {

if (arr[j] < pivot) {

  i++;

  int temp = arr[i];

  arr[i] = arr[j];

  arr[j] = temp;

}

}

int temp = arr[i + 1];

arr[i + 1] = arr[right];

arr[right] = temp;

return i + 1;

}

Answer 16

a.
Quick sort

Question 17

Binary Search can be categorized into which of the following?

Answer 17

c.
Divide and conquer

Question 18

Which of the following sorting algorithms has a best-case time complexity of O(n)?

Answer 18

a.
Merge Sort

Question 19

Which of the following sorting algorithms requires extra memory space to sort an array?

Answer 19

c.
Merge Sort

Question 20

Which of the following sorting algorithms has a time complexity of O(n*log(n)) in the average case?

Answer 20

d.
Merge Sort

Question 21

Binary search algorithm is also called Bisection search method.

Answer 21

True

Question 22

What is a heap in computer science?

Answer 22

d.
A data structure for efficiently finding the minimum or maximum element.