数据结构（全英文） 第四章_智慧树知到答案2021年

第四章 Queues：introduce some about queues4.1Introduction to Queues:introduce to the queue ,add and delete
4.2Problems with Queues:introduce some problens about Queues
4.3Circular Queue:inteoduce about circular queue,ADDQ and DELETEQ
4.4Circular Queue Algorithms:introduce some algorithms about circular queue
4.5DEQUES:Introduce some about deques and some problens

[单选题]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 rear
]
[单选题]

 The following data structure is used for scheduling of jobs during batch processing in computers.

选项:[   tree
,    linked list
,    queue
,    stack
]
[单选题]In a queue the deletions are take place at_________.

选项:[front
, None of the above
, top
, rear

]
[单选题] In a queue the insertions are take place at_________.

选项:[None of the above
, front
, rear 
, top
]
[单选题]

In circular queue, the front will always point to one position __________from the first element in the queue.

选项:[counterclockwise
, clockwise
, left
, right
]
[单选题]Which of the following is not the type of queue.

选项:[priority queue
, double ended queue
, single ended queue
, circular queue
]
[单选题]

One of the advantage of circular queue is_____________.

选项:[ easier computations
,  effective use of memory
,  None of the above
,  deleting elements based on priority
]
[单选题]What is the time complexity of a linear queue having n elements?

选项:[  O(1)
,   O(nlog n)
,   O(log n)
,   O(n)
]
[单选题]What is a dequeue?

选项:[A queue with insert/delete defined for both front and rear ends of the queue
, A queue implemented with a doubly linked list
, A queue implemented with both singly and doubly linked list
, A queue with insert/delete defined for front end of the queue
]
[单选题]

One difference between a queue and a stack is:

选项:[Stacks use two ends for adding and deleting, but queues use one.
, Queues use two ends for adding and deleting, but stacks use one.
, Stacks require dynamic memory, but queues do not.
, Queues require dynamic memory, but stacks do not.
]