Experiment 1:

Character Count:

Enter the number of frames:3

Enter the number of characters into each frame[0]:5

Enter the number of characters into each frame[1]:6

Enter the number of characters into each frame[2]:5

Enter the 5 characters into the frame[0]:a

b
c
d
e

Enter the 6 characters into the frame[1]:f

g
h
i
j
k

Enter the 5 characters into the frame[2]:l

m
n
o
p
00000110-01100001-01100010-01100011-01100100-01100101-00000111-01100110-01100111-
01101000-01101001-01101010-01100011-00000110-01101100-01101101-01101110-01101111-
01110000

Character Stuffing:

Enter the stuffing character:m

Enter the starting delimiter:$

Enter the ending delimiter:&

Enter the number of frames:2

Enter the string into frame[0]:roshan

Enter the string into frame[1]:mallipeddi

The stuffed stream is as:m$roshanm&m$mmallipeddim&

The unstuffed stream is as:roshanmallipeddi
Bit Stuffing:

Enter the number of frames:3

Enter the stream of bits into the frame[0]:0101

Enter the stream of bits into the frame[1]:0110

Enter the stream of bits into the frame[2]:0101

The stuffed stream is 01111110010101111110011001111110010101111110
The unstuffed stream is 010101100101

Experiment 2:

Enter the frame:010101100101

Menu
1.CRC-12
2.CRC-16
3.CRC-CCIP
Enter your choice:3
the stuffed frame is: 0101011001011100001111110110

Experiment 3:

output:
Enter no. of vertices:9

Enter the adjacency matrix:

050000080
5 0 8 0 0 0 0 11 2
080704002
0 0 7 0 9 14 0 0 0
0 0 0 9 0 10 0 0 0
0 0 4 14 10 0 2 0
000002016
8 11 0 0 0 0 1 0 7
002000670

Enter the starting node:0

Enter the ending node:9

Distance=15
Path:0->8->9