Homework Answers
Ans-1: While implementing a stack using a linear linked list (LLL) we use to insert the element at the beginning and also delete the element from the beginning, so top will point to the first element of the linked list or you can say that top will point to the node of the linked list which is also pointed by head pointer for ease of push and pop.
Ans-2:
a. front will point to the first element of the linked list i.e. head. in case of linear linked list (LLL)
b. rear will point to the last element of the linked list i.e. tail. in case of linear linked list (LLL)
c. rear will point to the last element of the circular linked list or you can say that rear will point to the node whose next pointer will point to the first node in the circular linked list (CLL).
Ans-3: Queue follows principle FIFO (First In First out)
So the order of removal is also the order of insertion that is:
10,20,30
Ans-4: Same as Ans-2
a. head
b. tail
Ans-5:
a. rear because then you can access data at front and rear without any linked list traversal because front is the node pointed by the rear node pointer field.
b. front data can be displayed by getting the address of the front node from the pointer field of the rear node and then accessing the data field of the front node.
c. rear data can be displayed simply by accessing the data field of the node pointed by the rear pointer.
Add Answer to:
Where does top point, when implementing a stack with a LLL? Queue ADT: 1· 2. Where...
3. Some circular queue implementations use the mod operator % in enqueue and dequeue operations. Explain...
3. Some circular queue implementations use the mod operator % in enqueue and dequeue operations. Explain why this is inefficient. 4. If a queue is implemented using a singly linked list with a head and tail pointer, you should always insert at the tail and remove from the head. Explain why this is so. 5. What is a Priority Queue, and how does it differ from a standard queue? 6. Priority Queues are almost always implemented with an ordered data...
Your assignment is to create and test a class for a queue of objects. You may...
Your assignment is to create and test a class for a queue of objects. You may use any object class of your choice as the data for the queue. The instances of the class should have at least one field that distinguishes each instance from other instances of the class (key property, also called a key field). You should complete the software to implement and test your queue and submit the software along with a project report. Your queue class...
A limited-sized Queue ADT is an abstract data type that has a limit on the length...
A limited-sized Queue ADT is an abstract data type that has a limit on the length of the queue. It can be created with a static array of size N, where N is the maximum length of the array. In C, this structure can be defined as follows: typedef struct {int * data;//array of the data on the queue//you may add other attributes here but use as few as possible} queue_t; Write an (efficient) pseudocode for the implementation of each...
e. public class Queue { // Uses the correct Stack class from ME2 Ex 19 private Stack mStack; public Queue() { setStack(new Stack()); } public Queue enqueue(E pData) { getStack().push(pData); return t...
e. public class Queue { // Uses the correct Stack class from ME2
Ex 19 private Stack mStack; public Queue() { setStack(new Stack());
} public Queue enqueue(E pData) { getStack().push(pData); return
this; } public E dequeue() { return getStack().pop(); } public E
peek() { return getStack.peek(); } private Stack getStack() {
return mStack; } private void setStack(Stack pStack) { mStack =
pStack; } }
f. public class Queue extends Stack { // Uses the correct Stack
class from ME2 Ex...
HI USING C++ CAN YOU PLEASE PROGRAM THIS ASSIGNMENT AND ADD COMMENTS: stackARRAY: #include<iostream> #define SIZE...
HI USING C++ CAN YOU PLEASE PROGRAM THIS ASSIGNMENT AND ADD
COMMENTS:
stackARRAY:
#include<iostream>
#define SIZE 100
#define NO_ELEMENT -999999
using namespace std;
class Stack {
int arr[SIZE]; // array to store Stack elements
int top;
public:
Stack() {
top = -1;
}
void push(int); // push an element into Stack
int pop(); // pop the top element from Stack
int topElement(); // get the top element
void display(); // display Stack elements from top to bottom
};
void Stack...
What is the principle difference in behavior between a stack and a queue? a stack preserves...
What is the principle difference in behavior between a stack and a queue? a stack preserves the order in which items are added whereas a queue reverses order there is no difference a stack reverses the order in which items are added whereas a queue preserves order xa stack does nothing whereas a queue can preserve and reverse the order that items are added to it Fill in the blank in the following sentence with one of the answers listed....
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]; //...
// =================== Support Code ================= // Queue // // // // - Implement each of the functions to create a working circular queue. // - Do not change any of the function declarations // ...
// =================== Support Code ================= // Queue // // // // - Implement each of the functions to create a working circular queue. // - Do not change any of the function declarations // - (i.e. queue_t* create_queue(unsigned int _capacity) should not have additional arguments) // - You should not have any 'printf' statements in your queue functions. // - (You may consider using these printf statements to debug, but they should be removed from your final version) // ==================================================...
In this assignment you will be implementing two Abstract Data Types (ADT) the Queue ADT and...
In this assignment you will be implementing two Abstract Data Types (ADT) the Queue ADT and the Stack ADT. In addition, you will be using two different implementations for each ADT: Array Based Linked You will also be writing a driver to test your Queue and Stack implementations and you will be measuring the run times and memory use of each test case. You will also be adding some functionality to the TestTimes class that you created for Homework 1....
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...
3. Some circular queue implementations use the mod operator % in enqueue and dequeue operations. Explain why this is inefficient. 4. If a queue is implemented using a singly linked list with a head and tail pointer, you should always insert at the tail and remove from the head. Explain why this is so. 5. What is a Priority Queue, and how does it differ from a standard queue? 6. Priority Queues are almost always implemented with an ordered data...
A limited-sized Queue ADT is an abstract data type that has a limit on the length of the queue. It can be created with a static array of size N, where N is the maximum length of the array. In C, this structure can be defined as follows: typedef struct {int * data;//array of the data on the queue//you may add other attributes here but use as few as possible} queue_t; Write an (efficient) pseudocode for the implementation of each...
e. public class Queue { // Uses the correct Stack class from ME2
Ex 19 private Stack mStack; public Queue() { setStack(new Stack());
} public Queue enqueue(E pData) { getStack().push(pData); return
this; } public E dequeue() { return getStack().pop(); } public E
peek() { return getStack.peek(); } private Stack getStack() {
return mStack; } private void setStack(Stack pStack) { mStack =
pStack; } }
f. public class Queue extends Stack { // Uses the correct Stack
class from ME2 Ex...
HI USING C++ CAN YOU PLEASE PROGRAM THIS ASSIGNMENT AND ADD
COMMENTS:
stackARRAY:
#include<iostream>
#define SIZE 100
#define NO_ELEMENT -999999
using namespace std;
class Stack {
int arr[SIZE]; // array to store Stack elements
int top;
public:
Stack() {
top = -1;
}
void push(int); // push an element into Stack
int pop(); // pop the top element from Stack
int topElement(); // get the top element
void display(); // display Stack elements from top to bottom
};
void Stack...
What is the principle difference in behavior between a stack and a queue? a stack preserves the order in which items are added whereas a queue reverses order there is no difference a stack reverses the order in which items are added whereas a queue preserves order xa stack does nothing whereas a queue can preserve and reverse the order that items are added to it Fill in the blank in the following sentence with one of the answers listed....
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]; //...
Most questions answered within 3 hours.
-
could someone please post clear drawings of the three structures
in the equilibrium mixture of D-glucose...
asked 2 minutes ago -
Using the Properties of Order show that 5n5 +
4n4 + 6n3 + 2n2+ n +...
asked 5 minutes ago -
What is experiential learning and how is it helpful for teaching
leadership, and interpreting group dynamics?...
asked 5 minutes ago -
A security awareness policy defines the responsibilities of
managers and information owners.
True
False
asked 6 minutes ago -
which is the equilibrium expression for the reaction
3A(g)+4B(g)<---> 2C(g)+5D(g)
asked 8 minutes ago -
Create a balanced compensation plan that you feel would
encourage a restaurant manager to be more...
asked 15 minutes ago -
Re: Human Physiology
Comment on the differences between representing V02 max as an
absolute number and...
asked 17 minutes ago -
A firm with a WACC of 10% is considering the following mutually
exclusive projects:
0
1...
asked 22 minutes ago -
. A 100.0 mL sample of 0.18 M HClO4 is titrated with 0.27 M
LiOH. Determine...
asked 45 minutes ago -
A regression equation that describes the relationship between
the amount of the bill ($) at a...
asked 1 hour ago -
exercise on VSEPR and molecular structrue.
octahedral
SeCl62-
TeCl62-
ClF62-
distorted
SeF62–
IF6–
asked 2 hours ago -
284 mL of a 0.52 M potassium hydroxide solution is added to 467
mL of a...
asked 2 hours ago