Question

Need the answer to these question

1. If N represents the number of elements in the list, then the index-based remove method of the ABList class is O(N).

True

False

2. A list allows retrieval of information based on the size of the information.

True

False

3. If N represents the number of elements in the list, then the index-based add method of the ABList class is O(N).

True

False

4. According to the text's specifications, a collection is a list.

True

False

5. When an object of class LBList represents an empty list, its front variable is null.

True

False

6. A list is a collection with additional index- and iteration- related operations.

True

False

Answer 1

(1) the time complexity is O(N) in index-based element remove method of the ABList class:

Answer: True

Description:

• The overall time complexity of index-based element remove method in ABList class is O(N).

(2) A list allows information retrieval based on the information's size :

Answer: False

Description:

• Information retrieval in a list uses variable size list posting and it does not depend on information's size.

(3) the time complexity is O(N) in index-based element add method of the ABList class:

Answer: True

Description:

• The overall time complexity of index-based element add method is O(N).

(4) According to specification of the text, a list is usually a collection.

Answer: False

Description:

• A List is basically a collection of elements or objects but not according to the specification of text.

(5) If LBList's object represents an empty list, then the front variable is null:

Answer: True

Description:

• When a front == null that means the LBList is empty list.

(6) A list is a collection with iteration related operations and an additional index:

Answer: True

Description:

• A List's size() function returns the maximum index + 1 value. Linked based List also has the iterator() operation or method.