Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
Which of the following statements regarding static methods are correct?
1. Static methods are difficult to maintain, because you can not change their implementation.
2. Static methods can be called using an object reference to an object of the class in which this method is defined.
3. Static methods are always public, because they are defined at class-level.
4. Static methods do not have direct access to non-static methods which are defined inside the same class.
In the following statements identify those which relate to 'Norm-Referenced Testing' (NRT). Select from the code to give your answer. 1) Covering a large domain of learning tasks with just a few items measuring specific tasks. 2) Emphasizing discrimination among individuals in terms of relative level of learning. 3) Focusing on a specified domain of learning tasks with a large number of items measuring specific tasks. 4) Interpretation requires a clearly defined group. 5) Interpretation requires a clearly defined achievement domain. 6) Emphasizing description of learning tasks which individuals can and cannot perform.
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities everyT time units and decides the next process to schedule. Which one of the following is TRUE if theprocesses have no I/O operations and all arrive at time zero?
One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?
Which of the following statement(s) is/are false regarding the modern periodic table? i. In the modern periodic table, the elements are arranged in decreasing order of their atomic numbers. ii. In the modern periodic table, the elements are arranged in increasing order of their atomic masses. iii. In the modern periodic table, isotopes are placed in adjacent groups. iv. In the modern periodic table, the elements are arranged in increasing order of their atomic numbers.
Which of the following statements is/are false regarding modern periodic table?
1. Elements in the modern periodic table are arranged in decreasing order of their atomic numbers.
2. Elements in the modern periodic table are arranged in increasing order of their atomic masses.
3. In the modern periodic table, isotopes are placed in adjacent groups.
4. Elements in modern periodic table are arranged in increasing order of their atomic numbers.
Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable. Which of the above statements is/are TRUE?
When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called __________