Scribd
Upload
2 views3 pages

Mta Csbs2 Operating System Suggestion[1]

The document outlines a mid-term assessment for B.Tech CSBS 2nd year students on the subject of Operating Systems, consisting of multiple-choice questions covering key concepts such as CPU scheduling algorithms, deadlock conditions, and process states. The assessment is designed to evaluate students' understanding of operating system fundamentals within a 40-minute time frame for a total of 20 marks. Each question presents options related to operating system functionalities and principles.

Uploaded by

harshitaj2022
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
2 views3 pages

Mta Csbs2 Operating System Suggestion[1]

The document outlines a mid-term assessment for B.Tech CSBS 2nd year students on the subject of Operating Systems, consisting of multiple-choice questions covering key concepts such as CPU scheduling algorithms, deadlock conditions, and process states. The assessment is designed to evaluate students' understanding of operating system fundamentals within a 40-minute time frame for a total of 20 marks. Each question presents options related to operating system functionalities and principles.

Uploaded by

harshitaj2022
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

MID TERM ASSESSMENT

B.TECH CSBS 2ND YEAR (4TH SEM)

SUBJECT: OPERATING SYSTEM

SUGGESTION

Time : 40 Minutes Full marks : 20.

1. What is an operating system?


a) interface between the hardware and application programs
b) collection of programs that manages hardware resources
c) system service provider to the application programs
d) all of the mentioned
2. In Operating Systems, which of the following is/are CPU scheduling algorithms?
a) Priority
b) Round Robin
c) Shortest Job First
d) All of the mentioned
3. CPU scheduling is the basis of ___________
a) multiprogramming operating systems
b) larger memory sized systems
c) multiprocessor systems
d) none of the mentioned
4. Which one of the following is not true?
a) kernel remains in the memory during the entire computer session
b) kernel is made of various modules which can not be loaded in running operating system
c) kernel is the first part of the operating system to load into memory during booting
d) kernel is the program that constitutes the central core of the operating system
5. In operating system, each process has its own __________
a) open files
b) pending alarms, signals, and signal handlers
c) address space and global variables
d) all of the mentioned
6. In a timeshare operating system, when the time slot assigned to a process is completed, the
process switches from the current state to?
a) Suspended state
b) Terminated state
c) Ready state
d) Blocked state
7. When a process is in a “Blocked” state waiting for some I/O service. When the service is
completed, it goes to the __________
a) Terminated state
b) Suspended state
c) Running state
d) Ready state
8. For an effective operating system, when to check for deadlock?[1]
a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned
9. A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular
wait condition can never exist.
a) operating system
b) resources
c) system storage state
d) resource allocation state
Whenever a process needs I/O to or from a disk it issues a ______________
a) system call to the operating system
b) a special procedure
c) system call to the CPU
d) all of the mentioned
10. In Unix, which system call creates the new process?
a) create
b) fork
c) new
d) none of the mentioned
11. Which of the following condition is required for a deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned
12. Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
13. For an effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned
14. problem encountered in multitasking when a process is perpetually denied necessary resources
is called ____________
a) deadlock
b) starvation
c) inversion
d) aging.
15. . The FCFS algorithm is particularly troublesome for ____________
a) operating systems
b) multiprocessor systems
c) time sharing systems
d) multiprogramming systems
16. Swapping _______ be done when a process has pending I/O, or has to execute I/O operations
only into operating system buffers.
a) must never
b) maybe
c) can
d) must
17. The operating system is responsible for?
a) bad-block recovery
b) booting from disk
c) disk initialization
d) all of the mentioned
18. The operating system maintains a ______ table that keeps track of how many frames have been
allocated, how many are there, and how many are available.
a) memory
b) mapping
c) page
d) frame
19. In real time operating system ____________
a) process scheduling can be done only once
b) all processes have the same priority
c) kernel is not required
d) a task must be serviced by its deadline period
20. The priority of a process will ______________ if the scheduler assigns it a static priority.
a) depends on the operating system
b) change
c) remain unchanged
d) none of the mentioned

You might also like