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 an operating system?
Explain Rehashing to Handle Collision Rehashing: Re-hashing schemes make use of a second hashing operation while there is a collision. If there is an additional collision, we
UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. With the notes under code. Its exactly "programming project 1 - Unix Shell and History Fea
what is the need-to-know principle? why is it important for a protection system to adhere to this principle?
Under what circumstances would a user be better off using a time-sharing system, rather than a personal computer or single-user workstation? When there are some other users, th
Operating Systems have evolved tremendously in the last few decades. The first approach for building Operating Systems, taken during the 40s through early 60s, was to allow only on
Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.
Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e
To evade race condition, the maximum number of processes that may be at the same time inside the critical section is The maximum number of processes which may be at the same t
properies of Batch oriented and interactive operating system.
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