The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged errordetection
0
votes
1
answer
1
Error detection
Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. A t + 1 B t C t  2 D t / 2
asked
Jun 15
in
Computer Networks
by
bts
(
137
points)

57
views
computernetworks
errordetection
hammingcode
0
votes
0
answers
2
[Comouter networks] Error detection Policy
asked
May 2
in
Compiler Design
by
rahul sharma 5
Boss
(
24.5k
points)

54
views
computernetworks
errordetection
0
votes
1
answer
3
Hamming Distance Question
asked
Dec 31, 2017
in
Computer Networks
by
hem chandra joshi
Active
(
4.4k
points)

353
views
hammingcode
errordetection
+2
votes
1
answer
4
hamming distance
To provide more reliability than the Single Parity Bit technique, a new errordetecting scheme has been proposed. The scheme uses first parity bit for checking all the odd numbered bits and a second parity bit for all the even numbered bits. What is the (minimum) Hamming distance of this code ?
asked
Oct 18, 2017
in
Computer Networks
by
just_bhavana
Boss
(
11.9k
points)

487
views
hammingcode
errordetection
+2
votes
1
answer
5
Computer Networks: Bit Stuffing
Flag: 01111110 Data: 1000111111100111110100011111111111000011111 bit stuff the given data?
asked
Aug 3, 2017
in
Computer Networks
by
Manu Thakur
Boss
(
39.8k
points)

2.2k
views
computernetworks
bitstuffing
errordetection
+1
vote
1
answer
6
Hamming Distance, Linear Block Codes
Following text and screenshot are taken from Forouzan's CN book: "In a linear block code, the exclusive OR (XOR) of any two valid codewords creates another valid codeword." My question is EXoring of which two codewords in Table 10.2 will create first codeword 00000?
asked
Jul 31, 2017
in
Computer Networks
by
Manu Thakur
Boss
(
39.8k
points)

362
views
computernetworks
hammingcode
errordetection
0
votes
1
answer
7
coaching
asked
May 4, 2017
in
Computer Networks
by
Kuldeep Pal
Active
(
1.3k
points)

126
views
errordetection
errorcorrection
+3
votes
1
answer
8
Internet Checksum
Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum (4bit word). What is the value of the checksum?
asked
Sep 14, 2016
in
Computer Networks
by
Debashish Deka
Veteran
(
56.9k
points)

1.4k
views
computernetworks
checksum
errordetection
+4
votes
2
answers
9
ISRO201150
Data is transmitted continuously at 2.048 Mbps rate for 10 hours and received 512 bits errors. What is the bit error rate? 6.9 e9 6.9 e6 69 e9 4 e9
asked
Jun 21, 2016
in
Computer Networks
by
Sanjay Sharma
Boss
(
48.8k
points)

2.2k
views
isro2011
computernetworks
errordetection
+2
votes
2
answers
10
ISI2013CS6a
A block of bits with $n$ rows and $m$ columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expression for the probability that the error will be detected.
asked
Jun 1, 2016
in
Computer Networks
by
jothee
Veteran
(
99.8k
points)

294
views
descriptive
isi2013
errordetection
computernetworks
+3
votes
4
answers
11
ISI2015CS4a
Consider the use of Cyclic Redundancy Code (CRC) with generator polynomial $G(x)$ for error detection. Recall that error detection with a CRC works by appending the CRC value to the bit sequence to make it a multiple of $G(x)$. Calculate the CRC value of the bit ... a burst error of length 5 in such a way that the error cannot be detected by the CRC with the $G(x)$ given above.
asked
May 29, 2016
in
Computer Networks
by
jothee
Veteran
(
99.8k
points)

628
views
descriptive
isi2015
computernetworks
errordetection
crcpolynomial
+1
vote
5
answers
12
ISRO201318
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code? $5$ $6$ $7$ $8$
asked
Apr 26, 2016
in
Computer Networks
by
makhdoom ghaya
Boss
(
40.1k
points)

