In Array Based Queue. The program calls for implementing a queue using an array such that...
In Array Based Queue. The program calls for implementing a queue using an array such that the queue wraps around to reuse empty array slots. This means that the Head and Tail of the array can reverse relative positions.
If, rather than changing the value of the Head and Tail, a modulus (of the size of the array) was used instead, what boundary condition could eventually be reached?
Homework Answers
rear = rear+1%n;
Where n is the size of the queue.
Modulus returns the remainder of the two operands. For example,
4%2=0 since 4/2=2 with no remainder,
while 4%3=1 since 4/3=1 with remainder 1.
Since you can never have a remainder higher than the right operand,
you have an effective "range" of answers for any modulus of
0 to (n-1). With that in mind, just plug
in the numbers for the variables ((4+1)%5=? and
(1+1)%4=?). Usually to find the remainder you would
use long division, but one useful thing to remember is that any
number divided by itself has a remainder of 0, and any number
divided by a larger number will have a remainder equal to
itself.
Hence the boundary condition achieved is when at given position there is already an element which is present hence it will break the loop and element would not be enqued untill position is free.
Add Answer to:
In Array Based Queue. The program calls for implementing a queue
using an array such that...
Suppose we want to implement a circular queue using an array that has an initial capacity...
Suppose we want to implement a circular queue using an array that has an initial capacity (maximum number of elements) MAX. A circular queue is like a regular queue except that elements can be enqueued or dequeued by wrapping around it. Assume we enqueue on the tail and dequeue from the head. An example circular queue with sample operations is shown below: head head tail head tail tail head Enqueue(9) a) Write a program in C that implements this circular...
Build and use your own minimal queue class using an array of type String of fixed...
Build and use your own minimal queue class using an array of type String of fixed size to hold the queue. The array should have the default size of 5. The array size should be setable via a constructor. The following methods must be implemented: enqueue – inserts a value at the rear of the queue dequeue – returns the value at the front of the queue, removing the value from the queue isEmpty – returns true if the queue...
Lab 3 – Array-Based Stack and Queue Overview In this assignment, you will be implementing your...
Lab 3 – Array-Based Stack and Queue Overview In this assignment, you will be implementing your own Array-Based Stack (ABS) and Array-Based Queue (ABQ). A stack is a linear data structure which follows the Last-In, First-Out (LIFO) property. LIFO means that the data most recently added is the first data to be removed. (Imagine a stack of books, or a stack of papers on a desk—the first one to be removed is the last one placed on top.) A queue...
AQueue.java class AQueue implements Queue { private E queueArray[]; // Array holding queue elements private static...
AQueue.java
class AQueue implements Queue {
private E queueArray[]; // Array holding queue elements
private static final int DEFAULT_SIZE = 10;
private int maxSize; // Maximum size of queue
private int front; // Index of front element
private int rear; // Index of rear element
// Constructors
@SuppressWarnings("unchecked") // Generic array allocation
AQueue(int size) {
//BUG #1: maxSize = size
maxSize = size+1; // One extra space is allocated
rear = 0; front = 1;
queueArray = (E[])new Object[maxSize]; //...
//Look for** to complete this program --C+ please --please add comments // using namespace std; #include...
//Look for** to complete this program --C+ please --please add comments // using namespace std; #include <iostream> #include <stdlib.h> #include < string> #include "queue.h" //Purpose of the program: ** Algorithm: * int main() /** "A", "B", "C" in the queue //** while loop -- indefinitely { try {//** catches } //* end of loop } |/ II II II II II //File type: ** queue.cpp using namespace std; #include <iostream> #include "queue.h" // constructor queue::queue () } //destructor queue::~queue() queue::queue...
Write a menu based program implementing the following functions: (0) Write a function called displayMenu that...
Write a menu based program implementing the following functions: (0) Write a function called displayMenu that does not take any parameters, but returns an integer representing your user's menu choice. Your program's main function should only comprise of the following: a do/while loop with the displayMenu function call inside the loop body switch/case, or if/else if/ ... for handling the calls of the functions based on the menu choice selected in displayMenu. the do/while loop should always continue as long...
Write one single program that does all of the following tasks, in order. You should practice...
Write one single program that does all of the following tasks, in order. You should practice proper Top Down Design and Procedural Abstraction techniques unless otherwise noted. -Write a program with the following functions, with the correct number of arguments for each function. -void fillUpArray ( argument1, argument2) This function should read in a text file called "villagers.txt" (You will create your own). "villagers.txt" is a text file of numbers in ascending order, ranging anywhere from 1 to 100, nonrepeating....
The goal is to create a code for implementing a Columns game using pygame Your program...
The goal is to create a code for implementing a Columns game using pygame Your program will read its input via the Python shell (i.e., using the built-in input() function), printing no prompts to a user with no extraneous output other than precisely what is specified below. The intent here is not to write a user-friendly user interface; what you're actually doing is building a tool for testing your game mechanics, which we'll then be using to automatically test them....
starter code To write a program using the starter code which is TestLinkedList to see if...
starter code
To write a program using the starter code which is
TestLinkedList to see if the LinkedList program has bugs. It will
produce ether a pass or fail.More information is in the first two
pictures.
LinkedList.java
/**
* @author someone
*
* Implements a double-linked list with four errors
*/
public class LinkedList<E>
{
// The first and last nodes in the list
private Node<E> head, tail;
// Number of items stored in the list
private int size;
//...
JAVA: Already completed: MyList.java, MyAbstractList.java, MyArrayList.java, MyLinkedLink.java, MyStack.java, MyQueue.java. Need to complete: ReversePoem.java. This program has...
JAVA: Already completed: MyList.java, MyAbstractList.java, MyArrayList.java, MyLinkedLink.java, MyStack.java, MyQueue.java. Need to complete: ReversePoem.java. This program has you display a pessimistic poem from a list of phrases. Next, this program has you reverse the phrases to find another more optimistic poem. Use the following algorithm. 1. You are given a list of phrases each ending with a pound sign: ‘#’. 2. Create a single String object from this list. 3. Then, split the String of phrases into an array of phrases...
Suppose we want to implement a circular queue using an array that has an initial capacity (maximum number of elements) MAX. A circular queue is like a regular queue except that elements can be enqueued or dequeued by wrapping around it. Assume we enqueue on the tail and dequeue from the head. An example circular queue with sample operations is shown below: head head tail head tail tail head Enqueue(9) a) Write a program in C that implements this circular...
AQueue.java
class AQueue implements Queue {
private E queueArray[]; // Array holding queue elements
private static final int DEFAULT_SIZE = 10;
private int maxSize; // Maximum size of queue
private int front; // Index of front element
private int rear; // Index of rear element
// Constructors
@SuppressWarnings("unchecked") // Generic array allocation
AQueue(int size) {
//BUG #1: maxSize = size
maxSize = size+1; // One extra space is allocated
rear = 0; front = 1;
queueArray = (E[])new Object[maxSize]; //...
//Look for** to complete this program --C+ please --please add comments // using namespace std; #include <iostream> #include <stdlib.h> #include < string> #include "queue.h" //Purpose of the program: ** Algorithm: * int main() /** "A", "B", "C" in the queue //** while loop -- indefinitely { try {//** catches } //* end of loop } |/ II II II II II //File type: ** queue.cpp using namespace std; #include <iostream> #include "queue.h" // constructor queue::queue () } //destructor queue::~queue() queue::queue...
starter code
To write a program using the starter code which is
TestLinkedList to see if the LinkedList program has bugs. It will
produce ether a pass or fail.More information is in the first two
pictures.
LinkedList.java
/**
* @author someone
*
* Implements a double-linked list with four errors
*/
public class LinkedList<E>
{
// The first and last nodes in the list
private Node<E> head, tail;
// Number of items stored in the list
private int size;
//...
Most questions answered within 3 hours.
-
What mechanisms Drive speciation??
(I.e. what was Dawins theory on the orgin of species, and how...
asked 28 minutes ago -
The manager at a car assembly plant believes that the mean
assembly time for a car...
asked 1 hour ago -
Which of the following is true of electron capture?
A) It decreases the nuclide's mass number...
asked 2 hours ago -
Assuming an efficiency of 43.10%, calculate the actual yield of
magnesium nitrate formed from 114.9 g...
asked 3 hours ago -
The highly pathogenic bacterium Clostridium
perfringens causes gangrene, a disease that results in the
destruction of...
asked 5 hours ago -
In the context of situation analysis, which of the following is
a category for analysis in...
asked 5 hours ago -
In a study of the gas phase decomposition of sulfuryl chloride
at 600 K SO2Cl2(g)SO2(g) +...
asked 5 hours ago -
75 g of 2-propanol (C3H8O) and 25 g of pentane are mixed in a
200 mL...
asked 5 hours ago -
The 2800-turn coil in a dc motor has an area per turn of 1.1 ×
10-2...
asked 5 hours ago -
Draw a combinational logic circuit diagram with a symbol inside
the box for two I/P of...
asked 5 hours ago -
The cliché we use quite a lot in finance is: there is a need to
maximize...
asked 5 hours ago -
In class we discussed the addition of HCl to alpha pinene. Would
you expect one or...
asked 5 hours ago