COURSE OBJECTIVES:
- To understand the Concept of Data link layer framing Methods and different CRC Polynomials.
- Identify the purpose of Scheduling Algorithms, page replacements and Deadlock Algorithm.
COURSE OUTCOMES:
After successful completion of this course, the students will be able to:
CO 1: Implement routing algorithms.
CO 2: Do the error checking by using CRC polynomials.
CO 3: Solve the experiments on scheduling Algorithms and page replacement algorithms.
CO 4: Handle the deadlocks, like prevention and detection.
List of Experiments in CN
1. Implement the data link layer framing methods such as character count, 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 through 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
List of Experiments in OS
1 Simulate the following CPU scheduling algorithm
a) FCFS b) SJF c) Round Robin d) Priority
2 Simulate all page replacement algorithms
a) FIFO b) LRU c)OPTIMAL
3 Simulate all file organization techniques
a) Single level b)Two level
4 Simulate Bankers Algorithm for Deadlock Avoidance