Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
SOLVE THE MAZE FUNCTION USING STACK.PLEASE ONLY C CODE,DONT USE C++ AND C#. /* R\C 0 1 2 3 4 5 6 7 */ /* 0 */ {0, 0, 0, 1, 0, 0, 0, 0}, /* 1 */ {0, 1, 1, 1, 0, 0, 1, 0}, /* 2 */ {0, 1, 0, 1, 0, 0, 1, 0}, /* 3 */ {0, 1, 0, 1, 1, 1, 1, 0}, /* 4 */ {0, 1, 0, 0, 0, 0, 1, 1}, /* 5 */ {0, 1, 1, 0, 1, 1, 1, 0}, /* 6 */ {0, 0, 0, 0, 1, 0, 0, 0}, /* 7 */ {0, 0, 0, 0, 1, 0, 0, 0},   #include #include #include typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s { LINKED_STACK_NODE next; void *data; } LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s { LINKED_STACK_NODE head; int count; } LINKED_STACK_t[1], *LINKED_STACK; typedef struct { int R; int C; } POS_t[1], *POS; LINKED_STACK stack_init(); void stack_free(LINKED_STACK stack); void stack_push(LINKED_STACK stack, void *data); void *stack_pop(LINKED_STACK stack); void *stack_top(LINKED_STACK stack); int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack) { return stack->head == NULL; } LINKED_STACK stack_init() { LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t)); if (stack == NULL) { printf("\nproblem with initializing stack\n\n"); return NULL; } stack->head = NULL; stack->count = 0; return stack; } void stack_free(LINKED_STACK stack) { while (is_empty(stack) == 0) { stack_pop(stack); } free(stack); } void stack_push(LINKED_STACK stack, void *data) { LINKED_STACK_NODE node = (LINKED_STACK_NODE)malloc(sizeof(LINKED_STACK_NODE_t)); if (node == NULL) { printf("\nproblem with the creation of a node\n\n"); return; } node->data = data; node->next = stack->head; stack->head = node; stack->count++; } void *stack_pop(LINKED_STACK stack) { LINKED_STACK_NODE node; void *data = NULL; if (stack->head != NULL) { node = stack->head; data = node->data; stack->head = node->next; stack->count--; free(node); } else { printf("\nstack is empty:pop\n\n"); } return data; } void *stack_top(LINKED_STACK stack) { LINKED_STACK_NODE node; void *data = NULL; if (stack->head != NULL) { data = stack->head->data; } else { printf("\nstack is empty:top\n\n"); } return data; } void solve_maze() { int M[8][8] = { /* R\C 0 1 2 3 4 5 6 7 */ /* 0 */ {0, 0, 0, 1, 0, 0, 0, 0}, /* 1 */ {0, 1, 1, 1, 0, 0, 1, 0}, /* 2 */ {0, 1, 0, 1, 0, 0, 1, 0}, /* 3 */ {0, 1, 0, 1, 1, 1, 1, 0}, /* 4 */ {0, 1, 0, 0, 0, 0, 1, 1}, /* 5 */ {0, 1, 1, 0, 1, 1, 1, 0}, /* 6 */ {0, 0, 0, 0, 1, 0, 0, 0}, /* 7 */ {0, 0, 0, 0, 1, 0, 0, 0}, }; int I, J, R = 0, C = 3; LINKED_STACK stack; POS pos = (POS)malloc(sizeof(POS)); int flag; stack = stack_init(); do { // TODO: Fill this block. } while (R != 7 && C != 7 && R != 0 && C != 0); } int main() { solve_maze(); return 0; }

SOLVE THE MAZE FUNCTION USING STACK.PLEASE ONLY C CODE,DONT USE C++ AND C#. /* R\C 0 1 2 3 4 5 6 7 */ /* 0 */ {0, 0, 0, 1, 0, 0, 0, 0}, /* 1 */ {0, 1, 1, 1, 0, 0, 1, 0}, /* 2 */ {0, 1, 0, 1, 0, 0, 1, 0}, /* 3 */ {0, 1, 0, 1, 1, 1, 1, 0}, /* 4 */ {0, 1, 0, 0, 0, 0, 1, 1}, /* 5 */ {0, 1, 1, 0, 1, 1, 1, 0}, /* 6 */ {0, 0, 0, 0, 1, 0, 0, 0}, /* 7 */ {0, 0, 0, 0, 1, 0, 0, 0},   #include #include #include typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s { LINKED_STACK_NODE next; void *data; } LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s { LINKED_STACK_NODE head; int count; } LINKED_STACK_t[1], *LINKED_STACK; typedef struct { int R; int C; } POS_t[1], *POS; LINKED_STACK stack_init(); void stack_free(LINKED_STACK stack); void stack_push(LINKED_STACK stack, void *data); void *stack_pop(LINKED_STACK stack); void *stack_top(LINKED_STACK stack); int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack) { return stack->head == NULL; } LINKED_STACK stack_init() { LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t)); if (stack == NULL) { printf("\nproblem with initializing stack\n\n"); return NULL; } stack->head = NULL; stack->count = 0; return stack; } void stack_free(LINKED_STACK stack) { while (is_empty(stack) == 0) { stack_pop(stack); } free(stack); } void stack_push(LINKED_STACK stack, void *data) { LINKED_STACK_NODE node = (LINKED_STACK_NODE)malloc(sizeof(LINKED_STACK_NODE_t)); if (node == NULL) { printf("\nproblem with the creation of a node\n\n"); return; } node->data = data; node->next = stack->head; stack->head = node; stack->count++; } void *stack_pop(LINKED_STACK stack) { LINKED_STACK_NODE node; void *data = NULL; if (stack->head != NULL) { node = stack->head; data = node->data; stack->head = node->next; stack->count--; free(node); } else { printf("\nstack is empty:pop\n\n"); } return data; } void *stack_top(LINKED_STACK stack) { LINKED_STACK_NODE node; void *data = NULL; if (stack->head != NULL) { data = stack->head->data; } else { printf("\nstack is empty:top\n\n"); } return data; } void solve_maze() { int M[8][8] = { /* R\C 0 1 2 3 4 5 6 7 */ /* 0 */ {0, 0, 0, 1, 0, 0, 0, 0}, /* 1 */ {0, 1, 1, 1, 0, 0, 1, 0}, /* 2 */ {0, 1, 0, 1, 0, 0, 1, 0}, /* 3 */ {0, 1, 0, 1, 1, 1, 1, 0}, /* 4 */ {0, 1, 0, 0, 0, 0, 1, 1}, /* 5 */ {0, 1, 1, 0, 1, 1, 1, 0}, /* 6 */ {0, 0, 0, 0, 1, 0, 0, 0}, /* 7 */ {0, 0, 0, 0, 1, 0, 0, 0}, }; int I, J, R = 0, C = 3; LINKED_STACK stack; POS pos = (POS)malloc(sizeof(POS)); int flag; stack = stack_init(); do { // TODO: Fill this block. } while (R != 7 && C != 7 && R != 0 && C != 0); } int main() { solve_maze(); return 0; }

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%

