Question

Suppose each data structure is stored in a circular array with n memory cells

Answer 1

Suppose STACK is allocated N=6 memory cells and initially stack is empty, or in other words TOP=0. ... 16Suppose each data structure is stored in a circular array with N memory cells

❤#⃣✌❤#⃣✌❤#⃣❤✌

Answer 2

Suppose each data structure is stored in a circular array with n memory cells

• A circular queue is a lengthened variant of a conventional queue where the start and last elements are interconnected. resulting in a structure resembling a circle.
• circular representation of a queue. The main drawback of the conventional queue is addressed by the circular queue.

#include <stdio.h>

# define max 6.

int queue[max]; // array declaration.

int front=-1;

int rear=-1;

// function to insert an element in a circular queue.

void enqueue(int element)

{

}

Circular queue is a technique used in memory management. Process scheduling: A CPU schedules processes via a queue. Queues are utilised in traffic systems as well.

#SPJ3