Scribd
Upload
131 views

Computer Architecture Notes Sjit

1) Kernel mode and user mode provide protection by restricting user processes from directly accessing hardware and memory allocated to the kernel and other processes. This prevents processes from interfering with each other. 2) The command interpreter, also known as the shell, is separate from the kernel to provide convenience for users to interact with the operating system without compromising the security of the kernel. 3) Under certain circumstances like when a process accesses a memory page that is not loaded in RAM, a page fault occurs. When this happens, the operating system handles loading the required page from secondary storage to memory.

Uploaded by

The Smart Boy KungFuPawn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
131 views

Computer Architecture Notes Sjit

1) Kernel mode and user mode provide protection by restricting user processes from directly accessing hardware and memory allocated to the kernel and other processes. This prevents processes from interfering with each other. 2) The command interpreter, also known as the shell, is separate from the kernel to provide convenience for users to interact with the operating system without compromising the security of the kernel. 3) Under certain circumstances like when a process accesses a memory page that is not loaded in RAM, a page fault occurs. When this happens, the operating system handles loading the required page from secondary storage to memory.

Uploaded by

The Smart Boy KungFuPawn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

SET - 2

St. Joseph’s Institute of Technology

MODEL EXAM April 2020

Subject OPERATING SYSTEMS Subject Code CS8493


Branch CSE Semester IV
DURATION 3 hours MAX MARKS 100

Part – A (10 x 2 = 20 marks)


How does the distinction between kernel mode and user mode
1. C214.1 R
function as a rudimentary form of protection (security) system?
What is the purpose of the command interpreter? Why is it usually
2. C214.1 R
separate from the kernel?
Provide three programming examples in which
3. multithreading provides C214.2 U
better performance than a single-threaded solution.
Illustrate how a binary semaphore can be used to implement mutual
4. C214.2 R/Ap
exclusion among n processes.
Under what circumstances do page faults occur? Describe the
5. C214.3 R
actions taken by the operating system when a page fault occurs.
6. Discuss the hardware support required to support demand paging. C214.3 R
How does DMA increase system concurrency? How does it
7. C214.4 R
complicate hardware design?
8. Enlist the different types of directory structure. C214.4 U
9. Mention any two features of Linux file system. C214.5 R
10. What role does Dalvik play in Android development? C214.5 R

Part – B (5 x 13 = 65 marks)
11 i) What are system calls? Explain in detail about the
different types of system calls.(7)
C214.1 R
ii) What are the differences between a trap and an
interrupt? What is the use of each function?(6)
i) List five services provided by an operating system, and C214.1 R
explain how each creates convenience for users. In which
cases would it be impossible for user-level programs to
provide these services? Explain your answer. (6)
ii) Describe some of the challenges of designing operating
systems for mobile devices compared with designing
operating systems for traditional PCs. (4)
iii) In a multiprogramming and time-sharing environment, several
users share the system simultaneously. This situation can result in
various security problems.
a. What are two such problems?
b. Can we ensure the same degree of security in a time-shared
machine as in a dedicated machine? Explain your answer. (3)
i) Compare and contrast various type of schedulers.(5)
ii) Which of the following scheduling algorithms could
result in starvation ? C214.2 R/U/An
a) FCFS b) SJF c) RR
Detail with justification. (8)
12 i) What is a process ? Discuss components of process and
various states of a process with the help of a process state
transition diagram. (8)
C214.2 U/An
ii) Write the difference between user thread and kernel thread.
and describe the actions taken by a kernel to context-switch
between kernel level threads. (5)
Compare paging with segmentation in terms of the amount of
memory required by the address translation structures in order to C214.3 U/An
convert virtual addresses to physical addresses.
13 i) Describe free space management on i/o buffering and
blocking.
C214.3 R
ii) Describe buddy allocation system with neat diagram.

Explain the various disk space allocation methods with neat


C214.4 R
diagrams.
i) Consider a demand-paged computer system where the degree of
multiprogramming is currently fixed at four. The system was
recently measured to determine utilization of CPU and the paging
disk. The results are one of the following alternatives. For each
case, what is happening?
14
Can the degree of multiprogramming be increased to increase the
C214.4 R/Ap
CPU utilization? Is the paging helping?
a. CPU utilization 13 percent; disk utilization 97 percent
b. CPU utilization 87 percent; disk utilization 3 percent
c. CPU utilization 13 percent; disk utilization 3 percent (6)

ii) Explain file system mounting and protection in detail.(7)


Multithreading is a commonly used programming technique.
Describe three different ways to implement threads, and compare
these three methods with the Linux clone() mechanism. When C214.5 R
might using each alternative mechanism be better or worse than
using clones?
15
i) The Linux kernel does not allow paging out of kernel memory.
What effect does this restriction have on the kernel’s design?
What are two advantages and two disadvantages of this design C214.5 R/An
decision? (7)
ii) Explain the architecture of Android OS. (6)
Part – C (1 x 15 = 15 marks)
i) Compute the average waiting time for the processes
using non-preemptive SJF scheduling algorithm (5)
Process Arrival time Burst time
P1 0.0 7
P2 2.0 4
16 C214.2 U/Ap
P3 4.0 1
P4 5,0 4

ii) Outline a solution using semaphore to solve dining


philosopher problem. (10)
What is deadlock ? What are the necessary conditions for
deadlock to occur? Explain the deadlock prevention method of
handling deadlock.
Consider the following information about resources in a
system.
i) There are two classes of allocatable resource labeled R1
and R2
ii) There are two instances of each resource.
iii) There are four processes labeled p1 through p4
iv) There are some resource instance already allocated to
processes as follows

 One instance of R1 held by p2, another held


by p3
C214.2 U/Ap
 One instance of R2 held by p1, another held
by p4
v) Some processes have requested additional resources as
follows
 P1 wants one instance of R1
 P3 wants one instance of R2
1) Draw the resource allocation graph for this system
2) What is the state (runnable, waiting ) of each process? For
each process that is waiting indicate what it is waiting for.
3) Is this system deadlocked? If so, state which processes are
involved. if not, give an execution sequence that eventually
ends, showing resource acquisiton and releasing at each
step.

You might also like