In: Computer Science
QUESTION 21
chmod +t is used to:
set timing information |
||
set group information |
||
set sticky bit |
||
set transit information |
1 points
QUESTION 22
When two or processes are waiting indefinitely for an event that can be caused by only one of the waiting processes, we call this as:
Race condition |
||
Deadlock |
||
Starvation |
||
None of the above |
1 points
QUESTION 23
___________ is a fast disk space, large enough to store data for all users.
Hard disk |
||
Main memory |
||
Backing store |
||
Registers |
1 points
QUESTION 24
Kernel-level threads are scheduled onto:
System contention scope |
||
Process contention scope |
||
Both of the above |
||
None of the above |
1 points
QUESTION 25
DMA stands for:
Device Memory Access |
||
Device Memory Access |
||
Direct Memory Access |
||
Device Multiple Access |
1 points
QUESTION 26
_________ is only used for redundancy.
RAID 0 |
||
RAID 1 |
||
RAID 4 |
||
RAID 5 |
1 points
QUESTION 27
storage that CPU can access: (choose all that apply)
Registers |
||
Main memory |
||
Hard disk |
||
Virtual memory |
1 points
QUESTION 28
___________interrupt are those which can be handled after the execution of current instruction
Maskable |
||
Non-maskable |
||
generated form device |
||
not generated from device |
1 points
QUESTION 29
_______ transmission have start and stop bits.
character |
||
block |
||
synchronous |
||
asynchronous |
1 points
QUESTION 30
Disk access time is determined using: (choose all that apply)
disk arm length |
||
rotational latency |
||
cylinder size |
||
seek time |
QUESTION 21: set group information.
QUESTION 22: deadlock
The implementation of a semaphore with a waiting queue may result in a situation where two or more processes are waiting indefinitely for an event that can be caused only by one of the waiting processes. ... When such a state is reached, these processes are said to be deadlocked.
QUESTION 23: hard disk.
The easiest way to keep all of your digital files safe is to simply buy an external hard drive
QUESTION 24: system-contention scope
On operating systems that support them, it is kernel-level threads—not processes—that are being scheduled by the operating system. User-level threads are managed by a thread library, and the kernel is unaware of them. ... To decide which kernel thread to schedule onto a CPU, the kernel uses system-contention scope (SCS).
QUESTION 25: direct memory acess
QUESTION 26: raid 1
RAID 1 requires a minimum of two disks to work, and provides data redundancy and failover. It reads and writes the exact same data to each disk.
QUESTION 27: Registers,Main memory.Hard disk Virtual memory
QUESTION 28: maskable
Maskable Interrupts are those which can be disabled or ignored by the microprocessor. These interrupts are either edge-triggered or level-triggered, so they can be disabled. INTR, RST 7.5, RST 6.5, RST 5.5 are maskable interrupts in 8085 microprocessor.
Non-Maskable Interrupts are those which cannot be disabled or ignored by microprocessor. TRAP is a non-maskable interrupt. It consists of both level as well as edge triggering and is used in critical power failure conditions.
QUESTION 29: asynchronus
exp: The start and stop bits are used in asynchronous communication as a means of timing or synchronizing the data characters being transmitted. Without the use of these bits, the sending and receiving systems will not know where one character ends and another begins
QUESTION 30: rotation latency , seek time
exp:
Access Time is calculated by summation of the following:
(a). Seek Time (b). Rotational Latency (c). Command Processing Time (d). Settle Time