Which if any of the following code segments correctly implements the IsFull0 met

Question

Which if any of the following code segments correctly implements the IsFull0 method? bool Queue::IsFull () const return {return (rear == front; bool Queue::IsFull () const {return (return == NULL); bool Queue::Isupu11() const {try {Node* temp; return false;} catch (...) {return true;}} bool Queue::IsFu11 () const {try {Node* temp; = new Node; return true;} catch (...) {return false;}) None of the answers provided Which if any of the following code segments correctly implements the Remove() method? int Queue::Remove () {if (IsEmpty ()} throw QueueEmpty ()} throw queus Empty ()} throw QueueEmpty (); else {Node* temp = front; front = front - >next; delete temp;}} int Queue::Remove () {if (IsEmpty ()} throw Queue Empty (); else {Node* temp = new Node; front = front rightarrow next; delete temp;}} int Queue::Remove () {if (IsEmpty ()) throw QueueEmpty (); else {Node* temp = new Node; front = front rightarrow next; int value = temp rightarrow

Explanation / Answer

24) IsFull method returns when a queue is full. The answer is A. The queue has two variables rear and front. When the rear is same as full, this means there is no space is left. So the queue is Full and the function rightly returns true.

25) The answer is D. It deletes the front element and returns the value present in it.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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