A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys. I. 81, 537, 102, 439, 285,… Read More

For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim\’s algorithm to construct a Minimum… Read More

Consider a selection of the form σA≤100(r), where r is a relation with 1000 tuples. Assume that the attribute values for A among the tuples… Read More

Consider the following C program:    #include             #define EOF -1            void push (int); /* push the argument on the stack */            int pop  (void); /* pop… Read More

The function f is defined as follows:  C int f (int n) {     if (n <= 1) return 1;     else if (n % 2  == … Read More

Consider n jobs J1, J2,……Jn such that job Ji has execution time ti and a non-negative integer weight wi. The weighted mean completion time of… Read More

An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0.… Read More

For each of the four processes P1, P2, P3 and P4. The total size in kilobytes (KB) and the number of segments are given below.… Read More