2. Consider your ID as an array of 9 elements. Example ID: 201710340. You have to use your own ID. arr Consider a Circular Queue implemented using an array of length 5. Show the contents of the queue after executing each of the following segments of code in order. a. q.enqueue(arr[8]); q.enqueue(arr[7]); q.enqueue(arr[6]); b. q.dequeue(); q.dequeue(); c. q.enqueue(arr[5]); q.enqueue(arr[4]); q.enqueue(arr[3]); q d. What is the output of the following statements? System.out.printIn(q.size()); System.out.printIn(q.first()); e. Explain what will happen after executing the following statements. q.enqueue(arr[2]); q.enqueue(arr[1]);

2. Consider your ID as an array of 9 elements. Example ID: 201710340. You have to use your own ID. arr Consider a Circular Queue implemented using an array of length 5. Show the contents of the queue after executing each of the following segments of code in order. a. q.enqueue(arr[8]); q.enqueue(arr[7]); q.enqueue(arr[6]); b. q.dequeue(); q.dequeue(); c. q.enqueue(arr[5]); q.enqueue(arr[4]); q.enqueue(arr[3]); q d. What is the output of the following statements? System.out.printIn(q.size()); System.out.printIn(q.first()); e. Explain what will happen after executing the following statements. q.enqueue(arr[2]); q.enqueue(arr[1]);

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Assume you are using a array-based queue and have just instantiated a queue of capacity 10. You enqueue 5 elements, dequeue 5 elements, and then enqueue 1 more element. Which index of the internal array elements holds the value of that last element you enqueued? A. 0. B. 1 C. 4. D. 5. E. 6
In Javascript an array can be treated like a queue---a FIFO (first-in, first-out) data structure. Which two array operations that we studied in class can be used together to treat an array as a queue? a. isEmpty() and isFull() b. queue() and unqueue() c. unshift() and pop() d. push() and pop() e. unshift() and shift()
Please follow this ID (201920090) in this solution for importance, and Consider a Circular Queue implemented using an array of length 5. Show the contents of the queue after executing each of the following segments of code in order, thanks.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
If the following is a circular array based queue of size 99 43 54 76 93 77 18 If rear is at index 1 and front is at index 6, what is the size of the queue?
1.3.14 Create a class called ResizingArrayQueueOfStrings that implements the queue abstraction using a fixed-size array. Then, as an extension, utilise array resizing in your implementation to get rid of the size restriction. 1.3.15 If standard input contains k or more strings, create a Queue client that accepts the command-line argument k and outputs the kth string from the last string located there.
Please code this question in Java according to the function attached in picture. Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
What's the point of constructing this cumbersome circular array stack? For some reason, a circular array is the only viable option for implementing queues.
Suppose that queue is implemented as an array with the special reserved slot, Suppose that the size of the array implementing queue is 100. Also, suppose that the value of queueFront is 74 and the value of queueRear is 99. a. What are the values of queueFront and queueRear after adding an element to queue?b. What are the values of queueFront and queueRear after removing an element from queue? Also, what is the position of the removed queue element?
Create a class called ResizingArrayQueueOfStrings that implements the queue abstraction using a fixed-size array. Then, as an extension, utilise array resizing in your implementation to get rid of the size constraint.
An array of size MAX_SIZE is used to implement a queue. head, tail, and size are tracked. Suppose front is 0 and rear is MAX_SIZE -1. How many elements are present in the queue? a. 0 b. MAX_SIZE-1 c. MAX_SIZE d. 1
Starting with an empty Circul Queue, what will be the state of Circular Queue, front, rare, size and number of elements after each of the following operations performed in the order ( i ) enque(A) (ii) enque (B) (iii) enque (C) (iv) dequeue( ) (v) dequeue( ) (vi) enque(D) (vii) enque(E ) (viii) dequeue( )