Exam Details
Subject | operating system | |
Paper | ||
Exam / Course | m.c.a.science | |
Department | ||
Organization | solapur university | |
Position | ||
Exam Date | November, 2016 | |
City, State | maharashtra, solapur |
Question Paper
Direct Second Year Students (Bridge Course) M.C.A. (Engg.)
Examination, 2016
Paper II OPERATING SYSTEM
Day and Date Tuesday, 13-12-2016 Total Marks 100
Time 10.30 a.m. to 1.30 p.m.
Instructions Figures to the right indicate marks.
All questions are compulsory.
1. Multiple Choice Questions 20
One of the most important aspects of operating system is the ability to
Single program Multi-program
Both and None of the above
Multiprocessor systems are known as systems.
Parallel Tightly coupled
Both and All of the above
The operating system is responsible for
Scheduling processes
Suspending processes
Process synchronization
All of the above
A local area network connects computers within
Room A floor
A building All of the above
An operating system provide an environment for the of programs.
Compilation Execution
Both and None of the above
SLR-ER 38
The main advantage of the layered approach for operating system structure
is of construction and debugging.
Simplicity Reusability
Computability None of the above
Each process is represented by
Process control block Task control block
Both and None of the above
Dispatcher is a module that gives control of the CPU to the process selected
by the scheduler.
Short-term Priority
Round robin None of the above
The important feature of the system is that, when one process is executing in
a critical section is to be allowed to execute in its critical
section.
One other process Two other process
No other processes None of the above
10) A semaphore S is variable that is accessed only through two
atomic operators wait and signal().
An integer Character
Real None of the above
11) Swapping requires a backing store. The backing store is commonly
Main memory Cache memory
Fast disk memory None of the above
12) Allocates the smallest hole that is enough. This strategy produces the smallest
leftover hole is
First fit Best fit
Worst fit None of the above
SLR-ER 38
13) is a memory management scheme that supports user view
of memory.
Paging Fragmentation
Segmentation All of these
14) A demand paging system is similar to a paging system with swapping where
processes reside in
Secondary memory Main memory
Primary memory All of these
15) Optimal page replacement algorithm has the page fault rate.
Optimum Lowest
Highest None of these
16) is a named collection of related information that is recorded
on secondary storage.
Process File
Both and None of these
17) The user may want to erase the content of the file but keep its attributes is
Writing a file Deleting a file
Truncating file None of these
18) Partitions are known as
Slices Minidisks
Both and None of these
19) The free space list is implemented as a
Bit vector Byte vector
Block vector None of these
20) Before a disk can store data, it must be divided into sectors that the disk
controller can read and write. This process is called formatting.
Low level Physical
Both and None of these
SLR-ER 38
2. Write short note on (any four)
Multi-programming.
Inter-process communication.
Round robin algorithm.
Contiguous allocation.
Access matrix.
3. Explain in detail multilevel feedback queue scheduling. 10
4. What is a critical section problem Explain in brief synchronization hardware. 10
5. Explain in brief memory space segmentation. 10
6. What do you mean by paging Comment on demand paging performance. 10
7. Explain the terms disk management and free space management. 10
8. Distinguish between distributed and network operating systems. 10
Examination, 2016
Paper II OPERATING SYSTEM
Day and Date Tuesday, 13-12-2016 Total Marks 100
Time 10.30 a.m. to 1.30 p.m.
Instructions Figures to the right indicate marks.
All questions are compulsory.
1. Multiple Choice Questions 20
One of the most important aspects of operating system is the ability to
Single program Multi-program
Both and None of the above
Multiprocessor systems are known as systems.
Parallel Tightly coupled
Both and All of the above
The operating system is responsible for
Scheduling processes
Suspending processes
Process synchronization
All of the above
A local area network connects computers within
Room A floor
A building All of the above
An operating system provide an environment for the of programs.
Compilation Execution
Both and None of the above
SLR-ER 38
The main advantage of the layered approach for operating system structure
is of construction and debugging.
Simplicity Reusability
Computability None of the above
Each process is represented by
Process control block Task control block
Both and None of the above
Dispatcher is a module that gives control of the CPU to the process selected
by the scheduler.
Short-term Priority
Round robin None of the above
The important feature of the system is that, when one process is executing in
a critical section is to be allowed to execute in its critical
section.
One other process Two other process
No other processes None of the above
10) A semaphore S is variable that is accessed only through two
atomic operators wait and signal().
An integer Character
Real None of the above
11) Swapping requires a backing store. The backing store is commonly
Main memory Cache memory
Fast disk memory None of the above
12) Allocates the smallest hole that is enough. This strategy produces the smallest
leftover hole is
First fit Best fit
Worst fit None of the above
SLR-ER 38
13) is a memory management scheme that supports user view
of memory.
Paging Fragmentation
Segmentation All of these
14) A demand paging system is similar to a paging system with swapping where
processes reside in
Secondary memory Main memory
Primary memory All of these
15) Optimal page replacement algorithm has the page fault rate.
Optimum Lowest
Highest None of these
16) is a named collection of related information that is recorded
on secondary storage.
Process File
Both and None of these
17) The user may want to erase the content of the file but keep its attributes is
Writing a file Deleting a file
Truncating file None of these
18) Partitions are known as
Slices Minidisks
Both and None of these
19) The free space list is implemented as a
Bit vector Byte vector
Block vector None of these
20) Before a disk can store data, it must be divided into sectors that the disk
controller can read and write. This process is called formatting.
Low level Physical
Both and None of these
SLR-ER 38
2. Write short note on (any four)
Multi-programming.
Inter-process communication.
Round robin algorithm.
Contiguous allocation.
Access matrix.
3. Explain in detail multilevel feedback queue scheduling. 10
4. What is a critical section problem Explain in brief synchronization hardware. 10
5. Explain in brief memory space segmentation. 10
6. What do you mean by paging Comment on demand paging performance. 10
7. Explain the terms disk management and free space management. 10
8. Distinguish between distributed and network operating systems. 10
Other Question Papers
Subjects
- .net
- artificial intelligence
- computer communication network
- computer graphics
- computer oriented statistics
- data mining and warehouse
- data structures
- database management system
- digital circuits and microprocessors
- digital image processing
- discrete mathematical structures
- distributed operating system
- finite automata
- introduction to computers
- java programming
- management
- mobile computing
- network security
- numerical analysis
- object oriented programming using c++
- opeartions research
- operating system
- pattern recognition mobile computing
- programming using - c
- programming with php
- software engineering
- system software
- uml
- web design techniques
- web technology