Lab 05 Stack Implementation with Applications
Learning Outcomes
After completing the lab students will be able to:
•Implement stacks using linked lists.
•Implement stacks of varying data types using linked lists
•Solve different problems using stacks
In-lab Task 1: Reversing an array of numbers.
You have to write a function to reverse the order of integers in an array. Call this function
from your main function to demonstrate that this functions successfully reverses (in-place)
the contents of the input array. You should declare and use a stack within this function. The
functions for stack implementation are already given to you. The prototype for the function
is given below;
void reverse_num_array(int * num_array);
Code:
main.c file:
/** Program to demonstrate that different data types can be pushed onto the
stack using
* structures. Each element contains an extra field 'd_type' to tell which
data type
* is being pushed onto the stack.
*/
#include <stdio.h>
#include <stdlib.h>
#include "node.h"
#include "stack_functions.h"
#define MAX_SIZE 20
int main()
{
int num_array[MAX_SIZE] = {1, 2, 3, 4, 5,6,7,8,9,10 ,'\0'};
printf("Original array: ");
for (int i = 0; num_array[i] != '\0'; i++) {
printf("%d ", num_array[i]);
}
reverse_num_array(num_array);
printf("\nReversed array: ");
for (int i = 0; num_array[i] != '\0'; i++) {
printf("%d ", num_array[i]);
}
struct node * top = NULL; /// This is the top of the stack
struct element d1, d2, d3;
d1.d = 10;
d1.d_type = 0;
d2.ch = 'A';
d2.d_type = 1;
