Search results for error-detection / GATE Overflow for GATE CSE

64 votes

6 answers

1

GATE CSE 2009 | Question: 48
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.

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)$ contai...

Kathleen

29.3k views

Kathleen asked Sep 22, 2014

39 votes

7 answers

2

GATE IT 2007 | Question: 43
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$

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?...

Ishrat Jahan

25.7k views

Ishrat Jahan asked Oct 29, 2014

0 votes

3 answers

3

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 (4-bit word). What is the value of the checksum?

Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum(4-bit word). What is the value of the checksum?

ajaysoni1924

7.5k views

ajaysoni1924 asked Mar 16, 2019

37 votes

4 answers

4

GATE IT 2005 | Question: 74
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 ... $[1 - (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)$

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 ...

Ishrat Jahan

8.9k views

Ishrat Jahan asked Nov 3, 2014

48 votes

7 answers

5

GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$

A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit...

go_editor

22.4k views

go_editor asked Sep 28, 2014

3 votes

1 answer

6

ISRO 2024
Which of the following methods is used to detect double errors? Odd parity Even parity Checksum (CRC) Checksum (XOR)

Which of the following methods is used to detect double errors?Odd parityEven parityChecksum (CRC)Checksum (XOR)

Ramayya

292 views

Ramayya asked Jan 7

1 votes

1 answer

7

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 33
The "two-out-of-five" code comprises all possible binary words of length $5$ containing exactly two $1$'s. Which of the following statements is correct regarding error detection or correction for the "two-out- ... detect up to $1$ bit of error and cannot correct errors. The code cannot detect or correct any errors.

The "two-out-of-five" code comprises all possible binary words of length $5$ containing exactly two $1$'s. Which of the following statements is correct regarding error de...

GO Classes

480 views

GO Classes asked Jan 13

27 votes

4 answers

8

GATE CSE 2007 | Question: 68, ISRO2016-73
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$

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$$110010010...

Kathleen

34.0k views

Kathleen asked Sep 21, 2014

39 votes

3 answers

9

GATE CSE 2017 Set 2 | Question: 34
Consider the binary code that consists of only four valid codewords as given below: $00000, 01011, 10101, 11110$ Let the minimum Hamming distance of the code $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 $p=3$ and $q=1$ $p=3$ and $q=2$ $p=4$ and $q=1$ $p=4$ and $q=2$

Consider the binary code that consists of only four valid codewords as given below:$00000, 01011, 10101, 11110$Let the minimum Hamming distance of the code $p$ and the ma...

Arjun

15.5k views

Arjun asked Feb 14, 2017

1 votes

1 answer

10

Made Easy Test Series 2024
Given data 10111100 Then P1, P2, P4, Pg parity bits that are attached to data to form codeword are Why they are taking parity bits from LHS in below question A 12 bit hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What could be ... not more than 1 bits in error. if we take parity bits in LHS AND RHS we get different result please anyone clarify it

Given data 10111100 Then P1, P2, P4, Pg parity bits that are attached to data to form codeword are Why they are taking parity bits from LHS in below question A 12 bit ham...

Ray Tomlinson

768 views

Ray Tomlinson asked Aug 16, 2023

0 votes

1 answer

11

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.

A bit stream 10011101 is transmitted using the standard CRC method described in thetext. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Supp...

ajaysoni1924

34.3k views

ajaysoni1924 asked Mar 16, 2019

1 votes

2 answers

12

Compiler Design | Error in which stage detection
What is the earliest stage compiler error for the following C code snippet: int x = @33; Lexical Error Syntax Error Semantic Error None

What is the earliest stage compiler error for the following C code snippet:int x = @33;Lexical ErrorSyntax ErrorSemantic ErrorNone

Souvik33

577 views

Souvik33 asked Jan 12, 2023

1 votes

1 answer

13

Self doubt.
For 8-bit checksum is this correct?

For 8-bit checksum is this correct?

Nisha Bharti

340 views

Nisha Bharti asked Sep 18, 2022

39 votes

8 answers

14

GATE IT 2008 | Question: 66
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$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$

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...

Ishrat Jahan

15.5k views

Ishrat Jahan asked Oct 29, 2014

31 votes

7 answers

15

GATE CSE 1994 | Question: 9
Following $7$ ... that at most $1$ bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.

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 \qq...

Kathleen

8.8k views

Kathleen asked Oct 5, 2014

28 votes

4 answers

16

GATE CSE 1992 | Question: 01,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 _______.

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 detecti...

Kathleen

11.8k views

Kathleen asked Sep 12, 2014

0 votes

2 answers

17

coaching

Kuldeep Pal

576 views

Kuldeep Pal asked May 4, 2017

2 votes

1 answer

18

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?$

What is the remainder obtained by dividing $x^7 + x ^5 + 1$ by the generator polynomial $x^ 3 + 1?$

ajaysoni1924

10.7k views

ajaysoni1924 asked Mar 16, 2019

1 votes

1 answer

19

Andrew S. Tanenbaum Edition 5th Exercise 3 Question 18 (Page No. 253)
A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computed using the IEEE 802 standardized, 32-degree CRC polynomial. For each of the following, explain whether the errors during message transmission will be ... . (e) There was a 24-bit long burst error. (f) There was a 35-bit long burst error.

A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computedusing the IEEE 802 standardized, 32-degree CRC polynomial. For each of thefollowing...

ajaysoni1924

1.8k views

ajaysoni1924 asked Mar 16, 2019

1 votes

2 answers

20

Hamming Distance Question

hem chandra joshi

5.8k views

hem chandra joshi asked Dec 30, 2017

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