Register
Filter

Questions by amitlko

0 votes
1 answer
2
Testbook
Assume x, y and z are n bit binary numbers then which of the following inequalities hold about Hamming Distance between them? A. HD(x,y)+HD(y,z)>=HD(x,z) B. HD(x,y)+HD(y,z)<=HD(x,z) C. HD(x,y) - HD(y,z)>=HD(x,z) D. None of the above
Assume x, y and z are n bit binary numbers then which of the following inequalities hold about Hamming Distance between them?A. HD(x,y)+HD(y,z)>=HD(x,z)B. HD(x,y)+HD(y,z)...
2 votes
1 answer
3
Testbook
Consider the following two 2’s complement numbers,10001011and 11110011 and perform the arithmetic addition operation. what is the status of the carry,sign,zero and overflow flags after the operation? A)1,0,1,1 B)1,0,0,1 C)1,1,0,0 D)1,1,1,0
Consider the following two 2’s complement numbers,10001011and 11110011 and perform the arithmetic addition operation. what is the status of the carry,sign,zero and over...
0 votes
3 answers
4
Self Doubt
Are Turing Recognizable and Turing Acceptable languages same? What is their relationship with recursive enumerable and recursive language?
Are Turing Recognizable and Turing Acceptable languages same? What is their relationship with recursive enumerable and recursive language?
8 votes
5 answers
5
Gateforum test series
Identify the regular expression which represents the language containing all strings of $a's$ and $b's$ where each string contains at least two $b's$ $(a+b)^*ba^*b$ $(a+b)^*ba^*ba$ $(a+b)^*ba^*b(a+b)^*$ None of these
Identify the regular expression which represents the language containing all strings of $a's$ and $b's$ where each string contains at least two $b's$$(a+b)^*ba^*b$$(a+b)^...