0 votes
0 answers
1
0 votes
1 answer
2
suppose that a message has been encrypted using DES in chipertext block chaining mode. One bit of chipertext in block Ci is accedntally transformed from 0to 1during trans...
0 votes
2 answers
5
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L hasa)2b)5c)8d)3 explain!!
0 votes
1 answer
6
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code?explain.
0 votes
0 answers
7
The number of binary semaphores required to implement readers-writers code in busy waiting mode is - answer given as 1.why 1 and why not 2?
0 votes
2 answers
9
The running time of an algorithm is given by T(n)=T(n-1)+T(n-2)-T(n-3), ifn>3 =n, otherwiseThe order of this algorithm isa)nb)log nc)n^nd)n^2 explain !
0 votes
0 answers
10
the output of the following problem?main(){ int a=1,b=2,c=4; printf("%d",a+=(a+=4,10,a));} Explain?
1 votes
1 answer
11
consider the two declarationsvoid *voidPtr;char *charPtr;which of the following assignments are syntactically correct?(a)charPtr= voidPtr(b)*charPtr=voidPtr(c)*voidPtr=*c...