Implement a circular queue using an array. Provide the enqueue and dequeue operations. give the answer for 5 marks
Question
Implement a circular queue using an array. Provide the enqueue and dequeue operations. give the answer for 5 marks
Solution
Sure, here is a simple implementation of a circular queue using an array in Python.
class CircularQueue():
def __init__(self, k):
self.k = k
self.queue = [None] * k
self.head = self.tail = -1
# Insert an element
def enqueue(self, data):
if ((self.tail + 1) % self.k == self.head):
print("Circular Queue is full\n")
elif (self.head == -1):
self.head = 0Similar Questions
Q2(a) Given a circular queue with capacity of 9 elements. Show what the contents of the array will be after the specified sequence of enqueue and dequeue operations and show that where the front and rear indices will point. [1.5+1.5 Marks] (a.1) Let us assume that it is array-based, then after performing following operation show the intermediate and final items present in the array? int i; for (i = 1; i <= 9; ++i) enqueue (i); for (i = 1; i <= 5; ++i) { enqueue (dequeue()); dequeue(); } (a.2) Do not start from scratch to build the queue here; continue the following operations on the queue you have created in part (a.1) above. enqueue (10); enqueue (11); dequeue(); dequeue(); enqueue (12); Show the contents of array after each step?
Suppose that Q is a queue implemented with a circular array A, initially empty (with size/capacity = 0). You run the following operations in the order given:1. Q.enqueue(7) 2. Q.enqueue(42) 3. Q.enqueue(3) 4. Q.dequeue()5. Q.enqueue(10)6. Q.first()7. Q.enqueue(5)8. Q.enqueue(30)9. Q.enqueue(15)10. Q.dequeue()11. Q.dequeue()12. Q.dequeue()13. Q.dequeue()14. Q.dequeue()Assuming that insertion and deletion in dynamic arrays use the resizing strategy we have seen during the lectures, describe the entries of the array A after performing the above operations, separating each entry by a comma and no space. If an entry is empty, write "None" (case-sensitive). For example, if the array was [1, 2, None, None], then write "1,2,None,None", omitting the double quotes.
What is circular Queue? Write a C code to insert anelement in circular Queue and condition for full andemptiness of circular Queue
In a circular queue of size 7 if front index=5 and rear index =3 then ___ enqueue operations has been performed.
In a circular array implementation of a queue, the remainder operator (%) can be used to calculate the value of the rear reference in an enqueue operation. A. True B. False
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.