Hamming Code Question & Answers January 5, 2022 By WatElectronics This article lists 100 Hamming Code MCQs for engineering students. All the Hamming Code Questions & Answers given below include a hint and a link wherever possible to the relevant topic. This is helpful for users who are preparing for their exams, interviews, or professionals who would like to brush up their fundamentals on Hamming Code. A hamming code is a linear type code designed for error detection and correction in the digital world. In digital communication, data is communicated wirelessly in the form of binary digits 0’s and 1’s combination. During this data transmission process, the data transmitted from sender to receiver end can be subjected to noise and injects errors by the time receiver receives the message. Hence it’s important to identify and correct the errors that are induced in digital communication for data accuracy. Hence hamming code performs this task of error detection up to two intermediate type errors and also additionally detects errors of single bits. This process takes place in 2 stages encryption is done at the sender's end and decryption is done at the receiver's end. Where both encryption and decryption are further performed in 3 stages each for enhanced data quality between sender and receiver. This process mainly depends on the parity bits added between the original message and redundancy bits. They are employed in computing, modems plasma CAM, and more. The advantages of hamming codes include performing error detection and correction and are easy to implement. 1). Hamming code deals with _____ branch? Telecommunication Computer science Electrical Both a and b None Hint 2). Hamming code belongs to ______ codes family? Linear error correcting Non linear correcting Linear detecting Non linear detecting None Hint 3). Which of the following is the function of hamming codes? Detects 1 bit Detects 2 bits Corrects 1 bit without being detected All the above None Hint 4). A parity type bit code in hamming codes performs _____? Cannot correct codes Detects odd parity Corrects codes Both a and b None Hint 5). A Parity bit is also called ____? Check bit Binary Bit Code bit All the above None Hint 6). A parity bit is represented in ____ types? 2 3 4 5 None Hint 7). An Even parity bit is represented with ________binary digit? 1 0 10 01 None Hint 8). An Odd parity bit is represented with ________binary digit? 1 0 01 10 None Hint Read more about Binary. 9). Parity bits are added to string of ____? Parity codes Binary bits Binary codes Both a and b None Hint 10). How many minimum number of bytes a parity bit is applied? 2 3 4 8 None Hint 11). A hamming code has ____ factors? Maximum code of rate with length of block Minimum value of distance The minimum value of distance is 3 All the Above None Hint 12). Which of the following scientist invented Hamming code? Richard W Charles Danial Both a and b None Hint 13). Which of the following is the block length formula in hamming code? (2^r) – 1 1/ (2^r) (2^r) 1+(2^r) None Hint 14). Which of the following is the message length formula in hamming code? (2^r) –r -1 (2^r) 1- [r/((2^r1))] 1+ [r/((2^r1))] None Hint 15). In Hamming (7,4) Which of the following is the value of r? 1 2 3 4 None Hint 16). Hamming code is represented mathematically using_________?16. Hamming code is represented mathematically using_________? Matrix Equations Graph All the above None Hint 17). Linear type error correction codes are applicable for ______? Forward error correction Reverse error correction Forward error detection Reverse error detection None Hint 18). Linear codes are classified in to ____ types? 2 3 4 5 None Hint 19). A hamming code repeats 4bit of messages with ____ bit of code words in [7,4]? 4 7 3 1 None Hint 20). Hamming code can correct and detect error at _____ condition of error rate? Maximum Minimum Zero Infinity None Hint 21). Which of the following term in hamming code defines SECDED? Single error correcting and double error detecting Single error collection and double error detecting Single error correcting and double error deriving Single error correcting and double error dedicating None Hint 22). Which of the following term is varied in hamming code when odd number of bits are varied while transmission? Parity Sign Volume Distance None Hint 23). In which of the following condition error is undetected in hamming code? Even Odd Even-Odd None of the above None Hint 24). In which of the following condition error is detected in hamming code? Even Odd Even-Odd None of the above None Hint 25). In a noisy condition, a message bit is ________? Discarded Retransmitted Verified Both a and b None Hint Hamming Code Interview Questions and Answers 26). In two out of five code 5 bits contains _____ number of 1’s? 2 3 4 5 None Hint 27). In two out of five code 5 bits contains _____ number of 0’s? 2 3 4 5 None Hint 28). Which of the following is repetitive code for n=3? 111 000 101 001 None Hint 29). A code which reconstructs back actual message although in presence of error is called _____? Error correcting code Error detection code Error edit code All the above None Hint 30). How many possible single error bits do a 7 bit error correcting bits comprises of? 5 6 7 8 None Hint 31). On which of the following factors do hamming code mostly focus on? Distance Enhancement in code rate Error rate Both a and b None Hint 32). Which of the following logic gate is used while performing Hamming code? OR AND XOR NAND None Hint 33). In how many steps hamming algorithm can be minimized? 3 4 5 6 None Hint 34). Which of the following is the 1 st step of hamming algorithm? Calculating redundancy bits Organizing redundancy bits Calculating redundancy values Finding data bits None Hint 35). Which of the following is the 2 nd step of hamming algorithm? Calculating redundancy bits Organizing redundancy bits Calculating redundancy values Finding data bits None Hint 36). Which of the following is the 3 rd step of hamming algorithm? Calculating redundancy bits Organizing redundancy bits Calculating redundancy values Finding data bits None Hint 37). Which of the following is the 4 th step of hamming algorithm? Numbering the bits from 1,2,3,4…… Representing in binary form 1,10,11,100….. Representing to power Finding parity bits type None Hint 38). Which of the following is the data word of byte for encoded data “10011010”? __1_001_1010 __1_001_1010 __1_001_1011 None Hint 39). Which of the following is the code word of byte for encoded data “10011010”? 011100101010 001101010101 000011110001 0101010101010 None Hint 40). Which of the following is data bits of (3,1) Hamming code? 2 3 4 1 None Hint 41). Which of the parity bits of (3,1) Hamming code? 2 3 4 1 None Hint 42). Which of the total bits of (3,1) Hamming code? 2 3 4 1 None Hint 43). Which of the following is data bits of (127, 120) Hamming code? 127 120 7 10 None Hint 44). Which of the following is parity bits of (127, 120) Hamming code? 127 120 7 10 None Hint 45). Which of the following is total bits of (127, 120) Hamming code? 127 120 7 10 None Hint 46). Which of the following is the value of rate of hamming code (255,247)? 0.969 0.945 0.905 0.571 None Hint 47). Which of the following is the value of rate of hamming code (3,1)? 0.969 0.945 0.905 0.333 None Hint 48). Which of the following is the value of rate of hamming code (7,4)? 0.969 0.571 0.905 0.333 None Hint 49). A error detection type codes are classified in to ____ types? 2 3 4 5 None Hint 50). Data over communication channel is disrupted due to ____? Noise Physical damage Interruption All the above None Hint Hamming Code Important Questions for Exams 51). When the received and input data do not match then the data is called? Error Clear Substitute Both b and c None Hint 52). Digital data is represented in____? 0’s 1’s ASICC Both a and b None Hint 53). How many errors do digital data bits consist of? 2 3 4 5 None Hint 54). Which of the following type of codes are added to data bits while transmitting to identify errors? Redundancy bit Parity bits Data bits All the above None Hint 55). A redundancy bit is also called ____? Error correcting Error detection Error transmitting All the above None Hint 56). Error correction bit is performed in ___ types? 1 2 3 4 None Hint 57). In which of the following method receiver sends a request to sender for retransmitting the data which the receiver detects as error bit/message? Backward error detection Backward error correction Forward error detection Forward error correction None Hint 58). In which of the following method received error data is automatically corrected and original data is recovered? Backward error detection Forward error detection Forward error correction None Hint 59). Which of the following is the formula for combination of information bits when there are “” number of bits and “r” number of redundant bits? 2r 2/r r/2 2+r None Hint 60). How many types of error detection methods exists in digital communication? 2 3 4 5 None Hint 61). Which of the following is the representation of even parity of binary number “1001001”? 10010011 10010010 01001001 11001001 None Hint 62). Which of the following is the representation of odd parity of binary number “1001001”? 10010011 10010010 01001001 11001001 None Hint 63). A error free data received should contain ___ number of 1’s to ensure that the received data is error free? Even Odd Even and Odd Zero None Hint 64). Which of the following error detection method is less expensive compared to other error detection methods? Parity check Longitudinal redundancy check Cyclic Redundancy Check (CRC) Both a and b None Hint 65). Which of the following is the abbreviation of LRC in error detection method? Longitudinal Redundancy Check Latitudinal Redundancy Check Longitudinal React Check Large Redundancy Check None Hint 66). Which of the following is the function of LRC error detection method? Transmits parity bits Adds original data Checks the redundancy All the above None Hint 67). Which of the following is the abbreviation of CRC error detection method? Cyclic Redundancy Check Cloud Redundancy Check Circle Redundancy Check Cyclic Redundancy Close None Hint 68). Which of the following error detection method detects whether the received data is original data or not? Parity check Longitudinal redundancy check Cyclic Redundancy Check (CRC) Both a and b None Hint 69). Which of the following error detection method uses binary division? Parity check Longitudinal redundancy check Cyclic Redundancy Check (CRC) Both a and b None Hint 70). Which of the following are the components of binary division? Divisor Dividend Remainder All the above None Hint 71). At which of the following point Cyclic Redundancy Check (CRC) error detection method performs binary division? Before transition Before transmitting After transmitting After receiving None Hint 72). Up to how many intermediate errors do hamming code detects? 1 2 3 4 None Hint 73). The redundant bits in hamming code is added at ____ end? Sender Receiver Transmitter Both a and c None Hint 74). Which of the methods drawback do hamming code overcome? Parity check CRC LRC All the above None Hint 75). Hamming codes are added to _____________? Redundancy bits Original bits Modified bits Both a and b None Hint Hamming Code Quiz Questions and Answers. 76). In which of the following application hamming codes are widely used? ECC memory EDC memory ECDC memory All the above None Hint 77). In the formula n+p+1 the value of n+p is called_________? Error location in each bit position Extra state No error No of states None Hint 78). In the formula n+p+1 the value of “1” is called_________? Error location in each bit position Extra state No error No of states None Hint 79). In hamming code the power of “p” is given power in terms of ____? 2,4,8…….. 1,2,4,8….. 1,3,4,5,6,….. 1,2,3,4,5…….. None Hint 80). In how many steps hamming code can be decrypted? 1 2 3 4 None Hint 81). Which of the following is the first step of hamming code? Counting number of redundant bits Correcting redundant bits position Checking parity Assigning powers None Hint 82). Which of the following is the second step of hamming code? Counting number of redundant bits Correcting redundant bits position Checking parity Assigning powers None Hint 83). Which of the following is the 3 rd step of hamming code? Counting number of redundant bits Correcting redundant bits position Correcting redundant bits position Assigning powers None Hint 84). Which of the following is the formula used for counting no of redundant type bits? 2p>= n+p+1 2p> n+p+1 2p<= n+p+1 2p>= n+p-1 None Hint 85). Which of the following is the value of parity bit p1? 1,3,5,7,9….. 2,3,6,7,10,11 4-7,12-15,20-23 Both a and b None Hint 86). Which of the following is the value of parity bit p2? 1,3,5,7,9….. 2,3,6,7,10,11 4-7,12-15,20-23 Both a and b None Hint 87). Which of the following is the value of parity bit p3? 1,3,5,7,9….. 2,3,6,7,10,11 4-7,12-15,20-23 Both a and b None Hint 88). Which of the following are the advantages of hamming codes? Performs error detection Performs error correction Easy implementation All the above None Hint 89). Which of the following are the disadvantages of hamming codes? Effective for single bit error based correction Effective for single bit error based detection Can resolve only the single bit type errors alone All the above None Hint 90). Which of the following are the applications of hamming codes? Computing Modems Plasma CAM All the above None Hint 91). Are hamming code cyclic? Yes No May be Depends on the code bits None Hint 92). The process of encryption is done at ____ end in digital communication? Receiver Transmitter Sender Both b and c None Hint 93). The process of decryption is done at ____ end in digital communication? Receiver Transmitter Sender Both b and c None Hint 94). Which of the following is the formula for rate in hamming code? R=k/n R=k*n R=n/k All the above None Hint 95). Which of the following are the examples of block codes? Hamming codes RS codes Reed Muller codes All the above None Hint 96). A message length in digital communication is also called _____? Dimensions Duration Time Distance None Hint 97). A parity check matrix represents ___ code word relation? Linear Nonlinear Bilateral All the above None Hint 98). A parity check type matrix is derived from ______? Generator type matrix Production matrix Data matrix Identity matrix None Hint 99). At which of the following conditions ECC memory cannot tolerate? Infrastructural memory caches Critical database Industrial control applications All the above None Hint 100). _____ is zero matrix? H[G(^T)] =0 H/[G(^T)] =0 H-[G(^T)] =0 H+[G(^T)] =0 None Hint Time's up