SOLVE THE MAZE FUNCTION USING STACK.PLEASE ONLY C CODE,DONT USE C++ AND C#.

/* R\C 0 1 2 3 4 5 6 7 */
/* 0 */ {0, 0, 0, 1, 0, 0, 0, 0},
/* 1 */ {0, 1, 1, 1, 0, 0, 1, 0},
/* 2 */ {0, 1, 0, 1, 0, 0, 1, 0},
/* 3 */ {0, 1, 0, 1, 1, 1, 1, 0},
/* 4 */ {0, 1, 0, 0, 0, 0, 1, 1},
/* 5 */ {0, 1, 1, 0, 1, 1, 1, 0},
/* 6 */ {0, 0, 0, 0, 1, 0, 0, 0},
/* 7 */ {0, 0, 0, 0, 1, 0, 0, 0},

 

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE;

typedef struct LINKED_STACK_NODE_s
{
LINKED_STACK_NODE next;
void *data;
} LINKED_STACK_NODE_t[1];

typedef struct LINKED_STACK_s
{
LINKED_STACK_NODE head;
int count;
} LINKED_STACK_t[1], *LINKED_STACK;

typedef struct
{
int R;
int C;
} POS_t[1], *POS;

LINKED_STACK stack_init();
void stack_free(LINKED_STACK stack);
void stack_push(LINKED_STACK stack, void *data);
void *stack_pop(LINKED_STACK stack);
void *stack_top(LINKED_STACK stack);
int is_empty(LINKED_STACK stack);

int is_empty(LINKED_STACK stack)
{
return stack->head == NULL;
}

LINKED_STACK stack_init()
{
LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t));
if (stack == NULL)
{
printf("\nproblem with initializing stack\n\n");
return NULL;
}
stack->head = NULL;
stack->count = 0;
return stack;
}

void stack_free(LINKED_STACK stack)
{
while (is_empty(stack) == 0)
{
stack_pop(stack);
}
free(stack);
}
void stack_push(LINKED_STACK stack, void *data)
{
LINKED_STACK_NODE node = (LINKED_STACK_NODE)malloc(sizeof(LINKED_STACK_NODE_t));
if (node == NULL)
{
printf("\nproblem with the creation of a node\n\n");
return;
}
node->data = data;
node->next = stack->head;
stack->head = node;
stack->count++;
}

void *stack_pop(LINKED_STACK stack)
{
LINKED_STACK_NODE node;
void *data = NULL;

if (stack->head != NULL)
{
node = stack->head;
data = node->data;
stack->head = node->next;
stack->count--;
free(node);
}
else
{
printf("\nstack is empty:pop\n\n");
}
return data;
}

void *stack_top(LINKED_STACK stack)
{
LINKED_STACK_NODE node;
void *data = NULL;

if (stack->head != NULL)
{
data = stack->head->data;
}
else
{
printf("\nstack is empty:top\n\n");
}
return data;
}

void solve_maze()
{
int M[8][8] = {
/* R\C 0 1 2 3 4 5 6 7 */
/* 0 */ {0, 0, 0, 1, 0, 0, 0, 0},
/* 1 */ {0, 1, 1, 1, 0, 0, 1, 0},
/* 2 */ {0, 1, 0, 1, 0, 0, 1, 0},
/* 3 */ {0, 1, 0, 1, 1, 1, 1, 0},
/* 4 */ {0, 1, 0, 0, 0, 0, 1, 1},
/* 5 */ {0, 1, 1, 0, 1, 1, 1, 0},
/* 6 */ {0, 0, 0, 0, 1, 0, 0, 0},
/* 7 */ {0, 0, 0, 0, 1, 0, 0, 0},
};
int I, J, R = 0, C = 3;
LINKED_STACK stack;
POS pos = (POS)malloc(sizeof(POS));
int flag;
stack = stack_init();

do
{
// TODO: Fill this block.
} while (R != 7 && C != 7 && R != 0 && C != 0);
}
int main()
{
solve_maze();
return 0;
}

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS