GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2014 · Set-2
Programming & Data StructuresProgrammingmediumMCQ1 mark
Consider the C function given below. Assume that the array listA contains n(>0) elements, sorted in ascending order int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if (x <= listA[k]) j = k-1; if (listA[k] <= x) i = k+1; } while (i <= j); if (listA[k] == x) return(k); else return -1; } Which one of the following statements about the function ProcessArray is CORRECT?
Save your progress

Related Programming & Data Structures PYQs

GATE 2014 · Set-3

Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are

GATE 2014 · Set-3

The height of a tree is the length of the longest root- to-leaf path in it. The maximum and minimum number of nodes in a binary tr…

GATE 2014 · Set-2

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the…

GATE 2014 · Set-3

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3…

GATE 2014

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below…

GATE 2014 · session-2

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is:10, 8, 5, 3,…