Suppose we have a circular array implementation of the queue class, with ten items in the queue

stored at data$[3]$ through data$[12].$ The CAPACITY is $42.$ Where does the push member function

place the new entry in the array?

a$)$ data$[1]$

b$)$ data$[13]$

c$)$ data$[11]$

d$)$ No correct answer

Shell sort works by:

Shell sort is considered:

a$)$ A stable sort

b$)$ Either stable or unstable depending on the gap sequence

c$)$ An unstable sort

d$)$ None of the above

Page $6$ of $7$

Bubble sort is

Which of the following is true about bubble sort?

a$)$ Useful for very large arrays

b$)$ Easy to implement

c$)$ Has very bad performance

d$)$ Both b and c

Selection sort is

During each iteration of selection sort, the smallest

a$)$ Number is moved to the front

b$)$ Number is selected

c$)$ Two numbers are swapped

d$)$ None of the above

Selection sort is well suited for

Auxiliary space complexity of selection sort is

a$)O(1)$

b$)$ Depends on implementation

c$)O(n)$

d$)$ None of the above

In selection sort, picking the smallest element requires at least

a$)$ n$-1$ comparisons

b$)n^{{?}^{{?}^{?}}}2$ comparisons

c$)n$ comparisons

d$)$ None of the above

Selection sort is

to implement

a$)$ Difficult

b$)$ Highly optimized

c$)$ Easy

d$)$ None of the above

Which of the following has the lowest time complexity for an enqueue operation?

a$)$ Array based queues

b$)$ Heap based queues

c$)$ Linked list based queues

d$)$ All have the same time complexity