coding skills (ISCP 02) Tuesday slot1 (9am - 11:00am) CSE A & C

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

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

How many variables are required to implement queue using arrays?

• 1
• 2
• 3
• 4

Which of the data structure follows FIFO principle?

• Stack
• Queue
• Linked list
• Tree

If REAR, FRONT are the queue variables, then identify correct statement while deleting a value

• FRONT=FRONT+1
• REAR=REAR+1
• REAR=REAR-1
• FRONT=FRONT-1

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

• ABCD
• DCBA
• DCAB
• ABDC

Complexity of linear search if the element to be searched is at index 0 in the array

• O(n)
• O(n*n)
• O(1)
• O(nlogn)

In the following Code Snippet, if you apply this linear search code to an array of 15 elements and the target is found at the 5th position, what value will be returned? int linearSearch(int arr[], int n, int target) { for (int i = 0; i < n; i++) { if (arr[i] == target) return i; } return -1; }

• 0
• 1
• 4
• 5

If elements are inserted in the order 10,20,30,40 then which element is deleted first?

• 10
• 20
• 30
• 40

int binarySearch(int arr[], int n, int target) { int left = 0; int right = n - 1; int iterations = 0; while (left <= right) { int mid = left + (right - left) / 2; iterations++; if (arr[mid] == target) return iterations; else if (arr[mid] < target) left = mid; else right = mid; } return -1; } In Code Snippet, if you apply this binary search code to a sorted array with 16 elements and the target is found, how many iterations will be made?

• 4
• 5
• 3
• 2

What is the best case complexity of quick sort?

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