Dynamic structures (part 1)

On this page

Considering our VectorInt
Questions

This lesson contains approximately 20 minutes of video content.

Considering our VectorInt

Questions

Q1

QDynamic Structures, Pt 1 Q1

This question is ungraded.

Our VectorInt's delete_at behavior's worst case (defined as the most elements moved) occurs when:

An element in the middle of the array is removed.

The element at the back of the array is removed.

The element at the front of the array is removed.

When the `array_`'s `size_ == capacity_`.

Practice question: try as many times as you like

Q2

QDynamic Structures, Pt 1 Q2

This question is ungraded.

To access the idxth indexed element in an VectorInt object's array_, we must (select the best answer):

At random, access the array's elements until the `idx`th element is observed.

Directly access the `idx`th element by adding `idx` to `array_` and dereferencing the result.

Directly access the `idx`th element with subscripting as follows: `array_[idx - 1]`.

Sequentially access the elements in order; stop at the `idx`th element.

Practice question: try as many times as you like

Q3

QDynamic Structures, Pt 1 Q3

This question is ungraded.

In the context of this lesson, we make the observation that an operation that can be performed quickly (defined as fewest elements moved/visited) into VectorInt's array_ is the:

deletion of an element from the middle of `array_`.

direct access of an element through pointer arithmetic and the dereference operator.

insertion of an element at the front of `array_`.

sequential access of an element via previous elements in the sequence.

Practice question: try as many times as you like

On this page

Overview
Considering our VectorInt
Questions

About | License | Privacy
Attribution must link to this page: https://learncpp.online/pages/dynamic-structures-part-1-597