Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Question:
(a) Answer the following questions based on the code snippet below.
1. int main (int argc, char *argv[]) 2. { 3. 4. pid_t processId; 5. 6. processId = fork (); 7. 8. 9. if (processId == 0) { 10. if (execl ("/usr/bin/ls", "ls", 0) == -1) { 11. perror ("execl failed "); 12. exit (1); 13. } 14. exit (0); 15. 16. } else { // processId greater than 0 case 17. wait (0); 18. exit (0); 19. } 20. return 0; 21. }
(i) Explain what happens after line 6 is executed.
(ii) Who (parent or child) executes code between lines 10-14?
(iii) Explain what is happening at line 10.
(iv) What is happening at line 17?
(b) Discuss why we have different processor modes and how these modes are used in typical operating systems.
(iii) (c) (i) What is meant by the term ‘affinity' in processor sheduling?
(ii) Discuss briefly the major issues that need to be addressed in designing multiprocessor operating systems.
Discuss any two of the following multiprocessor scheduling strategies
Explain Structure The Grammar for programming language is a formal description of Structure
How Memory utilization factor shall be computed Memory utilization factor shall be defined as Memory in use/total memory connected
a program that can do cpu scheduling algorithm priority using javascript or php to display gaant chart and calculate waiting and average waiting time
What is the use of FIFOs in client-server applications
Concept of Reentrancy It is a useful, memory-saving method for multiprogrammed timesharing machines. A Reentrant method is one in which multiple clients can share a singl
Determining the time quantum for a job is a critical task. Given the assumptions that the average switching time between processes is s, and the average amount of time an I/O bo
Q. Illustrate the function of Loader? A loader is a routine which loads an object program and prepares it for execution. There are many loading schemes: relocating, absolute an
Q. Could you replicate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes describe how you
Q. It is occasionally said that tape is a sequential-access medium whereas magnetic disk is a random-access medium. In fact the correctness of a storage device for random access d
Several schemes available are as follows: Pipes : One-way communication process through which different process can interact. The problem is that the two processes could have
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd