0 answers
2
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBS...
1 answer
3
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBS...
1 answer
5
$\int_{0}^{1}\frac{x^{\alpha }-1}{logx}dx$ where $\alpha>0$
0 answers
6
Option (a) Best fit (b) Next fit (c) First fit
3 answers
8
Perform the following operation for the binary equivalent of the decimal numbers $(-14)_{10}+(-15)_{10}$. The solution in 8 bit representation is1110001100011101100111011...
1 answer
11
A is a 2D-array with the range [-5....5,3......13] of elements.The starting location is 100. each element accupies 2 memeory cells.Calculate the location of A[0][8] using...
1 answer
12
Using RSA key crypto system with a = 1, b = 2 etc; value for encryption if prime value are p = 7 and q = 11, the legal value for secret key is .a)69b)49c)49d)119
2 answers
13
Which of following risk may arise when same key is used to encrypt direction of communication channel,that are not present if we use different key in both directions ?A. ...