retagged by
12,324 views
14 14 votes

Bit stuffing refers to

  1. inserting a $0$ in user stream to differentiate it with a flag
  2. inserting a $0$ in flag stream to avoid ambiguity
  3. appending a nipple to the flag sequence
  4. appending a nipple to the use data stream

2 Answers

Best answer
19 19 votes

Bit stuffing refers to inserting a 0 in user stream to differentiate it with a flag.

Each frame begins and ends with a special bit pattern called a flag byte ex. 01111110.

Whenever sender data link layer encounters five consecutive ones in the data stream, it
automatically stuffs a 0 bit into the outgoing stream.

When the receiver sees five consecutive incoming ones followed by a 0 bit, it automatically
destuffs the 0 bit before sending the data to the network layer.

Option A is correct.

selected by
5 5 votes
Bit Stuffing refers to the insertion of non information bits into data.

Application:-

1.To Differentite the Frame delimator (Used for Synchronization purpose)From the original data.

2.For bringing bit streams that do not necessarily have the same or rationally related bit rates up to a common rate.

3.To fill buffers or frames.

https://en.m.wikipedia.org/wiki/Bit_stuffing
Answer:
Position:
Show:

Related questions

7 7 votes
2 answers 2 answers
8.4k
8.4k views
go_editor asked Jun 10, 2016
8,400 views
Phase transition for each bit are used inAmplitude modulationCarrier modulationManchester encodingNRZ encoding
11 11 votes
3 answers 3 answers
12.6k
12.6k views
go_editor asked Jun 10, 2016
12,639 views
If the bandwidth of a signal is $5$ kHz and the lowest frequency is $52$ kHz, what is the highest frequency$5$ kHz$10$ kHz$47$ kHz$57$ kHz
5 5 votes
2 answers 2 answers
6.3k
6.3k views
go_editor asked Jun 10, 2016
6,286 views
By using an eight bit optical encoder the degree of resolution that can be obtained is (approximately)$1.8^\circ$$3.4^\circ$$2.8^\circ$$1.4^\circ$
61 61 votes
5 answers 5 answers
14.4k
14.4k views
Kathleen asked Sep 17, 2014
14,390 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...