Exam 4: Arrays and Linked Structures

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): < missing code > A = temp

What method does Python's list type use to increase the size of the underlying array?

What type of memory scheme does a linked list use?

A linked structure can be stored in noncontiguous memory.

Similar to an array, linked structures support random access.

Which statement tests if a singly linked node variable named myItem has been initialized?

What is the operation on a linked structure called that visits each node without deleting it?

In the Array class defined in Chapter 4, how do you instantiate an array object that can hold 10 values?

In Python, a node in a doubly linked structure contains two fields: a data item and a reference to the next node.

Which of the following is an advantage of a doubly linked structure over a singly linked structure?

On a linked structure, index-based operations must be emulated by manipulating links within the structure.

What type of operation is the following code performing? probe = head While probe != None and targetItem != probe.data: Probe = probe.next If probe != None: Probe.data = newItem Return True Else: Return False

The following code sums all the values in the two-dimensional array. What is the missing code? Sum = 0 For row in range(grid.getHeight()): For column in range(grid.getWidth()): < missing code >

The list is the primary implementing structure in Python collections.

To start a traversal of a linked structure, initialize a variable to the structure's head pointer.

What process is required to avoid wasting memory if successive calls to the pop method on a list are made?

In the following code to insert an item in an array, what is the missing code? for x in range(logicalSize, targetIndex, -1): MyArray[x] = myArray[x - 1] A[targetIndex] = newItem < missing code >

A ragged grid has a fixed number of columns and a variable number of rows.

What action does the following code perform assuming the Node class defined in Chapter 4? ​ head = Node(newItem, head)

On average, what is the performance of a sequential search on a singly linked structure?