PLEASE GIVE FEEDBACK 👇
1). Implement the data link layer framing methods such as
a). Implement character count on given data
b). Implement character stuffing on given data
c). Bit stuffing on given binary data
2).Implement on a data set of characters
the three CRC polynomials CRC 12, CRC 16 and CRC CCIP
3). Implement
Dijkstra’s algorithm to compute the shortest path thru a graph
4 ).Take
an example subnet graph with weights indicating delay between nodes
5 ). Now
obtain Routing table art each node using distance vector routing algorithm
