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
We have talked about blocking locks, which voluntarily yield, and spinlocks, which just spin until they acquire the lock. At ?rst, it seems like spinlocks are verywasteful, and tha
what operating system mean
When you run a program on your UNIX system, the system prepares a special environment for that program. This environment owns everything needed for the system to execute the progra
When programming with threads, there are three very common mistakes that programmers often make: 1. locking twice (depending on the system and type of lock, can cause crashes, h
Define Overflow Chaining Another method will divide the pre-allocated table into two sections: the primary area to determine which keys are mapped and an area for collisions, g
What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti
Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.
Explain the Real Time Operating System A real-time operating system comprises definite, fixed time constraints. Processing should be done in the defined constraints, or the sys
Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The
Explain in detail about ipc in linux
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