What is the outcome of the following code snippet? int func(int arr[], int n, int target) { int left = 0; int right = n - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) left = mid + 1; else right = mid - 1; } return -1; }

• Searching for a target element in a sorted array.
• Reversing the order of elements in an array.
• Sorting an array in ascending order.
• Calculating the sum of elements in an array.

What is the best case complexity of insertion sort?

• O(n**2)
• O(n)
• O(nlogn)
• O(n**3)

How many variables are required to implement stack using arrays?

• 1
• 2
• 3
• 4

Stack can be implemented which of the following concepts?

• Array
• Linked list
• Both a and b
• Trees

The process of deleting an element into stack is called?

• pop operation
• push operation
• underflow operation
• enqueue operation

The postfix form of A*B+C/D is?

• *AB/CD+
• AB*CD/+
• A*BC+/D
• ABCD+/*

The process of deleting an element from the queue is called?

• pop operation
• push operation
• enqueue operation
• dequeue operation

Which of the data structure follows FIFO principle?

• Stack
• Queue
• Linked list
• Tree

Binary search algorithm can be applicable on …

• sorted linked list
• unsorted linked list
• sorted linear array
• pointer array

Is Merge sort algorithm inplace sorting algorithm?

• yes
• no
• can't say
• All of the above