Scribd
Upload
17 views19 pages

Java Stack Implementation Example

The document describes a Java program that implements a stack data structure and allows the user to perform push, pop, peek and display operations on the stack. It shows sample outputs of running the program where different elements are pushed onto the stack, peeked, popped and finally displayed after emptying the stack. A second Java program implements date-related operations like checking if a year is a leap year, calculating difference between dates and computing remaining days till the user's birthday.

Uploaded by

Saravanakumar Muthulakshmi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
17 views19 pages

Java Stack Implementation Example

The document describes a Java program that implements a stack data structure and allows the user to perform push, pop, peek and display operations on the stack. It shows sample outputs of running the program where different elements are pushed onto the stack, peeked, popped and finally displayed after emptying the stack. A second Java program implements date-related operations like checking if a year is a leap year, calculating difference between dates and computing remaining days till the user's birthday.

Uploaded by

Saravanakumar Muthulakshmi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Stack program output [cs2910007@localhost java]$ java Stack Menu [Link] [Link] [Link] [Link] 5.

Exit Enter ur choice 1 Enter element 10 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 1 Enter element 20 Menu [Link]

[Link] [Link] [Link] [Link] Enter ur choice 1 Enter element 30 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 1 Enter element 40 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice

1 Enter element 50 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 1 Overflow-----maximum linit reached Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 3 Peek element(elemet inserted at last is50 Menu [Link] [Link] [Link]

[Link] [Link] Enter ur choice 4 Elements are 10 20 30 40 50 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 2 Popped element50 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 2 Popped element40 Menu [Link]

[Link] [Link] [Link] [Link] Enter ur choice 2 Popped element30 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 2 Popped element20 Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 2 Popped element10

Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice 2 Underflow----no element in stack Menu [Link] [Link] [Link] [Link] [Link] Enter ur choice

program code

import [Link].*; import [Link].*; import [Link].*; interface Mystack {

int n=5; public void pop(); public void push(); public void peek(); public void display(); }

class stack implements Mystack { int stack[]=new int[n]; int top=-1; public void push() { try { DataInputStream dis=new DataInputStream([Link]); if(top==(n-1)) { [Link]("Overflow-----maximum linit reached"); return; } else { [Link]("Enter element"); int ele=[Link]([Link]());

stack[++top]=ele; } } catch(Exception e) { [Link]("e"); } } public void pop() { if(top<0) { [Link]("Underflow----no element in stack"); return; } else { int popped=stack[top]; top--; [Link]("Popped element"+popped); } }

public void peek() {

if(top<0) { [Link]("Underflow -- no elememt in stack "); return; } else { int popped=stack[top]; [Link]("Peek element(elemet inserted at last is"+popped); } }

public void display() { if(top<0) { } else { String str=" "; for(int i=0;i<=top;i++) str=str+" "+stack[i]; [Link]("Elements are"+str); } }

class Stack {

public static void main(String arg[])throws IOException { DataInputStream dis=new DataInputStream([Link]); stack stk=new stack(); int ch=0; do { [Link]("Menu\n [Link]\n [Link]\n [Link]\n [Link]\n [Link]\n Enter ur choice"); ch=[Link]([Link]()); switch(ch) { case 1: [Link](); break; case 2: [Link](); break; case 3:

[Link](); break; case 4: [Link](); break; case 5: [Link](0); } }while(ch<=5); } }

[cs2910007@localhost java]$ vi [Link] [cs2910007@localhost java]$javac [Link] [cs2910007@localhost java]$ java Dateclass MENU [Link] [Link] between 2 dates [Link] Dates [Link] Enter your choice: 1 Enter the date: 29/10/1991 The year is not a leap year MENU [Link] [Link] between 2 dates [Link] Dates [Link] Enter your choice: 1 Enter the date: 2/12/1996 The year is a leap year MENU [Link] [Link] between 2 dates

[Link] Dates [Link] Enter your choice: 2 Enter the date: 29/10/1991 Enter the date: 2/12/1995 Difference:1495 MENU [Link] [Link] between 2 dates [Link] Dates [Link] Enter your choice: 3 Enter the Birthdate: Today's date is 25/7/2011 Enter the date: 29/10/2011 -----------Advance/Belated ***Happy birthday*** wishes----------The Remaining days for ur Bday:96 MENU [Link] [Link] between 2 dates

[Link] Dates [Link] Enter your choice: 4 [cs2910007@localhost java]$

code for date implementation import [Link].*; import [Link].*;

class Dateman { int day,month,year,nday,nmonth,nyear; String date; String str1[]=new String[3]; void dateseperation(String str) { str1=[Link]("/"); day=[Link](str1[0]); month=[Link](str1[1]);

month=month-1; year=[Link](str1[2]); } boolean isLeapYear() { if(year%4==0) return true; else return false; }

long dateDifference()throws IOException { [Link]("Enter the date:"); BufferedReader in=new BufferedReader(new InputStreamReader([Link])); date=[Link](); str1=[Link]("/"); nday=[Link](str1[0]); nmonth=[Link](str1[1]); nmonth=nmonth-1; nyear=[Link](str1[2]); Calendar ca1=[Link](); Calendar ca2=[Link](); [Link](year,month,day); [Link](nyear,nmonth,nday);

long millis1=[Link](); long millis2=[Link](); long diff=millis2-millis1; long diffdays=diff/(24*60*60*1000); return(diffdays); } void remainingDays()throws IOException { [Link]("Enter the Birthdate:"); BufferedReader in=new BufferedReader(new InputStreamReader([Link])); Calendar cd=[Link](); Calendar cd1=[Link](); month=[Link]([Link]); year=[Link]([Link]); day=[Link]([Link]); [Link]("Today's date is "+day+"/"+(month+1)+"/"+year); long diffdays=dateDifference(); if(diffdays<0) { [Link](year+1,00,01); long millis1=[Link](); long millis2=[Link](); [Link](day+month+year); long diff=millis2-millis1; diffdays=diff/(24*60*60*1000);

[Link](year+1,nmonth-1,nday); long millis3=[Link](); diff=millis3-millis2; long diffdays1=diff/(24*60*60*1000); diffdays=diffdays1+diffdays; } [Link]("-----------Advance/Belated ***Happy birthday*** wishes-----------"); [Link]("The Remaining days for ur Bday:"+diffdays); } } class Dateclass { public static void main(String args[])throws IOException { String str; int ch=0; long ddiff; BufferedReader in=new BufferedReader(new InputStreamReader([Link])); while(ch!=4) { [Link]("\tMENU\[Link]\[Link] between 2 dates\[Link] Dates\n [Link] \n Enter your choice:"); ch=[Link]([Link]()); Dateman d=new Dateman(); if(ch==1||ch==2)

{ [Link]("Enter the date:"); str=[Link](); [Link](str); } switch(ch) { case 1: if([Link]()) [Link]("The year is a leap year"); else [Link]("The year is not a leap year"); break; case 2: ddiff=[Link](); [Link]("Difference:"+ddiff); break; case 3: [Link](); break; case 4: [Link](0); break;

} } }

You might also like