Computer Sciences > GATE 2021 SET-1 > Error Control
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5p8d4d4d3d2p4d1p2p1 where the data bits and the check bits are given in the following tables:
Which one of the following choices gives the correct values of x and y?
A
x is 0 and y is 0.
B
x is 0 and y is 1.
C
x is 1 and y is 0.
D
x is 1 and y is 1.

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science