Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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?
In this figure, 3 types of scheduling using preemptive scheduling policies is shown. Which of the following options is correctly referring to each of these scheduling types?
Consider the following statements comparing static RAM with dynamic RAM: In static RAM typical cell requires more number of transistors than the dynamic RAM. Power consumption per bit of static RAM is less than that of dynamic RAM. Dynamic RAM is less expensive than the static RAM. Which of the above statements are correct?
Which scheduling algorithm is an optimal scheduling policy for mono-processor system?
Consider the following statements for dynamic characteristics of a measurement system: 1. Fidelity is defined as the degree to which a measurement system indicates changes in the measured quantity without any dynamic error. 2. Dynamic error is the difference between the true value of the quantity changing with time and the value indicated by the measurement system if no static error is assumed. 3. Measuring lag is the retardation in the response of a measurement system to changes in the measured quantity. Which of the above statements are correct?
To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading ____________
Which of the following statements are true? I. Shortest remaining time first scheduling may cause starvation II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time
Which of the following scheduling test can be used to show that no scheduling exist?
Which scheduling test is used to indicate that no scheduling exist even if there exist one?
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?