Solved MCQ(S) Jan
From FinalTerm Papers 14, 2018
BY Arslan
V-U For Updated Files Visit Our Site : Www.VirtualUstaad.blogspot.com Updated.
Final-Term Papers Solved MCQS with Reference
1. ________ enable processes to communicate with each other
o Directory
o FIFO PG # 218
o Link File
o Ordinary File
2. ________ scheme works well if members of the team are to work on these shared files sequentially.
o Common Group
o Duplicating Files PG # 288
o Common Login
o Link
3. UNIX recognizes ______ modes of access
o One
o Two
o Three PG # 230
o Four
UNIX recognizes three modes of access: read, write, and execute (r, w, x).
4. The______ algorithm selects the request with the minimum seek time from the current head position
o Scan
o SSTF PG # 244
o Look
o C-Look
5. Which part of the computer system helps in managing the file and memory management system?
o Operating System
o Device Drivers
o Application Software
o Hardware
6. ________ is used to store data on secondary storage device.
o Block Special File
o Link File
o Ordinary File PG # 218
o Directory
7. _______ is a way to establish a connection between the file to be shared and the directory entries of the users
who want to have access to this file.
o Link PG # 229
o Directory
o Common Group
o Access Permission
8. Which one of the following indicates end of the file in a read ( ) system call?
o -1
o 0
o 1
o 2
9. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each
process requests resources in an increasing order of enumeration. This violates the _______________condition
of deadlock.
o Mutual exclusion
o Hold and Wait
o Circular Wait PG # 134
o No Preemption Right
10. The bottom layer in the layered approach of Operating System is ____________.
o User interface
o Hardware PG # 18
o Kernel
o API
11. The non-critical section code in any critical section problem is termed as ____________.
o Critical Section
o Entry Section
o Leave/Exit Section
o Remainder Section
12. The process that satisfies all three requirements of critical section problem is called __________.
o Algorithm 1
o Algorithm 2
o Algorithm 3
o Algorithm N
13. The main disadvantage of semaphore is ______________.
o Context switching
o Busy waiting PG # 111
o Synchronization
o Deadlock
14. In Unix/Linux, pipes provide a method of one-way communication and for this reason it may be called
___________.
o Soft pipes
o FIFO named pipes
o Full-duplex pipes
o Half-duplex pipes PG # 46
15. Consider process A is trying to access a page that does not belong to its address space. Which of the following
protection scheme provide protection against such actions under paging?
o Valid/invalid (v) bit PG # 170
o Null bit/parity (n) bit
o Execute/parity (e) bit
o Write/null (w) bit
16. -----------is the separation of user logical memory from physical memory.
o Virtual Memory PG # 186
o RAM
o Physical memory
o ROM
17. For page replacement algorithms, the page fault rate may increase as the number of allocated frames
__________.
o Keep Constant
o Increases PG # 200
o Decreases
o Available
18. In the Scan algorithm, disk _______ starts at one end of the disk, and moves toward the other end, servicing
requests as it reaches each cylinder, until it gets to the other end of the disk.
o Arm PG # 245
o Cylinder
o Head
o Vector
19. In case of thrashing, if CPU utilization is too low, the operating system _________ the degree of
multiprogramming
o Increases PG # 208
o Decreases
o Increases or Decreases
o Keeps constant
20. When there is no external fragmentation, free memory blocks are scattered on hard disk then _________ is used
in order to utilize these blocks for space management.
o Indexed Allocation
o Contiguous Allocation
o Linked Allocation PG # 235
o Variable Allocation
21. In a Multilevel Queue, the foreground queue has -------- scheduling algorithm and background queue has --------
------ scheduling algorithm.
o First Come First Serve, Round-Robin
o Round-Robin, First Come First Serve Click Here For Reference
o Round Robin, Round Robin
o First Come First Serve, First Come First Serve
22. Main memory is a large array of ----------called memory locations ranging in size from hundreds of thousands
to billions.
o Interrupts
o Registers
o Digits
o Words PG # 12
23. The syntax for input redirection is
o command < input-file PG # 55
o command > input-file
o command >= input-file
o command =< input-file
24. The semaphore empty is initialized to the value ---------; the semaphore full is initialized to the value --------.
o 0,n
o n,0 PG # 116
o n,n
o 0,0
25. High-level synchronization construct that allows the safe sharing of an abstract data type among concurrent
processes is called a ------------
o Read/Write Lock
o Swap
o Semaphore
o Monitor Click Here For Reference
26. When drawing the resource allocation graph, processes are represented by ---------and resources by ---------------
o Squares, Squares
o Circles, Circles
o Circles, squares
o Squares, Circles Click Here For Reference
27. Preventing the condition of _____________ to happen, deadlocks can be prevented to happen.
o Critical region
o Monitors
o Circular wait PG # 135
o Critical section
28. If validation bit is 0, it indicates a/an --------- state of segment.
o Protected
o Shared
o Legal
o Illegal PG # 178
29. Intel is basically designed for following Operating Systems except __________.
o MULTICS PG # 180
o OS/2
o Windows
o Linux
30. The term pager is used in connection with ________________.
o Demand Paging PG # 187
o Paging
o Segmentation
o Paged Segmentation
31. In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph
contains a _____________
o Cycle PG # 145
o Graph
o Edge
o Node
32. Object files and libraries are combined by a ------------- program to produce the executable binary
o Compiler
o Linker
o Text editor
o Loader
33. ----------holds the smallest legal physical memory address for a process
o Stack pointers register
o Base register PG # 10
o Limit register
o Index register
34. External Fragmentation takes place in ______________
o Multiprogramming with Variable Tasks (MVT) PG # 163
o Multiprogramming with Fixed Tasks (MFT)
o Multi-tasking
o Paging
35. A process is _____________if it is spending more time on paging
o Thrashing PG # 206
o Demand paging
o Paging
o Fixed Allocation
36. Every --------------generated by the CPU is divided into two parts: a page number (p) and a page offset (d).
o Page
o Process address space
o Physical address
o Logical address PG # 164
37. The most important property of the working set is its ________.
o Delay
o Thrashing
o Time
o Size PG # 211
38. ________________ algorithm is the optimal scheduling algorithm among all the non-preemptive scheduling
algorithms.
o Shortest Job First scheduling
o First Come First Serve
o Priority Scheduling
o Round Robin Scheduling
39. The Swap instruction which is the hardware solution to synchronization problem does not satisfy the ________
condition, hence not considered to be a good solution.
o Bounded waiting
o Mutual exclusion
o No preemption
o Progress
40. The statement “A process may hold allocated resources while waiting for of other resources” best describes
which one of the following conditions?
o Mutual Exclusion
o No preemption
o Hold and wait
o Circular wait
Note: Give me a feedback and your Suggestion also If you find any mistake in mcqz plz
inform me Via Contact us Page on our Site. And tell me your answer with references.
For More Solved Papers By Arslan Visit Our Website:
Www.VirtualUstaad.blogspot.com
