subject:-networking operating system and configure20% weight need good workthere is no reference...

Question

subject:-networking operating system and configure20% weight need good workthere is no reference style mentioned in file as u can refer assignment file

Microsoft Word - ITSA2003 Assignment-April2020 ITSA2003 Network Operating System and Configuration Assignment March 2020 ITSA2003 Assignment Copyright © 2015-2020 VIT, All Rights Reserved. 2 Question 1: Banker Algorithm A Banker algorithm is deadlock avoidance algorithm used for resource allocation. In the following example, there are five processes, P1, P2, P3, P4, P5 and three resource types A (with 10 instances), B (with 5 instances) and C (with 7 instances). The Available, Allocation and MAX matrices are given as: Available A B C 3 3 2 Allocation A B C P0 0 1 0 P1 2 0 0 P2 3 0 2 P3 2 1 1 P4 0 0 2 MAX A B C 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3 a. Compute the Need matric b. After calculating the Need matric, show that the current state is safe by showing a safe sequence of processes. ITSA2003 Assignment Copyright © 2015-2020 VIT, All Rights Reserved. 3 Question 2: Page Replacement Algorithms a. Page replacement algorithm decide which memory pages to page out when a page of memory needs to be allocated. And it happens when a page fault occurs, and a free page cannot be used to satisfy the allocation. Based on this statement, explain the different page replacement algorithms and how are they different from each other. What are the advantages and disadvantages of using those algorithms? b. Given a page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6. If we consider the frame size is 4. What is number of page faults in optimal page replacement algorithm? Question 3: Process Scheduling Algorithms a. Explain different types of process scheduling algorithms. If you have a very long process and short processes keep coming up then names any of these algorithms which leads to starvation. b. Using the Highest Response Ratio Next (HRRN) algorithm, you are required to perform the following tasks: i. Develop Gantt Chart showing execution of the processes given in the following table. ii. Calculate Average Waiting Time for the following processes. Thread Arrival Time CPU Burst Time A 0 3 B 2 6 C 2 5 D 5 1 E 3 5 ITSA2003 Assignment Copyright © 2015-2020 VIT, All Rights Reserved. 4 Note: In this algorithm, we need to find the response ratio of all available threads/processes and select the one with the highest Response Ratio. Response Ratio = (W + S)/S Question 4: Operating System Configuration and Standards a. What is the REACT methodology. Explain the different steps of REACT methodology. b. 802.11 refers to a family of specifications developed by the IEEE for wireless LAN (WLAN) technology. Explain in details different specifications in the 802.11 family in terms of transmission speed and frequency.

tfth-tutorial-jhmrg45u-2r1rlvh0.pdf

Amit · Accepted Answer

Title of the assignment: 
Student’s name:
Student ID:
Professor’s name:
Course title: 
Date: 5/17/2020
 Table of Contents
1.	Answer 1	3
2.	Answer 2	4
3.	Answer 3	5
4.	Answer 4	7
5.	References:	9
1. Answer 1 
a)  
The Need matric is calculated by subtracting allocated resources from Max. As, Max matric and allocation matric are already provided, so, need matric will be: 
	Process 
	A
	B
	C
	P0
	7-0=7
	5-1=4
	3-0=3
	P1
	3-2=1
	2-0=2
	2-0=2
	P2
	9-3=6
	0-0=0
	2-2=0
	P3
	2-2=0
	2-1=1
	2-1=1
	P4
	4-0=4
	3-0=3
	3-2=1
Thus, the final need matric will be: 
	Process 
	A
	B
	C
	P0
	7
	4
	3
	P1
	1
	2
	2
	P2
	6
	0
	0
	P3
	0
	1
	1
	P4
	4
	3
	1
b)  
As need is less than max for all the processes, so, the safe process sequence will be: 
 
2. Answer 2
a)  
The effective use of memory management in OS requires proper paging system which is possible with different page replacement algorithms. Some of these algorithms with advantages and disadvantages are explained below: 
· FIFO: This algorithm maintains “First In First Out” mechanism for its execution. A queue of pages is maintained in this algorithm to maintain effective track of incoming pages. Oldest page in memory stake is replaced for finding the page fault. It is simple to implements, so, its simple implementation is main advantage but the last page have to wait long is its main disadvantage. 
· LIFO: This algorithm maintains “Last In First Out” mechanism for its execution. A stack of pages is maintained in this algorithm to maintain effective track of incoming pages. Newest page in memory stake is replaced for finding the page fault. It is simple to implements, so, its simple implementation is main advantage but the first page have to wait long is its main disadvantage. 
· LRU: This algorithm maintains “Least recently used” mechanism for its execution. A stack of pages is maintained in this algorithm to maintain effective track of incoming pages. Least used page in memory stake is replaced for finding the page fault. It is simple to implements, so, its simple implementation is main advantage but an increased page fault shows its main disadvantage. 
b)  
The given reference string is:

Microsoft Word - ITSA2003 Assignment-April2020 ITSA2003 Network Operating System and Configuration Assignment March 2020 ITSA2003 Assignment Copyright © XXXXXXXXXXVIT, All Rights Reserved. 2 Question...

Answer To: Microsoft Word - ITSA2003 Assignment-April2020 ITSA2003 Network Operating System and Configuration...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment