Question 1

In the following code for the __iter__ method in the ArrayList class, what is the missing code? def __iter__(self) :
Cursor = 0
While cursor

Accepted Answer

A)   self.items[ cursor ] = self.item[ cursor-1 ]
B)   cursor += 1
C)   cursor -= 1
D)   self.items[ cursor+1 ] = self.item[ cursor ]E) None of the above
F) B) and D)

Question 2

If a list contains the items x y z and the cursor is currently undefined, what happens when hasNext()  is executed?

Accepted Answer

A)   a value of True is returned
B)   a value of False is returned
C)   a value of False is returned and the cursor is positioned before the first item
D)   a value of True is returned and the cursor is positioned after the last itemE) None of the above
F) B) and C)

Question 3

Which of the following is NOT a type of precondition when implementing a list iterator?

Accepted Answer

A)   the next operation cannot be run if hasNext returns False
B)   consecutive mutator methods are required
C)   a next operation must be run before each mutation
D)   mutations cannot be run on the list itselfE) C) and D)
F) B) and C)

Question 4

How do a list iterator and a for loop differ?

Accepted Answer

A)   a list iterator allows movement directly to the last position
B)   a for loop allows movement directly to the first position
C)   a for loop allows movement to previous positions
D)   a list iterator only allows sequential movement through the listE) A) and B)
F) B) and C)

Question 5

In the __init__ method for the ArrayListIterator class, what is the missing code? def __init__(self, backingStore) :
Self.backingStore = backingStore
Self.modCount = backingStore.getModCount()

Accepted Answer

A)   self.first() 
B)   self.last() 
C)   self.next() 
D)   self.previous() E) B) and C)
F) A) and D)

Question 6

What is the typical argument to a content-based list operation?

Accepted Answer

A)   an index
B)   an item
C)   a list instance
D)   an arrayE) B) and C)
F) B) and D)

Question 7

Where is the cursor positioned when a list iterator is opened on a non-empty list?

Accepted Answer

A)   at the position of the length of the list minus 1
B)   immediately after the first item
C)   it is undefined
D)   immediately before the first itemE) B) and C)
F) A) and D)

Question 8

A Lisp list is a recursive data structure.

Accepted Answer

A) True 
 B)False

Question 9

Which of the following is NOT an example of a list?

Accepted Answer

A)   a recipe
B)   a jar of marbles
C)   words on a document
D)   a file on a diskE) A) and D)
F) None of the above

Question 10

What is each numeric position in a list called?

Accepted Answer

A)   index
B)   pointer
C)   tail
D)   vectorE) A) and D)
F) None of the above

Question 11

Which of the following is an area of memory from which the Python virtual machine allocates segments of various sizes for all new data objects.

Accepted Answer

A)   call stack
B)   virtual memory
C)   object heap
D)   memory partitionE) B) and D)
F) A) and C)

Question 12

List positions are usually counted from 0 to the length of the list plus 1.

Accepted Answer

A) True 
 B)False

Question 13

The items in a list are logically contiguous, but need not be physically contiguous in memory.

Accepted Answer

A) True 
 B)False

Question 14

What is the missing code in the contains method for a Lisp-like list? def contains(item, lyst) :
If isEmpty(lyst) :
Return False
Elif item == first(lyst) :

Else:
Return contains(item, rest(lyst) )

Accepted Answer

A)   return True
B)   return contains(item-1) 
C)   return False
D)   return first(lyst) E) B) and D)
F) B) and C)

Question 15

A list supports manipulation of items at only the head and tail within a linear collection.

Accepted Answer

A) True 
 B)False

Question 16

For a linked implementation of a list, a singly linked structure allows movement to the next node or the previous node.

Accepted Answer

A) True 
 B)False

Question 17

What does the rest function do on a Lisp-like list?

Accepted Answer

A)   returns the list cursor to the head position
B)   returns all the data items in the list
C)   returns a list of items after the first one
D)   returns the list cursor to its previous positionE) C) and D)
F) A) and C)

Question 18

The head of a list is at index 1 and the tail is at index n which is the length of the list.

Accepted Answer

A) True 
 B)False

Question 19

Which of the following list operations is a mutator that works at the currently established position in the list iterator?

Accepted Answer

A)   previous
B)   first
C)   remove
D)   hasPreviousE) A) and B)
F) A) and C)

Question 20

Which of the following is NOT one of the three broad categories of list operations discussed in Chapter 9?

Accepted Answer

A)   index-based
B)   content-based
C)   position-based
D)   hash-basedE) A) and B)
F) C) and D)

Exam 9: Lists

What is each numeric position in a list called?

Correct AnswerverifiedShow Answer

Which of the following is NOT an example of a list?

Correct AnswerverifiedShow Answer

In the __init__ method for the ArrayListIterator class, what is the missing code? def __init__(self, backingStore) : Self.backingStore = backingStore Self.modCount = backingStore.getModCount() < missing code >

Correct AnswerverifiedShow Answer

Which of the following is an area of memory from which the Python virtual machine allocates segments of various sizes for all new data objects.

Correct AnswerverifiedShow Answer

Where is the cursor positioned when a list iterator is opened on a non-empty list?

Correct AnswerverifiedShow Answer

Which of the following is NOT a type of precondition when implementing a list iterator?

Correct AnswerverifiedShow Answer

List positions are usually counted from 0 to the length of the list plus 1.

Correct AnswerverifiedShow Answer

The items in a list are logically contiguous, but need not be physically contiguous in memory.

Correct AnswerverifiedShow Answer

The head of a list is at index 1 and the tail is at index n which is the length of the list.

Correct AnswerverifiedShow Answer

How do a list iterator and a for loop differ?

Correct AnswerverifiedShow Answer

For a linked implementation of a list, a singly linked structure allows movement to the next node or the previous node.

Correct AnswerverifiedShow Answer

What is the missing code in the contains method for a Lisp-like list? def contains(item, lyst) : If isEmpty(lyst) : Return False Elif item == first(lyst) : < missing code > Else: Return contains(item, rest(lyst) )

Correct AnswerverifiedShow Answer

A list supports manipulation of items at only the head and tail within a linear collection.

Correct AnswerverifiedShow Answer

Which of the following is NOT one of the three broad categories of list operations discussed in Chapter 9?

Correct AnswerverifiedShow Answer

A Lisp list is a recursive data structure.

Correct AnswerverifiedShow Answer

In the following code for the __iter__ method in the ArrayList class, what is the missing code? def __iter__(self) : Cursor = 0 While cursor < len(self) : Yield self.items[cursor] < missing code >

Correct AnswerverifiedShow Answer

Which of the following list operations is a mutator that works at the currently established position in the list iterator?

Correct AnswerverifiedShow Answer

What is the typical argument to a content-based list operation?

Correct AnswerverifiedShow Answer

What does the rest function do on a Lisp-like list?

Correct AnswerverifiedShow Answer

If a list contains the items x y z and the cursor is currently undefined, what happens when hasNext() is executed?

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

In the init method for the ArrayListIterator class, what is the missing code? def init(self, backingStore) : Self.backingStore = backingStore Self.modCount = backingStore.getModCount() < missing code >

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

In the following code for the iter method in the ArrayList class, what is the missing code? def iter(self) : Cursor = 0 While cursor < len(self) : Yield self.items[cursor] < missing code >

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified