GATE CS 2017 (Afternoon) — Question 34

Computer Networks (CN)Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging)MCQ2 marks · −2/3 if wrongMedium

Consider a binary code that consists of only four valid codewords as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code be p and the maximum number of erroneous bits that can be corrected by the code be q. Then the values of p and q are
  1. A
    p = 3 and q = 1
  2. B
    p = 3 and q = 2
  3. C
    p = 4 and q = 1
  4. D
    p = 4 and q = 2
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group