#yaradiprograming Algorithm for reaching college
Algorithm for reaching college
if(car)
{
switch(car)
{
case 1 : "Mithuns drive"
Sytem.out.println(" Reach college in 1 hours");
break;
case 2 : "Ketan drive"
Sytem.out.println("Reach college in 45 minutes");
break;
default:"Toyash drive"
System.out.println("Never reach college");
break;
}
}else
if(bike)
{
if(toyash bike)
{
switch(bike)
{
case 1 : "If Mithuns ride"
try{
Sytem.out.println(" Reach college in 1 hours");
}catch(MithunDreamingException e){e.printstacktrace();}
catch(ToyashFellException e){e.printstacktrace();}
break;
case 2 : "Ketan drive"
try{
Sytem.out.println(" Reach college in 45 minutes");
}catch(SitTightException e){e.printstacktrace();}
catch(Sector15stoppageExceptiononReturn e){e.printstacktrace();}
break;
case 3:"Toyash drive"
try{
Sytem.out.println(" Reach college in 45 minutes");
}catch(NeverReachOntimeException e){e.printstacktrace();}
catch(WhattowearEception e){e.printstacktrace();}
break;
Default:"None drive"
System.out.println("College Bunk");
break;
}
}elseif(ketan's bike)
{
try{
Sytem.out.println(" Reach college in 45 minutes");
}catch(Whowilldrive e){e.printstacktrace();}
catch(OnkickMCBC Exception e){e.printstacktrace();
catch(NoBreakException e){e.printstacktrace();}
break;
}
}
}
Comments
Post a Comment