Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

A linked structure can be stored in noncontiguous memory.

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

A)   deletion of an item in a linked list
B)   appending an item to the end of a linked list
C)   replacing an item at the beginning of a linked list
D)   insertion of an item at the beginning of a linked listE) B) and D)
F) A) and B)

Question 5

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

Accepted Answer

A)   if myItem is Null:
B)   if myItem != None:
C)   if myItem = None:
D)   if myItem is not Null:E) B) and C)
F) All of the above

Question 6

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

Accepted Answer

A)   probe
B)   insertion
C)   removal
D)   traversalE) A) and D)
F) B) and C)

Question 7

The list is the primary implementing structure in Python collections.

Accepted Answer

A) True 
 B)False

Question 8

What type of memory scheme does a linked list use?

Accepted Answer

A)   overlapping
B)   noncontiguous
C)   sequential
D)   randomE) A) and B)
F) A) and C) B

Question 9

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() ) :

Accepted Answer

A)   sum += grid[ column ][ row ]
B)   sum += grid[ row-1 ][ column-1 ]
C)   sum += grid[ column+1 ][ row+1 ]
D)   sum += grid[ row ][ column ]E) All of the above
F) None of the above

Question 10

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

Accepted Answer

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 memoryE) A) and B)
F) B) and C)

Question 11

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

Accepted Answer

A)   logarithmic
B)   linear
C)   exponential
D)   randomE) A) and B)
F) C) and D)

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A)   myArray(10)  = Array
B)   Array myArray, 10
C)   myArray = Array(10) 
D)   Array(10)  myArrayE) A) and B)
F) A) and C)

Question 15

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

Accepted Answer

A)   myArray[ temp ] = myArray[ i ]
B)   temp [ i ] = myArray[ i ]
C)   myArray[ i ] = temp[ i ]
D)   temp = myArray(len(myArray) ) E) C) and D)
F) B) and D) B

Question 16

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

Accepted Answer

A)   delete the array
B)   grow the array
C)   reset the array
D)   shrink the arrayE) C) and D)
F) B) and C)

Question 17

Similar to an array, linked structures support random access.

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

A)   targetIndex += 1
B)   targetIndex -= 1
C)   logicalSize += 1
D)   logicalSize -= 1E) C) and D)
F) None of the above

Question 19

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

Accepted Answer

A)   size
B)   append
C)   increase
D)   augmentE) A) and C)
F) A) and B) B

Question 20

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

Accepted Answer

A)   sum of all items
B)   replacement
C)   insertion
D)   deletionE) B) and D)
F) C) and D)

Exam 4: Arrays and Linked Structures

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

Correct AnswerverifiedShow Answer

A linked structure can be stored in noncontiguous memory.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The list is the primary implementing structure in Python collections.

Correct AnswerverifiedShow Answer

What type of memory scheme does a linked list use?

Correct AnswerverifiedB

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 >

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedB

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

Correct AnswerverifiedShow Answer

Similar to an array, linked structures support random access.

Correct AnswerverifiedShow Answer

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 >

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedB

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

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

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

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified