Ics2208;Operating Systems Ii Question Paper
Ics2208;Operating Systems Ii
Course:Bachelor Of Computer Science
Institution: Meru University Of Science And Technology question papers
Exam Year:2012
QUESTION ONE (30 MARKS)
a) Discuss two categories of MIMD computers. (2 Marks) b) Describe the characteristics of distributed systems. (4 Marks) c) Describe the goal of distributed shared memory. (3 Marks) d) Define an immutable file. (2 Marks) e) Describe a remote procedure call. (3 Marks) f) Describe the disadvantages of non-blocking primitives. (4 Marks) g) Describe four reasons why diskless workstations are popular. (4 Marks) h) Distinguish between the Writehead log and Private Workspace. (3 Marks) i) Distinguish between the Upload/Download and Remote Access models. (3 Marks)
QUESTION TWO (20 MARKS)
a) Describe the remote access model. (3 Marks) b) Discuss file naming transparency. (4 Marks) c) Distinguish between explicit file replication and lazy replication. (3 Marks) d) Describe the following cache consistency modes: i. Sequential consistency ii. Entry consistency iii. Weak consistency (6 Marks) e) Using an appropriate diagram, illustrate the behaviour of two processes for memory that is not consistent. (4 Marks)
2
QUESTION THREE (20 MARKS)
a) Describe remote procedure call steps. (5 Marks) b) One class of failure that can occur in RPC systems in the reply message from the server to the client getting lost. Describe the suggested solutions to address this problem. (4 Marks) c) Describe three methods of addressing processes and outline their disadvantages. (3 Marks) d) Discuss buffered primitives and state their disadvantages. (5 Marks) e) Discuss three methods of addressing processes and state their disadvantages. (3 Marks)
QUESTION FOUR (20 MARKS)
a) Describe five kinds of transparency in distributed systems. (6 Marks) b) Describe the advantages and disadvantages of implementing threads in the user space. (4 Marks) c) Discuss scheduler activations. (4 Marks) d) Compare and contrast the following algorithms. (3 Marks) i. Local vs. Global algorithms ii. Optimal vs. suboptimal algorithms. (6 Marks)
QUESTION FIVE (20 MARKS)
a) Describe three types of concurrency control algorithms. (3 Marks) b) The diagram below shows processes 1-15. Some processes are waiting for local resources, while others are waiting for resources located on different machines. Invoke the Chandy-Misra-Haas algorithm on this scenario. (5 Marks)
More Question Papers