Two Dimensional Arrays and Class Design

These flashcards cover key concepts discussed during the lecture on two-dimensional arrays and the design of classes in C++.

What is a key challenge when pushing back elements in a two-dimensional array?

Determining whether to push back entire rows or columns, which complicates implementation.

What must always be checked when implementing a destructor for a class with dynamic memory?

The pointer must be checked against null to avoid deleting memory that has already been freed.

What does the term 'row major' refer to in the context of arrays?

It indicates that data is stored in memory row by row, meaning complete rows are stored contiguously.

Why are copy constructors necessary when dealing with dynamic memory?

They are needed to ensure deep copying of the data to avoid memory leaks or double deletions.

What is the purpose of overloading the assignment operator in a class with dynamic memory?

To allow assignment of one object to another while managing dynamic resources correctly.

What two member functions are necessary for a class that manages dynamic array allocations?

A destructor and a copy constructor.

What will likely happen if both a class's copy constructor and assignment operator are not defined?

The compiler will generate default versions that perform shallow copies, leading to potential memory issues.

What should be included in the interface of a two-dimensional array class?

Functions for rows and columns access, as well as overloads for the square bracket operator.

What do we call a class in C++ that can handle different data types through templates?

A template class.