Given the following table:
| ENO | SALARY |
|---|---|
| A101 | 4000 |
| B109 | NULL |
| C508 | 6000 |
| A305 | 2000 |
State the output of the following query:
SELECT COUNT(SALARY) FROM EMPLOYEE;
| List-I (Aggregate function) | List-II (Description) |
|---|---|
(A) count(marks) | (III) Count all non null values of marks column |
(B) count() | (I) Count all rows |
(C) avg(marks) | (II) Finding average of non null values of marks |
(D) sum(marks) | (IV) Finding sum of all marks |
Given a list numList of n elements and key value K, arrange the following steps for finding the position of the key K in the numList using the binary search algorithm i.e. BinarySearch(numList, key).
mid = (first + last) // 2first = 0, last = n - 1first <= last REPEATnumList[mid] = key, numList[mid] > key, THEN last = mid - 1first = mid + 1