Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

1-When a copy of an object is made such that the addresses stored in the pointer

ID: 3715455 • Letter: 1

Question

1-When a copy of an object is made such that the addresses stored in the pointers of the original are the same addresses as the corresponding pointers in the copy a deep copy is made.

True

False

2-In the deep copy function of the DoublyLinkedList, the pointer values will be copied by default

True

False

3-During a deep copy the address of a pointer in the original is different than the address of the corresponding pointer in the copy.

True

False

4-A pointer is an address, an address is an integer, but a pointer is not an integer.

True

False

5-A copy constructor is used to make a copy of an object (for example, when the object is passed by value)

True

False

6-Inserting a new node at the beginning of the linked list is faster than inserting a new node at the end of the list (assuming there is no pointer to the end of the list) because the beginning of the linked list is less complicated than the end of the linked list

True

False

Explanation / Answer

Answers are highlighted in bold..

===============================================================

1-When a copy of an object is made such that the addresses stored in the pointers of the original are the same addresses as the corresponding pointers in the copy a deep copy is made.

True

False

2-In the deep copy function of the DoublyLinkedList, the pointer values will be copied by default

True

False

3-During a deep copy the address of a pointer in the original is different than the address of the corresponding pointer in the copy.

True

False

4-A pointer is an address, an address is an integer, but a pointer is not an integer.

True

False

5-A copy constructor is used to make a copy of an object (for example, when the object is passed by value)

True

False

Ex:We pass the object by refernce

6-Inserting a new node at the beginning of the linked list is faster than inserting a new node at the end of the list (assuming there is no pointer to the end of the list) because the beginning of the linked list is less complicated than the end of the linked list

True

False

===============================================================