NPTEL Introduction to Operating Systems Assignment 7 Answer

We Discuss About That NPTEL Introduction to Operating Systems Assignment 7 Answer

NPTEL Introduction to Operating Systems Assignment 7 Answer – Here All The Questions and Answers Provided to Help All The Students and NPTEL Candidate as a Reference Purpose, It is Mandetory to Submit Your Weekly Assignment By Your Own Understand Level.

Are you looking for the Assignment Answers to NPTEL Introduction to Operating Systems Assignment 7 Answer? If Yes You are in Our Great Place to Getting Your Solution, This Post Should be help you with the Assignment answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Introduction to Operating Systems Assignment 7 Answer”

NPTEL Introduction to Operating Systems Assignment

ABOUT THE COURSE :
Operating systems (OS) provide the crucial interface between a computer’s hardware and the applications that run on it. It allows us to write programs without bothering much about the hardware. It also ensures that the computer’s resources such as its CPU, hard disk, and memory, are appropriately utilized. In this course, we dwell into how the OS manages to do all this in an efficient manner. This is an introductory course, for students with prior knowledge of computer organization. The course is based on an OS called xv6, which in many ways is similar to the Linux operating systems.

INTENDED AUDIENCE B.E./Msc (Computer Science)

PRE-REQUISITES Good knowledge of C, Computer Organization and Architecture, x86 Assembly level programming.

This course can have Associate in Nursing unproctored programming communication conjointly excluding the Proctored communication, please check announcement section for date and time. The programming communication can have a weightage of twenty fifth towards the ultimate score.

Final score = Assignment score + Unproctored programming exam score + Proctored Exam score
  • Assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
  • ( All assignments in a particular week will be counted towards final scoring – quizzes and programming assignments). 
  • Unproctored programming exam score = 25% of the average scores obtained as part of Unproctored programming exam – out of 100
  • Proctored Exam score =50% of the proctored certification exam score out of 100
YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF ASSIGNMENT SCORE >=10/25 AND
UNPROCTORED PROGRAMMING EXAM SCORE >=10/25 AND PROCTORED EXAM SCORE >= 20/50. 
If any one of the 3 criteria is not met, you will not be eligible for the certificate even if the Final score >= 40/100. 

CHECK HERE OTHERS NPTEL ASSIGNMENTS ANSWERS 

BELOW YOU CAN GET YOUR NPTEL Introduction to Operating Systems Assignment 7 Answer 2022? :

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW
JoinScishowEngineerTelegram
Assignment not submitted

Consider a system with the above resource allocation graph. Answer the question 1 and 2 based on this graph.

1 point
The safe sequence of execution for the processes in the above figure is
 
 
 
 
Ans  – D
1 point
Consider a situation with the dining philosopher’s problem having n philosophers.  What is the minimum number of forks required to prevent a  deadlock?
 
 
 
 
Ans  – C

A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation.

1 point
The above allocation result in unsafe state of the process.
 
 
Ans  – B
1 point
Consider P1 has made a request of (1, 0, 2) , then what will be a safe sequence?
 
 
 
 
Ans  – B
Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW
JoinScishowEngineerTelegram

Consider a system with 6 processes, where each process needs 2 copies of Resource R. The maximum units of R required to cause deadlock is ————————
1 point
Ans  – 12

Consider a system with 6 processes, where each process needs 2 copies of Resource R.The minimum units of R for deadlock free is ———————.
1 point

Ans  – 2

Each process Pi where i = 1 … 9 is given as follows
  pi:   Repeat p10: Repeat
       P(Mutex)         V(Mutex)
        // Critical section   //critical section
       V(mutex)         V(mutex)

1 point
What is the largest number of processes that can be inside the critical section
 
 
 
 
Ans  – C

Consider a system has 3 process P1, P2, and P3. Process P1 needs 11 units of resource R; Process P2 needs 21 units of R and Process P3 needs 16 unit of R. What is the maximum unit of resource R that leads to deadlock?
1 point
Ans  – 21
1 point
Which of the following is false about User threads?
 
 
 
 
Ans  – D
Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW
JoinScishowEngineerTelegram
1 point
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T.
   Process P: Process P:
          while(1){  while(1){
             W:            Y:
                print ‘0’;    print ‘1’;
                print ‘0’;    print ‘1’;
             X:     Z:
         }
   Synchronization statements can be inserted only at points W,X,Y,Z. Which of the following can lead to an output starting with ‘00110011’ ?
 
 
 
 
Ans  – C
Yhaa You have done it but next? if YOU Want to your Others NPTEL Introduction to Operating Systems Assignment 7 Answer

Related Posts

Leave a Reply

Your email address will not be published.

adplus-dvertising