adplus-dvertising
frame-decoration

Question

Which is the best data structure for round robin algorithm for CPU scheduling?

a.

Stack implemented using queues

b.

Doubly linked list

c.

Circular queue

d.

Queue implemented using stacks

Answer: (c).Circular queue

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which is the best data structure for round robin algorithm for CPU scheduling?

Similar Questions

Discover Related MCQs

Q. Time complexity of binary search algorithm is constant.

Q. The time complexity of linear search is given by:

Q. The time complexity of binary search is given by:

Q. If for an algorithm time complexity is given by O((3/2)ⁿ) then complexity will:

Q. If for an algorithm time complexity is given by O(n²) then complexity will:

Q. If for an algorithm time complexity is given by O(n) then complexity of it is:

Q. If for an algorithm time complexity is given by O(log2n) then complexity will:

Q. If for an algorithm time complexity is given by O(1) then complexity of it is:

Q. To measure Time complexity of an algorithm Big O notation is used which:

Q. The worst case complexity of quick sort is

Q. The worst case complexity for insertion sort is

Q. The complexity of Fibonacci series is

Q. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

Q. The worst case occur in quick sort when

Q. Let m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)

Q. Using the standard algorithm, what is the time required to determine that a number n is prime ?

Q. Which of the following sorting algorithms does not have a worst case running time of O(n2)?

Q. The concept of order (Big O) is important because

Q. The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is

Q. A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of