Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

main.c queue_functions.h queue_functions.c stack_functions.h stack_functions.c If you don't know how to do we have an example If you are not familiar with terminal, this video

image text in transcribed
image text in transcribed
main.c
image text in transcribed
queue_functions.h
image text in transcribed
queue_functions.c
image text in transcribed
stack_functions.h
image text in transcribed
stack_functions.c
image text in transcribed
If you don't know how to do we have an example If you are not familiar with terminal, this video may help you Ccompile and run a C program with cmd E (optional video) - YouTube Input.txt format: 1QWER 2F3SS4FLASH Lev100.0Q00LL3.31 Asc112PIEQUALTO 3.14159 Output.txt format: (stack) +1 love 4 cs 2 Output.txt format: (queue) 1234 1003.3 1123.14159 total =228.44159 \#include \#include "stack_functions.h" \#include "queue_functions.h" \#define MAX_BUFFER 1024 int main(int argc, char *argv[]) \{ // utilize fopen function // implement those requirements return 0 ; \} \#ifndef QUEUE_FUNCTIONS_H \#define QUEUE_FUNCTIONS_H \#define MAX_NUMBERS 100 typedef struct \{ char* items[MAX_NUMBERS]; int front, rear; \} Queue; void initializeQueue (Queue* queue); int isQueueEmpty (Queue* queue); void enqueue(Queue* queue, char* item); char* dequeue(Queue* queue); void printNumbersAndSum(Queue* queue); \#endif \#include \#include \#include \#define MAX_LENGTH 20 \#define MAX_NUMBERS 100 typedef struct \{ char* items [MAX_NUMBERS]; int front, rear; \} Queue; void initializeQueue(Queue* queue) \{ \} int isQueueEmpty(Queue* queue) \{ \} void enqueue(Queue* queue, char* item) \{ \} char* dequeue (Queue* queue) \{ \} void printNumbersAndSum(Queue* queue) \{ // Implement this function to print numbers and their summation \} \#ifndef STACK_FUNCTIONS_H \#define STACK_FUNCTIONS_H \#define MAX_WORDS 100 typedef struct \{ char* items[MAX_WORDS]; int top; \} Stack; void initializeStack (Stack* stack); int isStackEmpty (Stack* stack); void push(Stack* stack, char* item); char* pop(Stack* stack); void printLowerCaseWordsReverse (Stack* stack); \#endif \#include \#include \#define MAX_LENGTH 20 \#define MAX_WORDS 100 typedef struct \{ char* items[MAX_WORDS]; int top; \} Stack; void initializeStack(Stack* stack) \{ \} int isStackEmpty(Stack* stack) \{ \} void push(Stack* stack, char* item) \{ \} char* pop(Stack* stack) \{ \} void printLowerCaseWordsReverse (Stack* stack) \{ // Implement this function to print lowercase words in reverse order \}

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Medical Image Databases

Authors: Stephen T.C. Wong

1st Edition

1461375398, 978-1461375395

More Books

Students also viewed these Databases questions