Question 1

In the Array class defined in Chapter 4, how do you instantiate an array object that can hold 10 values?
A) myArray(10) = Array
B) Array myArray, 10
C) myArray = Array(10)
D) Array(10) myArray

Accepted Answer

To instantiate an array object that can hold 10 values, we need to use the syntax "myArray = Array(10)". The other options are incorrect syntax or do not allocate space for the array.

Question 2

What type of memory scheme does a linked list use?
A) overlapping
B) noncontiguous
C) sequential
D) random

Accepted Answer

A linked list uses a noncontiguous memory scheme as each node can be located at any memory location and is connected through pointers.

Question 3

The insertion and removal of the first node of a singly linked structure require that the head pointer be reset.

Accepted Answer

When inserting or removing the first node of a singly linked structure, the head pointer needs to be updated to point to the new first node or the node after the removed first node.

Question 4

How does a programmer access the first item in a singly linked structure?
A) by using the 0 index
B) with the first() method
C) by following a head link
D) by a call to getLink(1)

Accepted Answer

In a singly linked structure, each node only knows the location of the next node in the sequence. Therefore, to access the first item, we need to follow the link of the head node, which leads to the first item in the structure. Using the 0 index or getLink(1) would not work because the structure does not provide direct access to the nodes by index. The first() method is not a standard method in most programming languages and would depend on the implementation of the structure.

Question 5

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) targetIndex += 1
B) targetIndex -= 1
C) logicalSize += 1
D) logicalSize -= 1

Accepted Answer

By adding the new item to the array, the logical size of the array increases by one. Therefore, we need to update the variable logicalSize to reflect this change. Option C, logicalSize += 1, adds one to logicalSize and correctly updates it to the new size of the array. The other options do not accurately reflect the change in the size of the array.

Question 6

What does the last item in a singly linked structure contain?
A) an empty link
B) a link to the first item
C) a link to the previous item
D) a method for appending an item

Accepted Answer

The last item in a singly linked structure contains an empty (null) link, indicating the end of the structure.

Question 7

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 >
A) sum += grid[ column ][ row ]
B) sum += grid[ row-1 ][ column-1 ]
C) sum += grid[ column+1 ][ row+1 ]
D) sum += grid[ row ][ column ]

Accepted Answer

To sum all the values in the two-dimensional array, we need to iterate over all the rows and columns in the array. For each iteration, we add the value at that particular index to the sum. Since the rows and columns are 0-based indexed, we use "grid[row][column]" to access the value at that particular index. Therefore, the missing code should be "sum += grid[row][column]".

Question 8

What is the primary implementing structure of Python collections?
A) list
B) array
C) linked list
D) dictionary

Accepted Answer

The answer of What is the primary implementing structure of...

Question 9

Older programming languages implement arrays as static data structures which are inefficient. What do modern languages use to remedy the problems of static arrays?
A) dynamic arrays
B) linked lists
C) data stacks
D) hash tables

Accepted Answer

Modern languages use dynamic arrays to remedy the problems of static arrays. Dynamic arrays allow for resizing and efficient memory allocation, making them more flexible and efficient than static arrays.

Question 10

Inserting data at the beginning of a linked structure uses constant time and memory.

Accepted Answer

Inserting data at the beginning of a linked structure involves creating a new node and changing the pointer of the head node to point to the new node. This operation does not depend on the size of the linked structure, so it is constant time. Memory usage is also constant as only one new node is created.

Question 11

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
A) myArray[ temp ] = myArray[ i ]
B) temp [ i ] = myArray[ i ]
C) myArray[ i ] = temp[ i ]
D) temp = myArray(len(myArray))

Accepted Answer

The missing code should assign the value at each index i in myArray to the corresponding index i in temp. Option B correctly assigns the value at index i in myArray to the index i in temp. Option A is incorrect since temp should be the array being modified, not myArray. Option C is incorrect since it assigns values from temp to myArray, which is not what the resizing process requires. Option D is incorrect since it assigns temp to the last element in myArray, which is not necessary for resizing.

Question 12

Which of the following is true about Python's array module?
A) it is limited to storing numbers
B) it behaves much like a dictionary
C) it can only hold character values
D) you can define its size at run time

Accepted Answer

The answer of Which of the following is true about...

Question 13

What process is required to avoid wasting memory if successive calls to the pop method on a list are made?
A) delete the array
B) grow the array
C) reset the array
D) shrink the array

Accepted Answer

Successive calls to the pop method will remove elements from the end of the list, so if the list is not shrunk, the memory that was allocated for the removed elements will still be reserved. Shrinking the list will release this memory and avoid wasting it.

Question 14

Which of the following best describes an array?
A) a collection of data points that represent an object
B) a list of values that are indexes to a database
C) a numeric value that points to a position in RAM where data can be found
D) a sequence of items that can be accessed at given index positions

Accepted Answer

An array is a sequence of items that can be accessed at given index positions. It is a data structure that stores a collection of values of the same data type. Each element in the array is identified by an index or a key, and these elements are stored in contiguous memory locations. Accessing elements in an array is quick and efficient, as the location of each element can be calculated based on its index.

Question 15

Which of the following is an advantage of a doubly linked structure over a singly linked structure?
A) it is less complex to implement
B) you can easily access the predecessor of an item
C) you can easily access the successor of an item
D) it uses less memory

Accepted Answer

Doubly linked structures allow easy access to both the predecessor and successor of an item, which can be useful in certain algorithms and operations.

Question 16

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.

Accepted Answer

The run-time complexities of operations on doubly linked structures are generally the same as those on singly linked structures because the complexity is determined by the number of operations or steps required, not by the number of pointers updated. For example, insertion or deletion at a given position in both structures is O(n), where n is the number of elements in the list. The main difference is that a doubly linked list allows easier and more efficient backward traversal and deletion of the last element, but this does not double the complexity of operations compared to a singly linked list.

Question 17

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

Accepted Answer

A circular linked structure is a type of linked structure where the last node is linked back to the first node, forming a loop or circle. Therefore, the given statement is true.

Question 18

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

Accepted Answer

Removing an item at the end of a singly linked list requires traversing the entire list to reach the last but one node to update its next pointer, which takes O(n) time, where n is the number of elements in the list.

Question 19

Which of the following statements accesses the second column in the third row of a two-dimensional array?
A) twoDim[ 2 ][ 1 ]
B) twoDim[ 4 ][ 3 ]
C) twoDim[ 1 ][ 2 ]
D) twoDim[ 2 ][ 3 ]

Accepted Answer

Arrays in most programming languages are zero-indexed, meaning the first element is at index 0. Therefore, the second column in the third row is accessed with twoDim[2][1], where 2 is the third row and 1 is the second column.

Question 20

What method does Python's list type use to increase the size of the underlying array?
A) size
B) append
C) increase
D) augment

Accepted Answer

Python's list type uses the append method to increase the size of the underlying array. When a new item is added to a list using append(), the list automatically increases its size to accommodate the new item.

Quiz 4: Arrays and Linked Structures

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

What type of memory scheme does a linked list use?

The insertion and removal of the first node of a singly linked structure require that the head pointer be reset.

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

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 >

What does the last item in a singly linked structure contain?

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 >

What is the primary implementing structure of Python collections?

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

Inserting data at the beginning of a linked structure uses constant time and memory.

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

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

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

Which of the following best describes an array?

Which of the following is an advantage of a doubly linked structure over a singly 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.

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

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

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

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