python

What is the solution to achieving good performance for both the add and pop methods in the array implementation of a queue?

• using an insert function instead of add
• using a fixed front pointer to index position 0
• using a front pointer that advanced through the array
• using a circular array implementation

---------------------------------

Which type of collection is ordered by position?

• hierarchical
• sorted
• graph
• linear

----------------------------------------------

What should the missing code be in the following insertion sort algorithm? i = 1 while i < len(myList): itemToInsert = myList[i] j = i - 1 while j >= 0: if itemToInsert < myList[j]: myList[j + 1] = myList[j] j -= 1 else: break i += 1

• myList[j] = itemToInsert
• myList[i] = itemToInsert
• myList[i + 1] = itemToInsert
• myList[j + 1] = itemToInsert

------------------------------

The process for resizing an array named myArray is shown below. What is the missing code?

if logicalSize == len(myArray):

temp = Array(len(myArray) + 1)

for i in range(logicalSize):

a = temp

• temp = myArray(len(myArray))
• myArray[i] = temp[i]
• myArray[temp] = myArray[i]
• temp [i] = myArray[i]