An odd-parity generator produces an odd-parity bit to go along with the data. The parity of the transmitted data is _ An XOR gate can test each received word for parity rejecting words with _ parity.

odd, even

high, low

low, high

even, odd

None of the above

Correct Answer: odd, even

In AES, to make the s-box, we apply the transformation b’_i = b_i XOR b_(i+4) XOR b(i+5) XOR b_(i+6) XOR b_(i+7) XOR c_i What is c_i in this transformation?

c_i is the ith bit of byte c with value 0x63

c_i is the ith bit of byte c with value 0x25

c_i is the ith bit of byte c with value 0x8F

c_i is the ith bit of byte c with value 0x8A

In AES, to make the s-box, we apply the transformation – b’i = bi XOR b(i+4) XOR b(i+5) XOR b(i+6) XOR b(i+7) XOR ci What is ci in this transformation?

ci is the ith bit of byte c with value 0x63

ci is the ith bit of byte c with value 0x25

ci is the ith bit of byte c with value 0x8F

ci is the ith bit of byte c with value 0x8A

The XOR gates are ideal for testing parity because even-parity words produce a _ output and odd-parity words produce a _ output

low, high

high, low

odd, even

even, odd

None of the above

একটি XOR লজিক গেট নিম্নলিখিত কোন লজিক গেট/ গেটগুলোর সমবায়ে গঠিত হতে পারে? (An XOR logic gate can be constructed from the combination of which of the following logic gate/gates?)

OR gate

AND gate, OR gate, and NOT gate

AND gate and NOT gate

OR gate and NOT gate

Which of the following statements are true? i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices. ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don’t contain literal pointers iii)in order to calculate the address of the next node you need to remember the address of the previous node iv)xor lists are much efficient than single, doubly linked lists and arrays

i, ii, iii, iv

i, ii, iii

i, ii

The inverse s-box permutation follows, b’_i = b_(i+2) XOR b(i+5) XOR b_(i+7) XOR d_i Here d_i is

d_i is the ith bit of a byte ‘d’ whose hex value is 0x15

d_i is the ith bit of a byte ‘d’ whose hex value is 0x05

d_i is the ith bit of a byte ‘d’ whose hex value is 0x25

d_i is the ith bit of a byte ‘d’ whose hex value is 0x51

The Chi function is defined as ← a XOR ( aXOR 1) AND a) b) a ← a AND ( aXOR 1) AND a) c) a ← a AND ( a XOR a) d) a ← a XOR ( a AND a)

a ← a XOR ( aXOR 1) AND a)

The inverse s-box permutation follows, b’i = b(i+2) XOR b(i+5) XOR b(i+7) XOR di Here di is –

di is the ith bit of a byte ‘d’ whose hex value is 0x15

di is the ith bit of a byte ‘d’ whose hex value is 0x05

di is the ith bit of a byte ‘d’ whose hex value is 0x25

di is the ith bit of a byte ‘d’ whose hex value is 0x51

Consider a binary digital communication system with equally likely 0's and 1's. When binary 0 is transmitted the detector input can lie between the levels -0.25V and +0.25V with equal probability: when binary 1 is transmitted, the voltage at the detector can have any value between 0 and 1 V with equal probability. If the detector has a threshold of 0.2 V (i.e., if the received signal is greater than 0.2 V, the bit is taken as 1), the average bit error probability is

0.15

0.2

0.05

0.5

In which of the following ways section 73 differs from the corresponding section 295 of the Code of Civil Procedure, 1882?
1. The words, 'where assets are held by a court,' have been substituted for words, 'whenever assets are realised by sale or otherwise in execution of a degree.'
2. The words, 'before the receipt of such assets,' have been substituted for the words, 'prior to the realisation'
3. The words, 'by which such assets are held' are omitted after the words 'made application to the court'
4. The word, 'passed' has been added after the word, 'money'
5. The words, 'interest in,' in cl. (b) have been substituted for the words, 'right against' to bring the wording of that clause into line with the Transfer of Property Act, 1882. This is a mere verbal alteration

1, 3

2, 4

4, 5

All of these