Copying with random pointers

Questions 1 to 5 of 6

1. 1. A list node has a random pointer. A copy is made with made->random = old->random;, which copies the pointer value. What does the copy's random pointer point at?

   A new node that holds the same value, so the copy is independent of the originalA null pointer, because the copy has not set its random pointers yetThe original node that the old random pointer names, so the copy shares that node with the sourceA copy of the old random target, made by the hash map
2. 2. After step 1 of the interleave method, the list reads A, A', B, B', C, C'. In step 2, which expression sets the random pointer of the copy A'?

   A->random->next, the copy of A's random targetA->random, the original target BA->next->random, the random pointer of A' itselfA->random->random, the random pointer of the target
3. 3. Which statements about the two copy methods in this lesson are true?

   Pick every answer that is true.

   The map method uses extra memory that grows with the number of nodesThe interleave method uses a fixed amount of extra memory beyond the copyThe interleave method never changes the source list while it runsThe map method makes every copy in its first pass, before any pointer is setThe interleave method needs a hash map to find the copy of each random target
4. 4. Which of these does check_copy test, as the lesson writes it?

   Pick every answer that is true.

   The copy has the same memory addresses as the originalThe values match in order along the two listsNo node of the copy is also a node of the originalThe copy's head is the same pointer as the original's headEach random pointer points at the same position in the copy as in the original
5. 5. Match each term to its meaning in this lesson.

   Choose the matching item for each row.

   deep copyChoose…copies the pointer values, so the copy shares nodes with the originalextra memory that does not grow with the length of the lista table that finds a value from a key in about one stepnew nodes that point only at new nodesshallow copyChoose…copies the pointer values, so the copy shares nodes with the originalextra memory that does not grow with the length of the lista table that finds a value from a key in about one stepnew nodes that point only at new nodeshash mapChoose…copies the pointer values, so the copy shares nodes with the originalextra memory that does not grow with the length of the lista table that finds a value from a key in about one stepnew nodes that point only at new nodesconstant extra spaceChoose…copies the pointer values, so the copy shares nodes with the originalextra memory that does not grow with the length of the lista table that finds a value from a key in about one stepnew nodes that point only at new nodes