Find an incorrect statement about the following code. class TenNums { private: int *p; public: TenNums() { p = new int[10]; for (int i = 0; i < 10; i++) p[i] = i; } void display() { for (int i = 0; i < 10; i++) cout << p[i] << " "; } }; int main() { TenNums a; a.display(); TenNums b = a; b.display(); return 0; } Group of answer choices a.display(); will display 0 1 2 3 4 5 6 7 8 9 b.display(); will display 0 1 2 3 4 5 6 7 8 9 TenNums b = a; will invoke a default copy constructor a.p and b.p will point to two separate arrays in the heap
Find an incorrect statement about the following code. class TenNums { private: int *p; public: TenNums() { p = new int[10]; for (int i = 0; i < 10; i++) p[i] = i; } void display() { for (int i = 0; i < 10; i++) cout << p[i] << " "; } }; int main() { TenNums a; a.display(); TenNums b = a; b.display(); return 0; } Group of answer choices a.display(); will display 0 1 2 3 4 5 6 7 8 9 b.display(); will display 0 1 2 3 4 5 6 7 8 9 TenNums b = a; will invoke a default copy constructor a.p and b.p will point to two separate arrays in the heap
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Find an incorrect statement about the following code.
class TenNums {
private:
int *p;
public:
TenNums() {
p = new int[10];
for (int i = 0; i < 10; i++) p[i] = i;
}
void display() { for (int i = 0; i < 10; i++) cout << p[i] << " "; }
};
int main() {
TenNums a;
a.display();
TenNums b = a;
b.display();
return 0;
}
Group of answer choices
a.display(); will display 0 1 2 3 4 5 6 7 8 9
b.display(); will display 0 1 2 3 4 5 6 7 8 9
TenNums b = a; will invoke a default copy constructor
a.p and b.p will point to two separate arrays in the heap
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps
