Which if any of the following code segments correctly implements the method -Sta

Question

Which if any of the following code segments correctly implements the method -Stack? Stack:: approximately Stack() {delete [] data;} void approximately stack::stack () {delete [] data;} stack::approximately () {delete data [];} stack::approximately stack () {/* No code required here */} None of the answers provided Assuming that the Stack object named s has been declared correctly in the client program. which of the following code segments correctly adds the integer value 5 to the top of stack s assuming that s is not full? S = 5 s.pop(5); s.push(5); s = s + 5; None of the answers provided Which acronym accurately describes the access policy of a stack container? FIFD LOL LIFO LIFI None of the answers provided Suppose that a object contains the following values Front {5, 2, 9, 8} Rear. What is the content of the queue after the following operation? Enqueue(6) Front {5, 2, 9, 8, 6) Rear Front {6, 5, 2, 9, 8) Rear Front (2, 9, 8) Rear None of the answers provided Suppose that a object contains the following values Front {5, 2, 9, 8 Rear. What is the contents the queue after the following operation (x is int)? Dequeue (x) Front {5, 2, 9, 8) Rear Front (5, 2, 9) Rear Front (2, 9, 8) Rear Front {} Rear None of the answers provided Suppose that a queue object contains the following values Front 5, 2, 9, 8)Rear What is the contents of the queue after the following sequence of operations are executed left-to-right (x is int)? Dequeue(x) Front {5, 2, 9, 8} Rear Front {5, 2, 9, 8, 6) Rear Front {6, 5, 2, 9, 8} Rear Front {2, 9, 8, 6} Rear None of the answers provided Suppose that a queue object contains the following values Front {5, 2, 9, 8} Rear What is the contents of the queue after the following sequence of operations are executed Dequeue(x), left-to-right (x is int)? Front {5, 2, 9, 5} Rear Front {5, 2, 9, 8, 5} Rear Front {5, 2, 9, 8} Rear None of the answers provided

Explanation / Answer

Q13: Answer is C

stack::~stack()

{

delete[] data;

}

This destructor code deletes the stack , so it is correct

Q14:

Answer C : s.Push(5);

This Push methos adds element 5 on top of the stack.

Q15:

Answer A: FIFO

This is the Stack property,FIFO(First in First out)

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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