Answer:
CREATE FUNCTION exam_eligible_students
RETURN NUMBER AS
num_students NUMBER(15);
BEGIN
SELECT COUNT(STUDENT_ID)
INTO num_students
FROM STUDENT_ATTENDANCE
WHERE ELIGIBILITY_FOR_EXAMS = 'Y';
RETURN (num_students);
END;
Explanation:
exam_eligible_students is a made of name for the FUNCTION to be called.
num_students is a made up name for the RETURN to be called. The RETURN name is referenced in the INTO statement and as the name of the the return in the RETURN line in ().
Answer:
Explanation:
Since all of the items in the array would be integers sorting them would not be a problem regardless of the difference in integers. O(n) time would be impossible unless the array is already sorted, otherwise, the best runtime we can hope for would be such a method like the one below with a runtime of O(n^2)
static void sortingMethod(int arr[], int n)
{
int x, y, temp;
boolean swapped;
for (x = 0; x < n - 1; x++)
{
swapped = false;
for (y = 0; y < n - x - 1; y++)
{
if (arr[y] > arr[y + 1])
{
temp = arr[y];
arr[y] = arr[y + 1];
arr[y + 1] = temp;
swapped = true;
}
}
if (swapped == false)
break;
}
}
The answer is B bc obliteration is related to covering the document
