Contents
Chapter 7 · Data Structure and AlgorithmPractice
← Return to textbook

ORIGINAL TEXTBOOK EXERCISES

Data Structure and Algorithm · Exercises

12 original textbook exercises in chapter order.

Textbook Exercises
0/12 answered

Question 1 of 12

0/12 answered

Volume 1 · Chapter 7 · Textbook Exercises · Q1

Original textbook exercise · Select the image to enlarge
Read the question as text

The figure shows a singly-linked list. “Tokyo” is at the first element of the list, and this pointer contains the address of the next element. In addition, “Nagoya” is at the last element of the list, and this pointer contains 0. Which of the following is the process that inserts “Shizuoka” between “Atami” and “Hamamatsu”? Here, “Shizuoka” is located at address 150.

The original image above preserves the complete textbook wording and layout.

Choose your answer
Choose an option to check your answer.
1 / 12

Concept practice: Singly-linked list insertion

Source: FE Vol 1.pdf, PDF page 455, textbook p. 445 · Information-technology Promotion Agency, Japan · First Edition: April, 2015. ID: tb-v1-c7-q1. Publisher answer and commentary · private review.

Original question · Q1
Q1 
The figure shows a singly-linked list. “Tokyo” is at the first element of the list, and this 
pointer contains the address of the next element. In addition, “Nagoya” is at the last element 
of the list, and this pointer contains 0. Which of the following is the process that inserts 
“Shizuoka” between “Atami” and “Hamamatsu”? Here, “Shizuoka” is located at address 150. 
 
 
a) Setting the pointer of Shizuoka to be 50 and the pointer of Hamamatsu to be 150 
b) Setting the pointer of Shizuoka to be 70 and the pointer of Atami to be 150 
c) Setting the pointer of Shizuoka to be 90 and the pointer of Hamamatsu to be 150 
d) Setting the pointer of Shizuoka to be 150 and the pointer of Atami to be 90

Scroll horizontally to read the image at full size.