- //Is an example of object and classes in java.,//Create Train Reservation program in java..,
import java.io.*;
import java.lang.Exception;
class SeatNotAvailableException extends Exception
{
SeatNotAvailableException(int x)
{
super("Train No:"+x+"\n*******No Seat Available*******");
}
}class Train
{
int TrainNo=2309879,NoSeat=500,D=12,M=05,Y=2012,TicketNo=1000,co unt=0;
String To,From;
Train()
{
}
void printUnderLine()
{
System.out.println("-----------------------------------");
}
void booking(String x,String y,int o)throws SeatNotAvailableException
{
printUnderLine();
printUnderLine();
To=x;
From=y;
int ava=count+o;
TicketNo+=1;
if(NoSeat>=ava)
{
count=count+o;
System.out.println("++++Booking is Successfull++++");
System.out.println("***********Your Ticket Details***********");
System.out.println("Train No: "+TrainNo+"\nTicket No: "+TicketNo+"\nTo: "+To+"\nFrom: "+From+"\nDate: "+D+":"+M+":"+Y);
System.out.println("***************************************" );
}
else
{
throw new SeatNotAvailableException(TrainNo);
}
printUnderLine();
printUnderLine();
}
void availableSeats()
{
int bal=NoSeat-count;
printUnderLine();
printUnderLine();
System.out.println("Train No: "+TrainNo+"\nAvailable Seats : "+bal);
printUnderLine();
printUnderLine();
}
}
class MainTrain
{
public static void main(String args[])throws IOException
{
String g,h;
int u,op;
DataInputStream in=new DataInputStream(System.in);
Train p=new Train();
try
{
do
{
System.out.println("***************************************" );
System.out.println("Enter the place of TO:");
g=in.readLine();
System.out.println("Enter the place of FROM:");
h=in.readLine();
System.out.println("How much seat you need:");
u=Integer.parseInt(in.readLine());
p.booking(g,h,u);
p.availableSeats();
System.out.println("Anather booking press 1 and to exit press 0");
op=Integer.parseInt(in.readLine());
System.out.println("***************************************" );
}
while(op==1);
}
catch(SeatNotAvailableException e)
{
e.printStackTrace();
}
finally
{
System.out.println("************END************");
}
}
}
Friday, 9 November 2012
//C code for finding smallest element in an array using pointer and function.
#include<stdio.h>
void small(int *prt,int x);
main()
{
int a[100],n,i;
clrscr();
printf("Enter array limit:\n");
scanf("%d",&n);
printf("Enter array elements:\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("After sorting the array element below:\n");
small(a,n);
getch();
}
void small(int *ptr,int x)
{
int i,temp;
temp=*ptr;
for(i=0;i<x;i++)
{
if(temp>*ptr)
{
temp=*ptr;
}
ptr++;
}
printf("The smallest number is:%d",temp);
}
//C code for reverse of string using pointer
#include<stdio.h>
#include<string.h>
main()
{
int i,n,j,swap;
char A[100],*P;
clrscr();
printf("Enter character below 100 include space\n");
gets(A);
n=strlen(A);
P=A;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if((P+j)<(P+(j+1)))
{
swap=*(P+j);
*(P+j)=*(P+(j+1));
*(P+(j+1))=swap;
}
}
}
printf("The reverse of the string:\n");
for(i=0;i<n;i++)
{
printf("%c",*(P+i));
}
getch();
}
//C code for Example of Dynamic memory reallocation
#include<stdio.h>
#include<alloc.h>
main()
{
int *mark;
int n=0,i,mr,size=3;
clrscr();
mark=(int *)malloc(size*sizeof(int));
printf("Enter the marks:(Enter -1 to stop)\n");
scanf("%d",&mr);
while(mr!=-1)
{
if(n>=size)
{
size=size+3;
printf("\nEnter more than 3 integer\n");
mark=realloc(mark,size*sizeof(int));
if(!mark)
{
printf("\nNot enough memory\n");
}
else
{
printf("\nSuccess\n");
}
}
*(mark+n)=mr;
scanf("%d",&mr);
n++;
}
printf("\nThe marks entered are:\n");
for(i=0;i<n;i++)
printf("\n%d",*(mark+i));
getch();
}
//C code for Example for Dynamic memory allocation
#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<stdlib.h>
main()
{
int n,i,*ptr;
clrscr();
printf("Enter how many numbers:\n");
scanf("%d",&n);
ptr=(int *)malloc(n*sizeof(int));
if(!ptr)
{
printf("No memory for the array");
exit(1);
}
printf("Enter the element:\n");
for(i=0;i<n;i++)
{
scanf("%d",(ptr+i));
}
printf("Print array element\n");
for(i=0;i<n;i++)
{
printf("%d\n",*(ptr+i));
}
free(ptr);
getch();
}
//C code for Bubble sorting using pointer......
#include<stdio.h>
main()
{
int *p,A[10],i,n,j,swap;
clrscr();
printf("Enter a limit:\n");
scanf("%d",&n);
printf("Enter array element:\n");
for(i=0;i<n;i++)
scanf("%d",&A[i]);
p=A;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(*(p+j)<*(p+(j+1)))
{
swap=*(p+j);
*(p+j)=*(p+(j+1));
*(p+(j+1))=swap;
}
}
}
printf("After Sorting:\n");
i=0;
while(i<n)
{
printf("%d\n",*p);
p++;
i++;
}
getch();
}
//C code for Text file creatation and searching.
#include<stdio.h>
#include<conio.h>
#include<string.h>
main()
{
FILE *p;
int regno,mark,n,i,f=0;
char name[10],rname[10];
printf("Enter the number of students:");
scanf("%d",&n);
p=fopen("mu.txt","w");
printf("Enter thename regno,mark of students:");
for(i=0;i<n;i++)
{
scanf("%s%d%d",name,®no,&mark);
fprintf(p,"%s %d %d",name,regno,mark);
}
fclose(p);
printf("enter the searching name:");
scanf("%s",rname);
p=fopen("mu.txt","r");
do
{
fscanf(p,"%s%d%d",name,®no,&mark);
if(strcmp(name,rname)==0)
{
printf("%s %d %d",name,regno,mark);
f=1;
break;
}
}
while(!feof(p));
if(f==0)
printf("The given name is not present");
fclose(p);
getch();
}
//C code for Fibonacci series using Recursion
#include<stdio.h>
int fibo(int f1,int f2,int f3,int n);
main()
{
int f1=0,f2=1,f3=0,n;
clrscr();
printf("Enter the limil:\n");
scanf("%d",&n);
printf("Fibonacci Series below:\n");
fibo(f1,f2,f3,n);
getch();
}
int fibo(int f1,int f2,int f3,int n)
{
if(n<1)
retrun 0;
else
{
printf("%d\n",f3);
f3=f1+f2;
f1=f2;
f2=f3;
n--;
fibo(f1,f2,f3,n);
}
}
Subscribe to:
Posts (Atom)