Top 250+ Solved Operating System Advanced MCQ Questions Answer
Q. If in a computer networking environment when all the processing is done on single computer can be referred as
a. Host based processing
b. Server based processing
c. Client based processing
d. None of these.
Q. In three tier client/server architecture application software match the following: A- User machine, 1-Client, B- Middle-tier, 2- Application server, C- Backend server, 3 Data servers.
a. A – 1, B – 2, C – 3
b. A – 1, B – 3, C – 2
c. A – 2, B – 1, C – 3
d. A – 3, B – 2, C – 1
Q. UNIX was developed by
a. Bell Labs for PDP-7 in 1970
b. Microsoft for IBM computers
c. Macintosh
d. None of these.
Q. In UNIX process management, the system process runs in
a. Kernel mode only
b. Kernel and user mode both
c. User mode only
d. None of these.
Q. In UNIX process management, the user processes runs in
a. Kernel mode only
b. Kernel and user mode both
c. User mode only
d. None of these.
Q. In UNIX process management, the following is true
a. User process enters kernel mode by issuing a system call when interrupt occurs.
b. Kernel mode is executed in user process.
c. User process enters kernel mode with out issuing a system call when interrupt occurs.
d. None of these.
Q. In process management of UNIX system, which of the following process states are running states in respect of whether the process is executing in user or kernel mode
a. Ready to run (in memory) state
b. Ready to run (in swappe(D) state
c. Preempted state
d. A and C are true
Q. A task in a blocked state is
a. Executable
b. Waiting for some temporarily unavailable resource
c. Running
d. None of these
Q. Semaphores
a. are used to do I/O
b. Synchronize critical resources to prevent contention
c. synchronize critical resources to prevent deadlock.
d. allow processes to communicate with one another.
Q. Priorities
a. are used to schedule processes
b. increase as a process remains in the processor
c. are attached to each page in the system
d. are assigned by the user.
Q. Dijkstra’s banker’s algorithm in an operating-system solves the problem of
a. deadlock avoidance
b. deadlock recovery
c. mutual exclusion
d. context switching
Q. Which structure prohibits the sharing of files and directories
a. tree structure
b. one level structure
c. two level structure
d. none of these
Q. With round-robin CPU scheduling in a time shared system
a. using very large time slices degenerates into First-Come First Served Algorithm
b. using extremely small time slices improves performance
c. using very small time slices degenerate into Last-In-First-Out algorithm
d. using medium sized time slices leades to Shortest Request Time First algorithm.