Instructions
Objective
Write a java assignment program to create queue and dequeue data structure.
Requirements and Specifications
Source Code
#include
int count(char ***deque, char ***back, char ***end) {
return *back - *deque;
}
int capacity(char ***deque, char ***back, char ***end) {
return *end - *deque;
}
char* getFront(char ***deque, char ***back, char ***end) {
if (count(deque, back, end) == 0) {
return NULL;
}
return **deque;
}
char* getBack(char ***deque, char ***back, char ***end) {
if (count(deque, back, end) == 0) {
return NULL;
}
return *(*back - 1);
}
void addBack(char ***deque, char ***back, char ***end, char *string) {
if (count(deque, back, end) == capacity(deque, back, end)) {
return;
}
**back = string;
(*back)++;
}
char* removeBack(char ***deque, char ***back, char ***end) {
if (count(deque, back, end) == 0) {
return NULL;
}
char *result = *(*back - 1);
(*back)--;
return result;
}
char* removeFront(char ***deque, char ***back, char ***end) {
if (count(deque, back, end) == 0) {
return NULL;
}
char *result = **deque;
(*deque)++;
return result;
}
Similar Samples
Explore our curated collection of programming homework samples showcasing expertise in Java, Python, C++, and more. Each example reflects our proficiency in tackling diverse coding challenges effectively. Whether you need assistance with algorithms, data structures, or software development projects, our samples demonstrate our commitment to delivering top-tier solutions tailored to your academic requirements.
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java
Java