2 answers
1
5 answers
3
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a sw...
0 answers
4
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
2 answers
7
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. ...
2 answers
8
Question no P23-12
0 answers
10
1 answer
11
The minimum size of the ROM which maintains truth table of square of 3 bit numbers is __________ (in bits)
2 answers
12
consider a disk pack with the following:16 surfaces128 tracks/surface256 sectors/track512 bytes/sectors(consider that each surface has 1 read/write head)The disk is rotat...
0 answers
14
design a counter with the following binary sequence:0,4,2,1,6 and repeat use JK flip-flop
1 answer
16
1 answer
17
if (A,B,C)=AB+AC+BC thenF((A’,B’,C’).F(A’,B,C’).F(A,B’.C’))=?
1 answer
18
1142 – 921 = 821, then 1674 – 788 = ?Answer is EEC by hexadecimal subtraction
1 answer
19
If 453 + 746 = 1421 then 346 + 521 = ?
0 answers
20
void fun(int,int*);int main(){int=-5,j=-2;fun(i,&j);print f(“i=%d j=%d\n”,i,j);return 0;}void fun(int i,int *j){i=i*i;*j=*j * *j;}
1 answer
21
int main();{int a,*b, c, *d, e;a=10;b=&a;c=&b;d=&c;e=&d;print f(“a=%d b=%u c=%u d=%u e=%u e=%u\n”, a,b,c,d,e);print f(“ %d %d %d \n”,a,a+*b, c+ *d+, e);return 0...
1 answer
25
Consider the following counter designed using three flip-flops (D, T and JK). The initial state of the counter is Q2=1, Q1=1and Q0=1What is the state of the counter after...
1 answer
27
let M be a DFA {a,b} with exactly 2 state .Suppose further that M accepts a finite number n of distinct words .what is the maximum value of n?a)1b)2c)3d)4e)there not fixe...