C++ Multiple Choice question please help Given a pointer to a node X in a singly

Question

C++ Multiple Choice question please help

Given a pointer to a node X in a singly linked list. Only one pointer is given, a pointer to the head node is NOT given, can we delete the node X from given linked list? A. Possible if X is not the last node. Use the following two steps (a) Copy the data of the next of X to X. (b) Delete next of X. B. Possible if size of linked list is even. C. Possible if X is not first node. Use the following two steps (a) Copy the data of next of X to X. (b) Delete next of X. D. Possible if size of linked list is odd. In the linked-list version of the Stack class, with a pointer to the top, which operations require linear time (O(n)) for their worst-case behavior? A. isEmpty B. peek C. pop D. push E. None of these operations require linear time. What are the user-defined types called that are created by C++- programmers? A. Structures B. Classes C. Stacks D. Queues E. Lists Suppose you were going to quickly implement a dynamic Stack class. What class would be the best base class? A. Binary search tree B. Queue C. List D. Graph

Explanation / Answer

1. Give pointer to a node X in a singly linked list. Only one pointer is given, a pointer is given, a pointer to the head node is NOT given, can we delete the node X from te given linked list?

A. Possible if X is not the last node. Use the following two steps (a) copy the data of the next of X to X (b) Delete next of X

2. In the linked-list version of the Stack class, with a pointer to the top, which operations require linear time (O(n)) for their worst - case behaviour?

E. None of these operations require linear time.

3. What are the user -defined types called that are created by C++ programmers?

B. Classes

4. Suppose you were going to quickly implement a dynamic Stack class. What class would be the best base class?

C. List

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.