Dark Mode

Recent questions tagged error-detection

0 votes

2 answers

1

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

Souvik33 asked in Compiler Design Jan 13

235 views

1 vote

1 answer

2

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

Nisha Bharti asked in Computer Networks Sep 18, 2022

by Nisha Bharti

163 views

1 vote

4 answers

3

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 22
If the original size of data is $40$ then after adding error detection redundancy bit the size of data length is $26$ $36$ $46$ $56$

Lakshman Bhaiya asked in Computer Networks Apr 1, 2020

by Lakshman Bhaiya

4.9k views

0 votes

1 answer

4

ISI2017-PCB-CS-8-b
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}$

akash.dinkar12 asked in Digital Logic Apr 8, 2019

by akash.dinkar12

606 views

0 votes

0 answers

5

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

ajaysoni1924 asked in Digital Logic Apr 6, 2019

by ajaysoni1924

919 views

1 vote

0 answers

6

Morris Mano Edition 3 Exercise 7 Question 38 (Page No. 305)
Given the 8-bit data word 01011011, generate the 13-bit composite word for the Hamming code that corrects the single bit error and detects double bit errors.

ajaysoni1924 asked in Digital Logic Apr 6, 2019

by ajaysoni1924

1.1k views

0 votes

0 answers

7

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

Nishi Agarwal asked in Computer Networks Mar 17, 2019

by Nishi Agarwal

4.0k views

0 votes

0 answers

8

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.

Nishi Agarwal asked in Computer Networks Mar 17, 2019

by Nishi Agarwal

4.0k views

0 votes

0 answers

9

Andrew S. Tanenbaum Edition 5th Exercise 3 Question 39 (Page No. 255)
The goal of this lab exercise is to implement an error-detection 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.

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

449 views

1 vote

1 answer

10

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.

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

1.3k views

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.

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

22.4k views

2 votes

1 answer

12

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

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

7.4k views

0 votes

2 answers

13

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?

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

4.7k views

1 vote

0 answers

14

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.

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

335 views

1 vote

0 answers

15

Andrew S. Tanenbaum Edition 5th Exercise 3 Question 10 (Page No. 252)
A 12-bit 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.

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

512 views

1 vote

0 answers

16

Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)
To provide more reliability than a single parity bit can give, an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second parity bit for all the even-numbered bits. What is the Hamming distance of this code?

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

720 views

0 votes

0 answers

17

Andrew S. Tanenbaum Edition 5th Exercise 4 Question 27 (Page No. 353)
Give two reasons why networks might use an error-correcting code instead of error detection and retransmission.

ajaysoni1924 asked in Computer Networks Mar 15, 2019

by ajaysoni1924

237 views

2 votes

1 answer

18

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?

superak96 asked in Computer Networks Feb 7, 2019

819 views

0 votes

0 answers

19

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?

sreenivas.s1995 asked in Compiler Design Jan 30, 2019

by sreenivas.s1995

267 views

0 votes

0 answers

20

UPPCL AE 2018:14
Suppose that a code has the following four valid codewords: $\begin{array} \\ 11001100 \\ 00110011 \\ 11111111 \\ 00000000 \end{array}$ What is the minimum number of errors that can be detected for this code? $3$ $4$ $2$ $1$

Lakshman Bhaiya asked in Computer Networks Jan 5, 2019

by Lakshman Bhaiya

238 views

1 vote

1 answer

21

Parity Check Self Doubt
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?

vinay chauhan asked in Computer Networks Jan 4, 2019

by vinay chauhan

1.3k views

0 votes

0 answers

22

#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!

iarnav asked in Computer Networks Dec 1, 2018

by iarnav

324 views

1 vote

2 answers

23

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.

Gupta731 asked in Computer Networks Nov 30, 2018

452 views

0 votes

0 answers

24

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

Ashish Goyal asked in Computer Networks Nov 26, 2018

by Ashish Goyal

841 views

0 votes

0 answers

25

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) (8-bits 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?

John Doe asked in Computer Networks Nov 24, 2018

345 views

2 votes

2 answers

26

#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

iarnav asked in Computer Networks Nov 19, 2018

by iarnav

2.5k views

0 votes

0 answers

27

#CN Error Detection - How many bit errors can simple parity bit error detection or 1-D parity bit can detect?

iarnav asked in Computer Networks Nov 16, 2018

by iarnav

422 views

0 votes

1 answer

28

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

Vegeta asked in Computer Networks Oct 15, 2018

by Vegeta

471 views

1 vote

2 answers

29

UGC NET CSE | July 2018 | Part 2 | Question: 49
To guarantee correction of upto $t$ errors, the minimum Hamming distance $d_{min}$ in a block code must be ______ $t+1$ $t-2$ $2t-1$ $2t+1$

Pooja Khatri asked in Computer Networks Jul 13, 2018

by Pooja Khatri

2.1k views

1 vote

1 answer

30

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

bts asked in Computer Networks Jun 15, 2018

by bts

1.4k views

Page:

Recent questions tagged error-detection