A heap allows a very efficient implementation of a -
View Solution
Q3
A software package to implement a data base is?
View Solution
Q4
Consider the following implementations for rotating an array A[1, ....n] of size n by K positions , where 1 < = K < = n . Note that the procedure reverse (A, i, j) reverses the order of elements in A between positions i and j in A (both inclusive )
which of the above implementation(s) work correctly for all inputs ?
Implementation I:
reverser(A, 1, K);
reverse(A, 1, n) ;
reverse (A, k+1, n) ;
Implementation II:
reverser(a, K+1, n);
reverse(a, 1, K) ;
reverse (a, 1, n) ;
Implementation III:
reverser(a, 1, K);
reverse(a, K+1, n) ;
reverse (a, 1, n) ;
View Solution
Q5
A 4×1 MUX is used to implement a 3-input Boolean function as show in figure. The Boolean function P( A, B, C) implemented is