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
what is independent process? distinguished between independent process and co-operating process
a summary of what operating system do
Q. What system calls have to be implementing by a command interpreter or shell in order to start a new process? Answer: In the UNIX systems a fork system call followed by an ex
What is the basic approach of page replacement? If no frame is free is available, find one that is not presently being used and free it. A frame can be freed by writing its con
How the Nested Macro calls are expanded LIFO (Last in First out)
FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute
Regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks take place about twice per month and the operator must
Write a short note on disk structure Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer.
fork and join syntax in java
What is a buddy system? We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecti
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