Skip to main content

Stack in java

By
import java.util.*;
import java.io.*;
class a
{
public static void main(String args[])throws Exception
{
Stack s =new Stack();
System.out.println("Empty= "+s.empty());

s.push("1");
s.push("2");
s.push("3");
System.out.println(s);
System.out.println(s.search("0"));
System.out.println(s.search("1"));
System.out.println(s.search("2"));
s.pop();
System.out.println(s);
System.out.println(s.peek());
}
}

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO PRINT COLOURS OF RAINBOW ACCORDING TO THE NO. INPUTTED BY THE USER

By
#include,stdio.h> #include<conio.h> void main() { int ch; printf("INPUT A NUMBER\n"); scanf("%d",&ch); switch(ch) { case 6: printf("Red"); break; case 5 : printf(" Orange"); break; case 4 : printf(" Yellow"); break; case 3 : printf(" Green"); break; case 2 : printf(" Blue"); break; case 1 : printf(" Indigo"); break; case 0 : printf(" Violet"); break; default : ("wrong input "); } } SIMPLE PROGRAMS FIND TYPE OF THE TRIANGLE TEMPERATURE CONVERSION COMMISSION OF A SALESMAN PRINT NUMBERS IN DESCENDING ORDER BIGGEST NUMBER AMONG THREE NUMBERS CALCULATE DIVISION A YEAR IS LEAP OR NOT A NUMBER IS ODD OR EVEN PRINT THE SQUARE ROOT ELSE PRINT N TO THE POWER 5 PRINT A NEW NUMBER BY ADDING 1 TO EACH DIGIT OF THE NUMBER PRINT THE NO. OF CURRENCY NOTES ACCORDING TO THE AMOUNT ENTERED DATA STRUCTURES ENTER DETAILS OF A STUDENT ENTER DETAILS OF A ST...
Post a Comment
Read more

PROGRAM TO FIND OCTAL OF A NUMBER

By
LIST OF PROGRAMS #include<stdio.h> #include<conio.h> void main() { long int n,oct=0,r=1,pow=1;  clrscr(); printf("Enter a number "); scanf("%ld",&n); if(n<0) printf("WRONG INPUT"); else {  if(n<=7&&n>=0)  oct =n;  else  {  while(n>0)  { r=n%8; oct=oct+(r*pow); n=n/8; pow=pow*10;  }  }  printf("OCTAL = %ld",oct);  getch(); } } LIST OF PROGRAMS
2 comments
Read more

PROGRAM TO PERFORM BINARY SEARCH USING RECURSION

By
LIST OF PROGRAMS #include<stdio.h> #include<conio.h> int binary(int ,int ); int a[10],md,s,c=0; void main() { int n,i; clrscr(); printf("ENTER LIMIT \n"); scanf("%d",&n); printf("ENTER ARRAY\n"); for(i=0;i<n;i++) { fflush(stdin); scanf("%d",&a[i]); } printf("ENTER NUMBER TO BE SEARCHED"); scanf("%d",&s); c=binary(0,n-1); if(c==-1) printf("NOT FOUND"); getch(); } int binary(int f,int l) {  md=(f+l)/2; if(f>l) { return(-1); } else if (a[md]<s) return(binary(md+1,l)); else if(a[md]==s) {printf("Found AT LOCATION %d IN WHICH 0 IS THE STARTING ADDRESS",md); return (1); } else return(binary(f,md-1)); } LIST OF PROGRAMS
2 comments
Read more