BSc CS Sem 3 BSc CS Semester 3 (2020 2021) 2021 OS Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
2021 - TOC
Semester-end · BSc CS Semester 3 (2020 2021)
→
Newer exam
2021 - IoT
Semester-end · BSc CS Semester 3 (2020 2021)
→
Questions asked in this paper
An system is
a program that acts as an
1 interface between the Cooperating Operating Programming | Computer Operating
software and the computer
A thread is also called Process(LWP)| Process(HWP) Process Program Light Weight Process(LWP)
A process can be single multithreaded multithreaded above both single and multithreaded
A process having multiple | it can do more | it can do only one has to use only
at a time much faster process mentioned can do more than one task at a time
5 | does not contain which of Bootstrap
the following? Code stack program Data Bootstrap program
supported and are supported
7 managed can be supported the kernel
directly by the] are managed
operating directly by the without kernel of the} cannot be supported and managed
Kernel Threads system operating system support above directly by the operating system
In a pure Kernel Level Application Program
Thread facility all of work
of thread management is
done by the Kernel Threads Kernel
Event for which a thread
block occurs the thread is
moved to the ready Buffer Memory Registers Queue Queue
Which of the following two receive &
operations are provided by | write & delete & receive | send & delete send
the IPC facility? message message message message receive & send message
Each node in clustered
11 system of the computer neighboring One or
system monitors itself One other node node more nodes One or more nodes
Main Memory refers to
a memory that is the
12 internal memory to the
computer virtual physical short flash physical
occurs in a dynamic
13 when most of the free blocks
are too small to satisfy any
Table is the data
A Page Table is to store the
The mapping from virtual
must be fast slow very slow very fast slow
The mapping from virtual
must be fast slow very slow very fast fast
page that has Replace the page
19 not been used the page that
What is the Optimal page — for that has been used be used |Replace the page that
replacement algorithm? a long time for a long time for along time mentioned not be used for a long time
20 |Virtual memory is normally all of the
implemented by demand paging |buses virtualization mentioned |demand paging
The instruction being
21 Jexecuted, must be in physical physical & logical |none of the
The difference between General
allocated and required memory External Internal Overall Fragmentatio
the job that
23 first executes has
the job executes the job] first executes the | maximum
came in last in | that came in first in| job that needs |first executes the job that came in first in
Which one of the following
24] can not be scheduled by the kernel level none of the
request to enter after a process has made a request to
25 |Bounded waiting implies that its critical enter its critical section and before the
there exists a bound on the section and before a process request is granted
number of times a process is before the when another has made a
allowed to enter its critical request is processis to enter its] none of the
a program that acts as an
1 interface between the Cooperating Operating Programming | Computer Operating
software and the computer
A thread is also called Process(LWP)| Process(HWP) Process Program Light Weight Process(LWP)
A process can be single multithreaded multithreaded above both single and multithreaded
A process having multiple | it can do more | it can do only one has to use only
at a time much faster process mentioned can do more than one task at a time
5 | does not contain which of Bootstrap
the following? Code stack program Data Bootstrap program
supported and are supported
7 managed can be supported the kernel
directly by the] are managed
operating directly by the without kernel of the} cannot be supported and managed
Kernel Threads system operating system support above directly by the operating system
In a pure Kernel Level Application Program
Thread facility all of work
of thread management is
done by the Kernel Threads Kernel
Event for which a thread
block occurs the thread is
moved to the ready Buffer Memory Registers Queue Queue
Which of the following two receive &
operations are provided by | write & delete & receive | send & delete send
the IPC facility? message message message message receive & send message
Each node in clustered
11 system of the computer neighboring One or
system monitors itself One other node node more nodes One or more nodes
Main Memory refers to
a memory that is the
12 internal memory to the
computer virtual physical short flash physical
occurs in a dynamic
13 when most of the free blocks
are too small to satisfy any
Table is the data
A Page Table is to store the
The mapping from virtual
must be fast slow very slow very fast slow
The mapping from virtual
must be fast slow very slow very fast fast
page that has Replace the page
19 not been used the page that
What is the Optimal page — for that has been used be used |Replace the page that
replacement algorithm? a long time for a long time for along time mentioned not be used for a long time
20 |Virtual memory is normally all of the
implemented by demand paging |buses virtualization mentioned |demand paging
The instruction being
21 Jexecuted, must be in physical physical & logical |none of the
The difference between General
allocated and required memory External Internal Overall Fragmentatio
the job that
23 first executes has
the job executes the job] first executes the | maximum
came in last in | that came in first in| job that needs |first executes the job that came in first in
Which one of the following
24] can not be scheduled by the kernel level none of the
request to enter after a process has made a request to
25 |Bounded waiting implies that its critical enter its critical section and before the
there exists a bound on the section and before a process request is granted
number of times a process is before the when another has made a
allowed to enter its critical request is processis to enter its] none of the
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Quick Help
No. The full paper opens straight away, with no login and nothing to pay.
Related Resources
Something wrong with this paper? Report it.
Connected Papers
BSc CS / Sem 3 · 72 papers
2017 - ATKT Combinatorics And Graph Theory
2017 - ATKT Database Management System
2017 - ATKT Operating System
2017 - ATKT Skill Enhancement Web Programming
2016 - ATKT COMPUTER III
2016 - ATKT COMPUTER II
2015 - ATKT Computer I
2014 - Comp I ADD
2014 - Comp II ADD 15 1
2014 - Comp III ADD
2014 - ATKT Comp III
2014 - ATKT Maths I
Questions? Email contact@munotes.in
Done!