JAVA 3. PLEASE ANSWER ALL QUESTIONS! I WILL LEAVE A BIG LIKE AND COMMENT AS LIFESAVER!!!

Question 1

In the makeRoom(newPosition) method of an array-based implementation of the ADT list no shift is necessary if newPosition is equal to

Options:

numberOfEntries 1

numberOfEntries

numberOfEntries +1

none of the above

Ans: ?

2)In a circular array based implementation if a queue what is the performance when the enqueue operation if you amortize the cost id resizing the array over all additions to the

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

Ans: ?

3)when a counter enumerates simulated time units. It is called a(n)

A. All other answers

B.time driven simulation

C.event drivem simulation

D.clock simulation

Ans: ?

4)The radix sort

A. Treats array entries asif they were strings that have same length

B. Is not suitable as a general purpose sorting algorithm

C.restrcits the data that it sorts on

D. All other answers

Ans: ?

5)Which of the following statements are true about quick sort

A. It can degrade into an O(n2) sort if the pivot selection scheme is bad

B. It doesnt require additional memory that merges sort does

C. All other answers

D.in practice it can be transfer than merge sort

Ans: ?