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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged errordetection
0
votes
0
answers
1
ISI2017PCBCS8b
Consider a simple code $\mathcal{C}$ for error detection and correction. Each codeword in $\mathcal{C}$ consists of $2$ data bits $[d_1, d_0]$ followed by check bits $[c_2, c_1, c_0]$ ... . Write down all the codewords for $\mathcal{C}$ Determine the minimum Hamming distance between any two distinct codewords of $\mathcal{C}$
asked
Apr 8
in
Digital Logic
by
akash.dinkar12
Boss
(
41.7k
points)

35
views
isi2017pcbcs
digitallogic
errordetection
programming
descriptive
0
votes
0
answers
2
Morris Mano Edition 3 Exercise 7 Question 42 (Page No. 306)
It is necessary to formulate the hamming code for four data bits $D _3, D _5, D _6 and D _7$ together with three parity bits $P _1, P _2 and P _3$. evaluate the 7bit composite code word for the data word 0010. Evaluate ... error detection in the code. Assume that error occurs in the bit $D _5 and P _2$. Show how the error is detected.
asked
Apr 6
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

37
views
digitallogic
hammingcode
errorcorrection
errordetection
0
votes
0
answers
3
Morris Mano Edition 3 Exercise 7 Question 38 (Page No. 305)
Given the 8bit data word 01011011, generate the 13bit composite word for the Hamming code that corrects the single bit error and detects double bit errors.
asked
Apr 6
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

58
views
digitallogic
hammingcode
errorcorrection
errordetection
0
votes
0
answers
4
Foruzan,Error Detection and Correction: Exercise,Ques:23 Please Explain
23: We need a dataword of at least 11 bits. Find the values of k and n in the Hamming code C(n, k) with dmin :3. Soln: We need to find k = 2m −1 − m ≥ 11. We use trial and error to find the right answer: a. Let m ... 24 −1 − 4 = 11 (acceptable) Comment: The code is C(15, 11) with dmin = 3. How this n=15 came?? please explain
asked
Mar 17
in
Computer Networks
by
Nishi Agarwal
(
87
points)

169
views
computernetworks
errordetection
0
votes
0
answers
5
Foruzan, Error Detection and Correction :Exercise Ques: 32 Please Explain
32: A sender needs to send the four data items Ox3456, OxABCC, Ox02BC, and OxEEEE. Answer the following: a. Find the checksum at the sender site. b. Find the checksum at the receiver site if there is no error.
asked
Mar 17
in
Computer Networks
by
Nishi Agarwal
(
87
points)

95
views
computernetworks
errordetection
0
votes
0
answers
6
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 39 (Page No. 255)
The goal of this lab exercise is to implement an errordetection mechanism using the standard CRC algorithm described in the text. Write two programs, generator and verifier. The generator program reads from standard input a ... correct, but by typing generator <file  alter arg  verifier you should get the error message.
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

21
views
computernetworks
datalinklayer
tanenbaum
errordetection
crc
programming
0
votes
0
answers
7
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 18 (Page No. 253)
A 1024bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computed using the IEEE 802 standardized, 32degree CRC polynomial. For each of the following, explain whether the errors during message transmission will be ... . (e) There was a 24bit long burst error. (f) There was a 35bit long burst error.
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

39
views
computernetworks
datalinklayer
tanenbaum
crcpolynomial
errordetection
0
votes
1
answer
8
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 17 (Page No. 253)
A bit stream 10011101 is transmitted using the standard CRC method described in the text. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Suppose that the third bit from the left is inverted ... . Give an example of bit errors in the bit string transmitted that will not be detected by the receiver.
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

39
views
computernetworks
tanenbaum
crc
errordetection
datalinklayer
+1
vote
1
answer
9
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 16 (Page No. 253)
What is the remainder obtained by dividing $x^7 + x ^5 + 1$ by the generator polynomial $x^ 3 + 1?$
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

26
views
computernetworks
tanenbaum
errordetection
datalinklayer
crcpolynomial
0
votes
0
answers
10
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 15 (Page No. 253)
Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum (4bit word). What is the value of the checksum?
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

28
views
computernetworks
datalinklayer
tanenbaum
errordetection
checksum
0
votes
0
answers
11
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 13 (Page No. 252)
A block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection. Suppose that exactly 4 bits are inverted due to transmission errors. Derive an expression for the probability that the error will be undetected.
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

21
views
computernetworks
datalinklayer
errordetection
tanenbaum
probability
0
votes
0
answers
12
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 10 (Page No. 252)
A 12bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the original value in hexadecimal? Assume that not more than 1 bit is in error.
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

24
views
computernetworks
datalinklayer
errordetection
hammingcode
tanne
tanenbaum
0
votes
0
answers
13
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)
To provide more reliability than a single parity bit can give, an errordetecting coding scheme uses one parity bit for checking all the oddnumbered bits and a second parity bit for all the evennumbered bits. What is the Hamming distance of this code?
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

45
views
computernetworks
datalinklayer
tanenbaum
errordetection
hammingcode
0
votes
0
answers
14
Andrew S. Tanenbaum Edition 5th Exercise 4 Question 27 (Page No. 353)
Give two reasons why networks might use an errorcorrecting code instead of error detection and retransmission.
asked
Mar 15
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