4.1k
views
isro2013
errordetection
+2
votes
1
answer
13
Parity Bit
How many parity bits will be required for transmitting a 16bit data ? a 6 b 3 c 2 d 1
asked
Apr 19, 2016
in
Computer Networks
by
shivanisrivarshini
Boss
(
14.1k
points)

596
views
errordetection
+17
votes
4
answers
14
GATE2005IT74
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have bit error probability of $b_1$ and $b_2$ respectively. The probability that the packet will be received without error via ...  (b_1 + b_2)^L]p_1p_2$ $(1  b_1)^L (1  b_2)^Lp_1p_2$ $1  (b_1^Lp_1 + b_2^Lp_2)$
asked
Nov 4, 2014
in
Computer Networks
by
Ishrat Jahan
Boss
(
19.1k
points)

1.6k
views
gate2005it
computernetworks
errordetection
probability
normal
+3
votes
1
answer
15
GATE2004IT71
A software was tested using the error seeding strategy in which 20 errors were seeded in the code. When the code was tested using the complete test suite, 16 of the seeded errors were detected. The same test suite also detected 200 nonseeded errors. What is the estimated number of undetected errors in the code after this testing? 4 50 200 250
asked
Nov 2, 2014
in
IS&Software Engineering
by
Ishrat Jahan
Boss
(
19.1k
points)

576
views
gate2004it
is&softwareengineering
errordetection
normal
+18
votes
7
answers
16
GATE2007IT43
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected? $0$ $1$ $2$ $3$
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan
Boss
(
19.1k
points)

3.6k
views
gate2007it
computernetworks
errordetection
normal
+18
votes
6
answers
17
GATE2008IT66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ of ... shows data received by a receiver and has $n$ corrupted bits. What is the miniĀmum possible value of $n$? $1$ $2$ $3$ $4$
asked
Oct 29, 2014
in
Computer Networks
by
Ishrat Jahan
Boss
(
19.1k
points)

2.6k
views
gate2008it
computernetworks
normal
errordetection
+14
votes
6
answers
18
GATE19951.12
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$? $2$ $3$ $4$ $1$
asked
Oct 8, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.5k
points)

1.1k
views
gate1995
computernetworks
errordetection
normal
+13
votes
5
answers
19
GATE19949
Following $7$ bit single error correcting hamming coded message is received. $$\overset{7\qquad 6\qquad 5 \qquad 4\qquad 3 \qquad 2 \qquad 1}{\boxed{1 \qquad 0\qquad 0 \qquad 0 \qquad 1 \qquad 1 \qquad 0}} \qquad \overset{\textbf{bit No.}}{ ... (assuming that at most $1$ bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.
asked
Oct 6, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.5k
points)

1.1k
views
gate1994
computernetworks
errordetection
hammingcode
normal
+24
votes
4
answers
20
GATE200948
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.5k
points)

4.6k
views
gate2009
computernetworks
errordetection
normal
+14
votes
4
answers
21
GATE200768, ISRO201673
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.5k
points)

5.5k
views
gate2007
computernetworks
errordetection
crcpolynomial
normal
isro2016
+13
votes
3
answers
22
GATE199201,ii
Consider a $3$$bit$ error detection and $1$$bit$ error correction hamming code for $4$$bit$ data. The extra parity bits required would be ___ and the $3$$bit$ error detection is possible because the code has a minimum distance of ____.
asked
Sep 13, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.5k
points)

2.1k
views
gate1992
computernetworks
errordetection
normal
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Schedule for GATE 2019
GATE 2019 official website
Correct way of preparation
Right process to start solving MCQs in Comp.Sc.
UGC NET JULY 2018 Results
Follow @csegate
Gatecse
Recent questions tagged errordetection
Recent Blog Comments
gate overflow books are awesome; every one should ...
Books are there but don't think any will leave ...
Sir i have placed the order Details are PAYMENT ...
Sir i am placing order for gate overflew book ...
Yes, their tracking system is incomplete. ...
38,094
questions
45,587
answers
132,149
comments
49,126
users