Register
Filter

Questions by air1ankit

1 votes
1 answer
61
Logic gates and switching ckt
1- simply the following logic exp F=AB'+ABC'+ABCD+ABCD' and realize it using NADND GATE only ..
1- simply the following logic exp F=AB'+ABC'+ABCD+ABCD' and realize it using NADND GATE only ..
0 votes
0 answers
62
Multiplexer
What is the use of time devision multiplexing switch ????
What is the use of time devision multiplexing switch ????
0 votes
1 answer
63
digital logic number system
(FE35)base16 XOR(CB15)base16 is equal to ans should be in hexadec...???
(FE35)base16 XOR(CB15)base16 is equal to ans should be in hexadec...???
0 votes
1 answer
64
Number system
Is there any shortcut for this question... Note- (All are in base 16) Que- which are following represent 'E3 base 16' a- (1CE)+(A2) b-(1BC) - (DE) C- (2BC) - (1DE) d- ( 200) - (11D) Note - all are in base 16 Give me also some sort cuts to slove number system
Is there any shortcut for this question... Note- (All are in base 16)Que- which are following represent 'E3 base 16'a- (1CE)+(A2)b-(1BC) - (DE)C- (2BC) - (1DE)d- ( 200) ...
0 votes
0 answers
65
Degital logic
1 votes
0 answers
66
degital logic desigin
excess 3 to bcd converter ??? design
excess 3 to bcd converter ???design
1 votes
0 answers
67
Dynamic programming
Explain longest comman sbsequence , how to direct solve the lcs problems????
Explain longest comman sbsequence , how to direct solve the lcs problems????
1 votes
1 answer
68
Degital logic
Function F1 & F2 are F1(ABCD)- €m ( 1,4,5,8,10,13,15)+d(3,12) F2(ABCD)- €m ( 0,2,3,5,9,10,14,15)+d(6,13) a-. F3= F1+F2 b- F4= F1.F2 c-F5= F1.F2'
Function F1 & F2 are F1(ABCD)- €m ( 1,4,5,8,10,13,15)+d(3,12) F2(ABCD)- €m ( 0,2,3,5,9,10,14,15)+d(6,13)a-. F3= F1+F2b- F4= F1.F2c-F5= F1.F2'
1 votes
0 answers
69
Digital logic
F(x,y,z,)=x'yz+xy'+y'z' G(x,y,z)=x'yz+x'yz'+xy a- both f and g are functionally complex b- only f is functionally complex C- only g is functionally complex d- nither f nor g is functionally complex Please explain also
F(x,y,z,)=x'yz+xy'+y'z'G(x,y,z)=x'yz+x'yz'+xy a- both f and g are functionally complex b- only f is functionally complex C- only g is functionally complex d- nither f nor...
2 votes
3 answers
70
Degital logic
identify how many 2 i/p NOR gate require to realize 1.2 input EX-OR GATE 2. 2 input EX-NOR GATE
identify how many 2 i/p NOR gate require to realize1.2 input EX-OR GATE2. 2 input EX-NOR GATE
1 votes
1 answer
71
Degital
what is the minimum number of digits required to represent 3345(radix 10) in binary ?
what is the minimum number of digits required to represent 3345(radix 10) in binary ?
1 votes
0 answers
72
Digital
5 votes
2 answers
73
Digital logic design
Max how many no. Of function is possible if f(x,y,z)= f(x',y,z') Options a)8 b)16 c)4 d)32
Max how many no. Of function is possible iff(x,y,z)= f(x',y,z') Optionsa)8b)16c)4d)32
1 votes
0 answers
74
Merge sort
Time complexity of inplace merge sort??
Time complexity of inplace merge sort??
6 votes
5 answers
75
Binary search
How to get space complexity of binary search .. I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+ log n B = O(n) ...
How to get space complexity of binary search ..I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+...
0 votes
1 answer
76
Dynamic programing
How to find space complexity of fibbo series ..
How to find space complexity of fibbo series ..
0 votes
2 answers
77
gready
A file contain charecters a,e,i,o,u,s,t with frequencies 10,15,12,3,4,13,&1 respectively , if we use huffman codeing for data compression then avg code length will be .
A file contain charecters a,e,i,o,u,s,t with frequencies 10,15,12,3,4,13,&1 respectively , if we use huffman codeing for data compression then avg code length will be .
6 votes
3 answers
78
binary search
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*) Hint - if lenear search is possible the go to BS Find time complexity ..?
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*)Hint - if lenear search is possi...
Page: