CENTURION UNIVERSITY OF TECHNOLOGY & MANAGEMENT

ANDHRA PRADESH

EXAMINATION CELL

SUBJECT NAME: (OPERATING SYSTEM CONCEPTS)

SUBJECT CODE: CUTM1032

MODULE NO: 6
S. MCQ
NO
1 1. Which one of the following is not shared by
threads?
A program counter

B Stack Pointer

C Both A and B YES

D none of the mentioned

2 A process can be ___________

A Single threaded
B Multithreaded
C both single threaded and multithreaded YES
D none of the mentioned
3 If one thread opens a file with read privileges then
___________
A other threads in the another process can also read
from that file
B other threads in the same process can also read from YES
that file
C any other thread cannot read from that file
D all of the mentioned

4 The time required to create a new thread in an

existing process is ___________
A greater than the time required to create a new process
B less than the time required to create a new process YES
C equal to the time required to create a new process
D none of the mentioned
5 When the event for which a thread is blocked
occurs?
 A thread moves to the ready queue YES
B thread remains blocked
C thread completes
D a new thread is provided
6 The jacketing technique is used to ___________
A convert a blocking system call into non blocking YES
system call
B create a new thread
C communicate between threads
D terminate a thread
7 Termination of the process terminates ___________
A first thread of the process
B first two threads of the process
C all threads within the process YES
D no thread within the process
8 Which one of the following is not a valid state of a
thread?
A running
B Parsing YES
C ready
D blocked

9 The register context and stacks of a thread are

deallocated when the thread?
A terminates YES
B blocks
C unblocks
D spawns
10 Thread synchronization is required because
___________
A all threads of a process share the same address space
 B all threads of a process share the same global
variables
C all threads of a process can share the same files
D all of the mentioned YES
11 The model in which many kernel thread is mapped to
many user-level threads is called ___________
A Many to One model
B One to Many model
C Many to Many model YES
D One to One model
12 The model in which one user-level thread is mapped
to one kernel level threads is called ___________
A Many to One model

B One to Many model

C Many to Many model

D One to One model YES
13 In the Many to One model, if a thread makes a
blocking system call ___________

A the entire process will be blocked YES

B a part of the process will stay blocked, with the rest
running
C the entire process will run
D none of the mentioned

14 The One to One model allows ___________

A increased concurrency YES

B decreased concurrency

C increased or decreased concurrency

D concurrency equivalent to other models

15 Copying a process from memory to disk to allow
 space for other processes is called________
A Deadlock
B Swapping YES
C Page fault
D Demand paging
16 Which of the following types of operating systems is
non-interactive?
A Multitasking operating system
B Multi –user operating system
C Batch processing operating system YES
D Multi programming operating system
17 With respect to operating system, which of the
following is NOT a valid process state?
A Ready
B Waiting
C Running
D Starving YES
18 The program in the operating system that does
processor management is called_____
A Traffic controller YES
B Dispatcher
C Processor scheduler
D Job scheduler

19 Multi –threading on a multi–cpu machine

A Decreases concurrency
B Increases concurrency YES
C Doesn’t affect the concurrency
D Can increase or decrease the concurrency
20 What name is given to a program in execution?
A Process YES
B Data load
 C Program

D mutex
21 Which module gives control of the CPU to the
process selected by the short-term scheduler?
A Dispatcher YES
B Interrupt
C Scheduler

D Trashing
22 Round robin scheduling falls under the category of
____________
A Non-preemptive scheduling
B Preemptive scheduling YES

C All of the mentioned

D None of the mentioned

23 With round robin scheduling algorithm in a time

shared system ____________
A using very large time slices converts it into First YES
come First served scheduling algorithm
B using very small time slices converts it into First
come First served scheduling algorithm
C using extremely small time slices increases
performance
D using very small time slices converts it into Shortest
Job First algorithm

24 Complex scheduling algorithms ____________

A are very appropriate for very large computers YES
B use minimal resources

C use many resources

D all of the mentioned

25 What is FIFO algorithm?

 A first executes the job that came in last in the queue
B first executes the job that came first in the queue YES

C rst executes the job that needs minimal processor

D first executes the job that has maximum processor

needs

26 What is Scheduling?
A allowing a job to use the processor YES
B making proper use of processor

C all of the mentioned

D none of the mentioned

27 Orders are processed in the sequence they arrive if
_______ rule sequences the jobs
A earliest due date
B slack time remaining
C first come, first served YES
D critical ratio
28 Which of the following algorithms tends to minimize
the process flow time?
A First come First served

B Shortest Job First YES

C Earliest Deadline First
D Longest Job First
29 Under multiprogramming, turnaround time for short
jobs is usually ________ and that for long jobs is
slightly ___________
A Lengthened; Shortened

B Shortened; Lengthened YES

C Shortened; Shortened
 D Shortened; Unchanged

30 Which is the most optimal scheduling algorithm?

A FCFS – First come First served
B SJF – Shortest Job First YES

C RR – Round Robin
D None of the mentioned

31 The real difficulty with SJF in short term scheduling

is ____________
A it is too good an algorithm
B knowing the length of the next CPU request YES
C it is too complex to understand
D none of the mentioned

32 The FCFS algorithm is particularly troublesome for

____________
A time sharing systems YES

B multiprogramming systems

C multiprocessor systems

D operating systems

33 Preemptive Shortest Job First scheduling is

sometimes called ____________

A Fast SJF scheduling

B EDF scheduling – Earliest Deadline First

C HRRN scheduling – Highest Response Ratio Next YES
 D SRTN scheduling – Shortest Remaining Time Next
34 What is ‘Aging’?

A keeping track of cache contents

B keeping track of what pages are currently residing in

memory
C keeping track of how many times a given page is
referenced
D increasing the priority of jobs to ensure termination YES
in a finite time
35 Which of the following scheduling algorithms gives
minimum average waiting time?

A FCFS YES
B SJF

C Round Robin

D Priority

36 Message passing system allows processes to

__________
A communicate with each other without sharing the YES
same address space
B communicate with one another by resorting to shared
data
C name the recipient or sender of the message

D None

37 The link between two processes P and Q to send and

receive messages is called __________

A communication link YES

B message-passing link

C synchronization link
 D all of the mentioned

38 In the non blocking send __________

A The sending process keeps sending until the message YES

is received

B The sending process sends the message and resumes

operation

C The sending process keeps sending until it receives a

message

D None of the mentioned

39 Bounded capacity and Unbounded capacity queues

are referred to as __________

A Programmed buffering

B b) Automatic buffering YES

C c) User defined buffering

D d) No buffering

40 Messages sent by a process __________

A Fixed size

B Variable size
C have to be of a fixed size YES
D None