第四章A queue is a data structure in which all insertions and deletions are made respectively at:
front and rear
rear and front
front and front
答案: rear and front
The following data structure is used for scheduling of jobs during batch processing in computers.
stack
queue
linked list
In a queue the deletions are take place at_________.
None of the above
top
front
In a queue the insertions are take place at_________.
front
rear
top
In circular queue, the front will always point to one position __________from the first element in the queue.
left
right
counterclockwise
Which of the following is not the type of queue.
priority queue
double ended queue
circular queue
One of the advantage of circular queue is_____________.
deleting elements based on priority
easier computations
effective use of memory
What is the time complexity of a linear queue having n elements?
O(nlog n)
O(log n)
O(n)
What is a dequeue?
A queue with insert/delete defined for front end of the queue
A queue implemented with a doubly linked list
A queue implemented with both singly and doubly linked list
One difference between a queue and a stack is:
Queues use two ends for adding and deleting, but stacks use one.
Queues require dynamic memory, but stacks do not.
Stacks require dynamic memory, but queues do not.
温馨提示支付 ￥3.00 元后可查看付费内容,请先翻页预览!
