FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 9: Lists

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

True/False

Review LaterAdd Note

Review Later

The basic building block of a doubly linked structure is a node with two pointers: head, which points left; and tail, which points right.

A) True
B) False

Correct Answer

verified

False

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

Why can you refer to an item in a list via its relative position from the head of the list using an index?

A) because it has a circular structure
B) because it uses round-robin
C) because it is ordered linearly
D) because it's arranged in a hierarchy

E) B) and C)
F) A) and C)

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

When the first method is run on the list iterator, what happens?

In the implementation of the lister iterator on a doubly linked list, the method hasNext returns False if the cursor is less than the backing store's length.

With respect to memory, what happens when an object is no longer needed?

Which structure is the ideal one to support a list iterator?

Initially, when a list iterator is opened on a non-empty list, the cursor's position is immediately after the first item in the list.

How does position-based operations allow the programmer to navigate through a list?

A traversal with a list iterator begins by moving the cursor to the first position or to the last position.

Unlike a simple iterator, a list iterator supports movement to previous positions, directly to the first position, and directly to the last position.

A list iterator is an object attached to a list that provides positional operations on that list.

There are two broad categories of list operations discussed in most textbooks on data structures: index-based and content-based.

The __init__ method of a doubly linked list creates a node with no data.

What are the values of a list index at the head and tail of the list, respectively?

Recursive list processing became one of the building blocks of a movement in software development called abstract programming.

A list is a concrete data structure with a specific and unvarying implementation based on a single block of physical memory.

The index-based function get returns the i th element of a given list.

A disk's surface is divided into concentric tracks, and each track is further subdivided into sectors.

Which of the following is true about lists?

The list method remove(item) is an example of a content-based operation.