Group 3 Mcqs

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Group - 3

MCQS:
1- Your interface to operating system is called:
a) Kernel
b) Shell
c) Command
d) Process
2- A process is a sequence of:
a) Program
b) Instruction
c) System call
d) None
3- Fork system call is used for:
a) Running program
b) Debugging program
c) Deleting existing process
d) Creating new process
4- Are linux commands case sensitive?
a) Yes
b) No
5- Which command is used for changing the current directory?
a) pwd
b) cd
c) rm
d) mkdir
6- “cat” command is used for:
a) Copy files
b) Change file permissions
c) Display contents of file
d) Create empty file
7- Why is fork system call used?
a) Process creation
b) Parallel execution
c) Isolation
d) All of above
8- A system call is a way for programmer to interact with:
a) Operating system
b) Hardware
c) Software
d) Program
9- Co-operating process communicate using:
a) Shared memory
b) Message passing
c) System call
d) Both a & b
10- IPC can lead to ________ when processes are waiting for each other.
a) Overhead
b) Repetition
c) Deadlock
d) Parallel processing
11- The system call that facilitates IPC is:
a) Pipe
b) Sleep system call
c) Wait system call
d) Fork system call
12- Function shmget() is used to:
a) Call program
b) Create shared memory segment
c) Attach memory segment
d) None of above
14- Thread is a:
a) Process
b) System call
c) Function
d) Light weight process
15- Advantage of thread is:
a) Responsiveness
b) Parallel processing
c) Resource sharing
d) All of above
16- Turnaround time is equals to:
a) Completion time - Burst time
b) TAT - Burst Time
c) Completion time - Arrival time
d) Waiting time - Burst time
17- FSFC works on the principle of:
a) FIFO
b) LIFO
c) Both
d) None
18- FCFS is a
a) Preemptive process
b) Non-preemptive process
19- Which of the following has the minimum waiting time among all scheduling
processes:
a) FCFS
b) SJF
c) CPU Priority Scheduling
d) Round Robin Scheduling
20- Starvation occurs when process has:
a) Large burst time
b) Small burst time
c) Medium burst time
d) Infinite burst time
21- For smallest execution time process, waiting time is equals to:
a) 100
b) 50
c) 20
d) 0
22- In Round Robin Scheduling, each process is executed for
a) Fixed Time
b) Variable Time
c) Flexible Time
d) None
23- In which of the scheduling algorithms, there is no starvation?
a) FSFS
b) SJF
c) CPU Priority Scheduling
d) Round Robin Scheduling
24- Which of the page replacement algorithms is not applicable in the real world?
a) FIFO
b) LRU
c) Optimal
d) All
25- IPC is used for communication:
a) Between processes
b) Between user and system
c) Between memory and CPU
d) Between cache and memory

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy