Subject Code:55609 L:0 T/P/D:3 Credits:2 Int. Marks:25 Ext. Marks:50 Total Marks:75
List of Experiments:
Part-A
1. Implement the data link layer farming methods such as character, character stuffing and bit stuffing.
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. Now obtain Routing table art each node using distance vector routing algorithm
5. Take an example subnet of hosts. Obtain broadcast tree for it.
6. Take a 64 bit playing text and encrypt the same using DES algorithm.
7. Write a program to break the above DES coding
8. Using RSA algorithm Encrypt a text data and Decrypt the same .
Part -B
1. Simulate the following CPU scheduling algorithms
a) Round Ratlin b) SJFc) FCFS d) Priority
2. Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
3. Simulate MVT and MFT
4. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
5. Simulate Bankers Algorithm for Dead Lock Avoidance
6. Simulate Bankers Algorithm for Dead Lock Prevention
7. Simulate all page replacement algorithms
a) FIFO b) LRU c) LFUEtc....
8. Simulate Paging Technique of memory management