Suming that bit stuffir sequence 01110110 as (b) (c) sol. 0111 is flag 011101100 011010110 (d) 0110101100 so, after every two 1's inserts a zero. 0110101100 cor

suming that bit stuffir sequence 01110110 as (B) (C) Sol. 0111 is flag 011101100 011010110 (D) 0110101100 So, after every two 1's inserts a zero. 0110101100 Correct option is (D). A bit stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the outp string after stuffing is 01111100101 then input bit string is (A) 0111110100 (B) 0111110101 (D) (C) 0111111101 0111111111 Sol. Flag is 01111110 Output string 01111100101 So, Input string is 0111110101 Option (B) is correct. Q. Consider bit stream 01111010111111011110111 Using bit stuffing how many 0's should be stuffed in data using a flag pattern of '0111 (B) 4 (A) 5 (D) 6 (C) 3 Sol. Flag 01111 Bit Stream -0111 1010111 1 11 0111 10111 11 0 0 0 0 0 So, 0'S inserted are 5