Week4

 #include<stdio.h> #include<conio.h> #define size 10 void push(int); void pop();

void display();

int stack[size], top = -1; void main()

{

int ele, choice; clrscr();

while(1){

printf("\n\n***** MENU *****\n"); printf("1. Push\n2. Pop\n3. Display\n4. Exit"); printf("\nEnter your choice: "); scanf("%d",&choice);

switch(choice){

case 1: printf("Enter the value to be insert: "); scanf("%d",&ele);

push(ele); break;

case 2: pop();

break; case 3: display();

break; case 4: exit(0);

default: printf("\nWrong selection!!! Try again!!!");

}

}

}


void push(int ele)

{

if(top == size-1)

printf("\nStack is Full!!! Insertion is not possible!!!"); else


{

top++; stack[top] = ele;

printf("\nElement Inserted!!!");

}

}


void pop()

{

if(top == -1)

printf("\nStack is Empty!!! Deletion is not possible!!!"); else

{

printf("\nDeleted : %d", stack[top]); top--;

}

}

void display()

{

if(top == -1)

printf("\nStack is Empty!!!"); else{

int i;

printf("\nStack elements are:\n"); for(i=top; i>=0; i--)

printf("%d\n",stack[i]);

}

}

Comments

Post a Comment

Popular posts from this blog

Create and Insert data in circular linked list

  #include <stdio.h> #include <stdlib.h> // Create a node struct Node {   int data;   struct Node* next; }; // Insert at the beginning void insertAtBeginning(struct Node** head_ref, int new_data) {   // Allocate memory to a node   struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));   // insert the data   new_node->data = new_data;   new_node->next = (*head_ref);   // Move head to new node   (*head_ref) = new_node; } // Insert a node after a node void insertAfter(struct Node* prev_node, int new_data) {   if (prev_node == NULL) {   printf("the given previous node cannot be NULL");   return;   }   struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));   new_node->data = new_data;   new_node->next = prev_node->next;   prev_node->next = new_node; } // Insert the the end void insertAtEnd(struct Node** head_ref, int new_data) {   struct Node* n...
Read more

Week2

 abstract class Shape { public int x, y; public abstract void printArea(); } class Rectangle extends Shape { public void printArea() { System.out.println("Area of Rectangle is " + x * y); } } class Triangle extends Shape { public void printArea() { System.out.println("Area of Triangle is " + (x * y) / 2); } } class Circle extends Shape { public void printArea() { System.out.println("Area of Circle is " + (22 * x * x) / 7); } } public class Abstex { public static void main(String[] args) { Rectangle r = new Rectangle (); r.x = 10; r.y = 20; r.printArea(); System.out.println(" "); Triangle t = new Triangle(); t.x =30; t.y =35; t.printArea(); System.out.println(" "); Circle c = new Circle(); c.x = 2; c.printArea(); System.out.println(" "); } }
Read more

Week13

 import java.io.File;   public class DisplayFileExample   {   public void printFileNames(File[] a, int i, int lvl)   {   // base case of the recursion   // i == a.length means the directory has    // no more files. Hence, the recursion has to stop   if(i == a.length)   {   return;   }   // checking if the encountered object is a file or not   if(a[i].isFile())   {   System.out.println(a[i].getName());   }   // recursively printing files from the directory   // i + 1 means look for the next file   printFileNames...
Read more