can you correct these answers in order to get full credit on the grade? C++ // i

Question

can you correct these answers in order to get full credit on the grade?
C++ // intro to Data Structures 2. (s points) Using the following C++ code and answer the questions below. include char queue [5]; int size sizeoff (queue)/ sizeof (queue [0]); int front 0: int tail. 0; int inqueue 0; void enqueue(char item) queue [tail] item tail++; if (tail size) tail. 0; char dequeue() char item queue (front queue [front] front++; if (front size) front 0: return item; int main() enqueue B'); enqueue ('K'): K ('J'): KJ dequeue(): K. J front queue lo] dequeue(): J ('H'); JH enqueue ('R'); HR queue tail enqueue ('I'); J H R enqueue 'A'): H RIA dequeue return 0; Sront queue 01 x Where is the current front located? what the item at the front of the queue? tt queue LEJix Where is the current tail located? tat A What is the item at the back of the queue? What items remain in the queue and in what order? queue queue queue

Explanation / Answer

2. Answers

Front is located at 3

item at the front is H

Tail is located at 2

item at the front is A

Remaining elements I A H R

3. Answers

on first iteration mid is 4.

a[4] = 10

if and the remaining two el if will fail and execution directily comes to else and print 'T'

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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