17
views
computernetworks
errordetection
errorcorrection
tanenbaum
+2
votes
1
answer
15
Error Detection Using CRC
For detecting a single bit error using CRC, it is needed that $x^{i}$ should not be divisible by g(x). So, we make g(x) of at least 2 terms, which renders a single term of e(x) indivisible. But then what is the logic behind keeping MSB as 1. ... any single bit indivisible? For example, $x^{3}+x^{2}$ is guarantees to detect a single bit error at any position. Is it not?
asked
Feb 7
in
Computer Networks
by
superak96
(
265
points)

151
views
crcpolynomial
crc
computernetworks
errordetection
singlebiterror
0
votes
0
answers
16
Self dout
Which phase of the compiler detects the error? #include<stdio.h> int main() { printf(“%d”,2..3); return 0; } I think lexical analyzer am i correct?
asked
Jan 30
in
Compiler Design
by
sreenivas.s1995
(
139
points)

74
views
compilerdesign
errordetection
0
votes
0
answers
17
Parity Check Self Doubt
How many bits can a 2dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for Ndimensional parity?
asked
Jan 4
in
Computer Networks
by
vinay chauhan
Active
(
1.2k
points)

94
views
computernetworks
errordetection
errorcorrection
0
votes
0
answers
18
#CN Which protocols provide error correction in data?
TCP UDP IGMP ICMP I think ICMP can’t correct the error in data and rest three protocols can correct data errors!
asked
Dec 1, 2018
in
Computer Networks
by
iarnav
Loyal
(
8.2k
points)

74
views
computernetworks
errordetection
error
errorcorrection
0
votes
1
answer
19
Gateforum Test Series: Computer Networks  Error Detection
Which of the following statements is FALSE for the generator $x^{6}$+1? S1: This generator can detect all burst errors with a length of 5 bits. S2: This generator can detect some but not all burst errors with a length of 6 bits.
asked
Nov 30, 2018
in
Computer Networks
by
Gupta731
Active
(
4.6k
points)

63
views
gateforumtestseries
computernetworks
errordetection
0
votes
0
answers
20
GeeksforGeeks
Data transmitted on a link uses the following 2D parity scheme for error detection: Each sequence of 28 bits is arranged in a 4 7 matrix (rows r0 through r3, and columns d7 through d1) and is padded with a column d0 and row r4 of parity bits computed using the ... . The table shows data received by a receiver and has n corrupted bits. What is the minimum possible value of n? 1 2 3 4
asked
Nov 26, 2018
in
Computer Networks
by
Ashish Goyal
(
417
points)

83
views
errordetection
2dparity
0
votes
0
answers
21
Error detecting and error correcting codes
The IP protocol implements Internet checksum over just the IP header. As the packet passes through the routers, one field called Time To Live (TTL) (8bits long) in the IP header is decremented at each router. So, each router needs ... in the header. Is there a way to update the checksum without having to recalculate the checksum over the entire header?
asked
Nov 24, 2018
in
Computer Networks
by
John Doe
(
5
points)

71
views
errordetection
errorcorrection
computernetworks
+1
vote
2
answers
22
#CN Forouzan Error Correction Hamming Code
If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error. A) 5 B) 4 C) 3 D) none of the above
asked
Nov 19, 2018
in
Computer Networks
by
iarnav
Loyal
(
8.2k
points)

265
views
computernetworks
hammingcode
hamming
distance
errordetection
0
votes
0
answers
23
#CN Error Detection  How many bit errors can simple parity bit error detection or 1D parity bit can detect?
asked
Nov 16, 2018
in
Computer Networks
by
iarnav
Loyal
(
8.2k
points)

48
views
computernetworks
errordetection
0
votes
1
answer
24
self doubt
CRC can detect any odd number of errors. CRC can detect all burst errors of less than the degree of the polynomial. Please explain and if possible give proof
asked
Oct 15, 2018
in
Computer Networks
by
Vegeta
Junior
(
835
points)

55
views
crcpolynomial
computernetworks
errordetection
0
votes
2
answers
25
UGCNETJuly2018II49
To guarantee correction of upto $t$ errors, the minimum Hamming distance $d_{min}$ in a block code must be ______ $t+1$ $t2$ $2t1$ $2t+1$
asked
Jul 13, 2018
in
Computer Networks
by
Pooja Khatri
Boss
(
10.8k
points)

429
views
ugcnetjuly2018ii
computernetworks
errorcorrection
errordetection
0
votes
1
answer
26
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, 2018
in
Computer Networks
by
bts
(
123
points)

263
views
computernetworks
errordetection
hammingcode
0
votes
0
answers
27
[Comouter networks] Error detection Policy
Consider the following set of codewords(Last bit is even parity of the first two bits) 000 011 101 110 Now here min. hamming distance is 2 and if i apply formulae Min. hamming distance =d+1,then d errors can be detected 2=d+1 d=1 Means 1 ... So 3 bit error can also be detected,but by formula it says 1 bit error can be detected. Please tell what did i miss?
asked
May 2, 2018
in
Compiler Design
by
rahul sharma 5
Boss
(
25.2k
points)

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

628
views
hammingcode
errordetection
+2
votes
1
answer
29
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
(
12.1k
points)

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

2.8k
views
computernetworks
bitstuffing
errordetection
Page:
1
2
next »
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
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Standard Book Exercise Questions for Computer Science
Follow @csegate
Recent questions tagged errordetection
Recent Blog Comments
Favorite is not working for blogs.. In favorites...
Favourite option does work. But list options...
Blog favorite button doesnt work?
@Arjun Sir can we have an option to save such...
Thanks Sir
50,666
questions
56,165
answers
193,788
comments
93,872
users