Question 3
In a B+tree the requirement of at least half full (50%) node occupancy is relaxed for which are of the following case?
Question 5
Consider the following C-Program.
#include <stdio.h> int main() { int a = 6; int b = 0; while (a < 10) { a = a/12 + 1; a+ = b; } printf(“%d”, a); return 0; }
Which one of the following statements is correct?
Question 8
Given an integer array of size N, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is ________
Question 9
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C and D is
Question 10
Which of the following fields is/are modified in the IP header of a packet going out of a network address translation (NAT) device from an internal network to an external network?
There are 58 questions to complete.