Exam 4: Arrays and Linked Structures

How does a programmer access the first item in a singly linked structure?

Which of the following best describes an array?

What type of linked structure operation is the following code performing? Z = 0 Probe = head While probe != None: Z = probe.data + z Probe = probe.next

Older programming languages implement arrays as static data structures which are inefficient. What do modern languages use to remedy the problems of static arrays?

Which of the following statements accesses the second column in the third row of a two-dimensional array?

The first item in a singly linked structure is accessed using a head link.

The following code searches a linked structure. What is the missing code? Probe = head While probe != None and targetItem != probe.data: < missing code > If probe != None: Print("Target item found!") Else: Print("Target item not found!")

It's easier to get to an item's predecessor in a singly linked structure than in a doubly linked structure.

The run-time complexities of the operations on a doubly linked structure are typically double compared to the corresponding operations on the singly linked structure.

When a list's append method results in memory wasted beyond a threshold, the size of the underlying array is decreased.

What are almost all operations on arrays based upon?

A traversal of a singly linked structure terminates when the temporary variable is equal to the head pointer.

Which of the following is true about Python's array module?

A circular linked structure contains a link from the last node back to the first node in the structure.

If the logical size of an array equals the physical size of the array, a new array must be created to add elements to the array.

What is the primary implementing structure of Python collections?

When an item is inserted into an array, the logical size of the array increases.

To access a two-dimensional array, you use two subscripts.

Why are the insertion and removal of the first node special cases of the insert and remove i th node on singly linked structures?

The operation of removing an item at the end of a linked structure is constant in time and memory.