Skip to main content

C Program To Implement Stack Operations.

Stack is an area of memory that holds all local variables and parameters used by any function. It also remembers the order in which functions are called so that function returns occur correctly. Stack is a LIFO data structure. Stack operations are PUSH (insert operation), POP (Delete operation), and Display (stack). Each time a function is called, its local variables and parameters are “pushed onto” the stack. When the function returns, these locals and parameters are “popped”.

#include <stdio.h>
#define MAXSIZE 25

struct stack {
int stk[MAXSIZE];
int top;
};

typedef struct stack STACK;
STACK s;

void push(void);
int  pop(void);
void display(void);

int main () {
int choice;
int option = 1;
s.top = -1;

printf ("\tSTACK OPERATION\n");
while (option) {

printf ("\n------------------------------------------\n");
printf ("      1    -->    PUSH               \n");
printf ("      2    -->    POP               \n");
printf ("      3    -->    DISPLAY               \n");
printf ("      4    -->    EXIT           \n");
printf ("------------------------------------------\n");

printf ("\nEnter your choice: ");
scanf    ("%d", &choice);

switch (choice) {
case 1: push();
break;
case 2: pop();
break;
case 3: display();
break;
case 4: return 0;
}

fflush (stdin);
printf ("\nDo you want to continue(Type 0 or 1)? ");
scanf    ("%d", &option);
}}

/*  Function to add an element to the stack */
void push () {
int num;
if (s.top == (MAXSIZE - 1)) {
printf ("\nStack is Full.\n");
return;
}
else {
printf ("\nEnter the element to be pushed: ");
scanf ("%d", &num);
s.top = s.top + 1;
s.stk[s.top] = num;
}
return;
}

/*  Function to delete an element from the stack */
int pop () {
int num;
if (s.top == - 1) {
printf ("\nStack is Empty.\n");
return (s.top);
}
else {
num = s.stk[s.top];
printf ("\npoped element is = %d\n", s.stk[s.top]);
s.top = s.top - 1;
}
return(num);
}

/*  Function to display the status of the stack */
void display () {
int i;
if (s.top == -1) {
printf ("\nStack is empty.\n");
return;
}
else {
printf ("\nThe status of the stack is:\n");
for (i = s.top; i >= 0; i--) {
printf ("%d\n", s.stk[i]);
}}
printf ("\n");
}

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...

C Program To Check Whether A Number Is Palindrome Or Not.

This program takes an integer from user and the integer is reversed. If the reversed integer is equal to the integer entered by user then that number is a palindrome. If not that number is not a palindrome.   #include <stdio.h> int main()  { int num, temp, remainder, reverse = 0; printf("Enter an integer: "); scanf("%d", &num); /*  original number is stored at temp */ temp = num; while (num > 0)  { remainder = num % 10; reverse = reverse * 10 + remainder; num /= 10;   }

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;

C Program To Convert Natural Numbers To Roman Numerals.

Roman Number System of representing numbers devised by the ancient Romans. The numbers are formed by combinations of the symbols I, V, X, L, C, D, and M, standing, respectively, for 1, 5, 10, 50, 100, 500, and 1,000 in the Hindu-Arabic numeral system. Natural numbers mean no negative numbers and no fractions, i.e. the whole numbers from 1 upwards: 1, 2, 3, and so on. Here is source code of the C program to convert natural numbers to Roman Numerals. It compiles and runs on any operating system. #include <stdio.h> void predigit(char num1, char num2); void postdigit(char c, int n); char romanval[1000]; int i = 0; int main() { int j; long number; printf("Enter any natural number: "); scanf("%d", &number);