Q#1: Linux is a version of _______ operating system.
(A) OS/2
(B) Windows
(C) Unix
(D) None of the above
Answer: (C) Unix
Q#2: Current working directory can be accessed using ——— Command.
(A) . (dot)
(B) # (hash)
(C) / (slash)
(D) ~ (tilt)
Answer: (D) ~ (tilt)
Q#3: Mkfifo() is a _______.
(A) System Call
(B) Command
(C) Directory
(D) None of Above
Answer: (A) System Call
Q#4: ——– command gives a snapshot of the current processes.
(A) ps
(B) top
(C) who
(D) ls
Answer: (A) ps
Q#5: Time interval when the I/O Devices are accessed is known as ——–.
(A) CPU Burst
(B) IO Burst
(C) Time Slice
(D) None of Above
Answer: (B) IO Burst
Q#6: The process of switching from one process to another is called —————.
(A) context switching
(B) scheduling
(C) quantum period
(D) latency
Answer: (A) context switching
Q#7: __________ directory includes essential system boot files including the kernel image.
(A) /bin
(B) /boot
(C) /dev
(D) /etc
Answer: (B) /boot
Q#8: ________ scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.
(A) Non-preemptive SJF
(B) Priority Scheduling
(C) Preemptive Shortest Job First
(D) FCFS
Answer: (C) Preemptive Shortest Job First
Q#9: A semaphore that cause Busy-Waiting is termed as ___________.
(A) Spinlock
(B) Monitor
(C) Critical region
(D) Critical section
Answer: (A) Spinlock
Q#10: Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.
(A) True
(B) False
Answer: (A) True
Q#11: In ———addressing, the recipient is not required to name the sender.
(A) Symmetric
(B) Asymmetric
(C) Both symmetric and asymmetric
(D) None of the given options
Answer: (B) Asymmetric
Q#12: The execution of critical sections must NOT be mutually exclusive
(A) True
(B) False
Answer: (B) False
Q#13: A program in execution is called a _______________.
(A) Command
(B) Process
(C) Software
(D) Compiler
Answer: (B) Process
Q#14: The critical section problem can be solved by the following except
(A) Software based solution
(B) Firmware based solution
(C) Operating system based solution
(D) Hardware based solution
Answer: (B) Firmware based solution
Q#15: The bottom layer in the layered approach of Operating System is———–
(A) User interface
(B) Hardware
(C) Kernel
(D) None of the given options
Answer: (B) Hardware
Q#16: The manual pages can be read in Linux using ____ command.
(A) man
(B) wan
(C) desc
(D) help
Answer: (A) man
Short Answer Questions
Q#17: What is Convoy Effect?
Ans: Convoy effect occurs when FCFS scheduling forces shorter processes to wait behind longer processes, similar to vehicles moving in a convoy.
Q#18: What are the common data structures in Bakery Algorithm?
Ans:
- boolean choosing[n]; – indicates if a process is choosing a number
- int number[n]; – stores the ticket number for each process
Q#19: How a pipe can be created?
Ans: The pipe() system call creates a pipe and returns two file descriptors: one for reading, one for writing. Both descriptors must follow a protocol for sending and receiving data.
Q#20: Define Progress and Bounded Waiting.
Ans:
- Progress: If no process is executing in its critical section and some wish to enter, only processes not in the remainder section participate in deciding who enters next; selection cannot be postponed indefinitely.
- Bounded Waiting: There exists a limit on how many times other processes can enter their critical sections after a process has requested to enter its critical section before it is granted access.