Sharing Knowledge

Solution of Question 3 - REVISED

2011-02-23T23:12:00.000-08:00

class CalendarDemo {
public static void main(String args[]) throws IOException
{
String months[] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
String wday[] = {" ", "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};

String date;
Calendar calendar = Calendar.getInstance();
int d,m,y;
BufferedReader ob=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter Date in the format dd/mm/yy ");
date=ob.readLine();
StringTokenizer b=new StringTokenizer(date,"/");
d=Integer.parseInt(b.nextToken());
m=Integer.parseInt(b.nextToken());
y=Integer.parseInt(b.nextToken());

calendar.clear();
calendar.set(Calendar.YEAR, y);
calendar.set(Calendar.MONTH, m-1);
calendar.set(Calendar.DATE, d);

System.out.print("Date: ");
System.out.print(months[calendar.get(Calendar.MONTH)]);
System.out.print(" " + calendar.get(Calendar.DATE) + " ");
System.out.println(calendar.get(Calendar.YEAR));
System.out.println(wday[calendar.get(Calendar.DAY_OF_WEEK)]);

}
}

Solution 4 - Words in reverse in a sentence

2011-02-23T22:48:00.000-08:00

import java.io.*;
class vaibhav
{
public static void main(String args[])throws IOException
{
int i,j,c,x=0,u=0,k=0;String t;
BufferedReader o=new BufferedReader(new InputStreamReader(System.in));
System.out.print("enter a sentence==");
String s=o.readLine();
s=s+" ";
int l, l1;
l=s.length();
for(i=0;i {
char ch=s.charAt(i);
if(ch==' ')
{
t="";
t=s.substring(x,i);
l1=t.length();
char d=' ';
if(t.charAt(l1-1)=='.' || t.charAt(l1-1)=='?' || t.charAt(l1-1)=='!')
{
d=t.charAt(l1-1);
t=t.substring(0,l1-1);

}
StringBuffer f=new StringBuffer(t);
f.reverse();
System.out.print(f);
System.out.print(d+" ");
x=i+1;
}
}
}
}

Solution 3 - Print day of the Week for the Date

2011-02-23T22:46:00.000-08:00

import java.io.*;
import java.util.Calendar;
class DayofDate {
public static void main(String args[]) throws IOException
{
String months[] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
String wday[] = {" ", "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};

Calendar calendar = Calendar.getInstance();
int d,m,y;
BufferedReader ob=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter Date");
System.out.println("Enter Day");
d=Integer.parseInt(ob.readLine());
System.out.println("Enter Month");
m=Integer.parseInt(ob.readLine());
System.out.println("Enter Date");
y=Integer.parseInt(ob.readLine());

calendar.clear();
calendar.set(Calendar.YEAR, y);
calendar.set(Calendar.MONTH, m-1);
calendar.set(Calendar.DATE, d);

System.out.print("Date: ");
System.out.print(months[calendar.get(Calendar.MONTH)]);
System.out.print(" " + calendar.get(Calendar.DATE) + " ");
System.out.println(calendar.get(Calendar.YEAR));
System.out.println(wday[calendar.get(Calendar.DAY_OF_WEEK)]);

}
}

SOLUTION FOR QUESTION 2 - TOWER OF HANOI

2011-02-22T06:35:00.000-08:00

import java.io.*;
public class hanoi
{
static int moves=0; //number of moves so far
static int getInt()
{
String line;
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
try
{
line = in.readLine();
int i = Integer.valueOf(line).intValue();
return i;
}

catch (Exception e)
{
System.err.println("***Error: Input is not a number.\n" +
"Input assumed to be the number 1");
return 1;
}
}

static void hanoi(int height, char fromPole, char toPole, char withPole)
{
if (height >= 1)
{
hanoi(height-1, fromPole, withPole, toPole);
moveDisk(fromPole, toPole);
hanoi(height-1, withPole, toPole, fromPole);
}
}

static void moveDisk(char fromPole, char toPole)
{
moves++;
System.out.print(fromPole);
System.out.print(toPole);
System.out.print(((moves % 20)==0) ? '\n' : ' ');
}

public static void main(String[] args)

{
long time1, time2; //for benchmarking
int TowerHeight;
char FromPole='A', ToPole='B', WithPole='C';
System.out.println("Enter Tower height...");
System.out.print("?");
TowerHeight = getInt();
time1 = System.currentTimeMillis();
hanoi(TowerHeight, FromPole, ToPole, WithPole);
time2 = System.currentTimeMillis();
System.out.println();
System.out.print(time2-time1); //print execution time in msec
System.out.println(" msec execution time");
}
}

SOLUTION OF QUESTION 1

2011-02-21T21:04:00.000-08:00

import java.io.*;

class numcombi

{

String str="";

int a=0;

int b=0;

public void combi() throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.print("Enter a number : ");

int num = Integer.parseInt(br.readLine());

System.out.println("Combinations :");

for(int i=1;i<=num/2;i++)

{

str="";

extract(num,i);

}

public void extract(int n, int m)

{

a=m;

str+=" "+a;

b=n-a;

System.out.println(str+" "+b);

if(b<=m)

{

return;

}

extract(b,m);

}

public static void main(String arg[]) throws IOException

{

numcombi obj= new numcombi();

obj.combi();

}

Changes are good

2011-02-19T09:32:00.000-08:00

Now access to the web page https://sites.google.com/site/javaprogramsisc/ is purely on invitation. So use your gmail id to send request and you will receive link for the web page

if you need solution message me

2011-02-17T07:07:00.000-08:00

https://sites.google.com/site/javaprogramsisc/home/topic-wise-isc-practical/date-after-n-days

https://sites.google.com/site/javaprogramsisc/home/topic-wise-isc-practical/unique-digit-integers

https://sites.google.com/site/javaprogramsisc/home/topic-wise-isc-practical/positive-integers-in-sequence

link for practical questions

2011-02-17T07:00:00.000-08:00

https://sites.google.com/site/javaprogramsisc/home/topic-wise-isc-practical

ISC Practical 2011

2011-02-13T21:06:00.000-08:00

Who want solutions of previous year PRACTICAL Question Papers

https://sites.google.com/site/javaprogramsisc/home/isc-practical

2011-01-30T09:29:00.000-08:00

2011-01-30T07:34:00.000-08:00

I am back.
If any questions ask me.

NEW WEBSITE UNDER CONSTRUCTION

2009-09-11T06:50:00.000-07:00

New website to give more structured out look is under construction.

http://sites.google.com/site/kumardks/home

lots of information will be added on this site.

If any one wants to contribute question, programs, solutions they are most welcome.

Valuable contribution is required.

This site is basically for students of class X, XI and XII of ICSE/ISC/CBSE Board.

Any content/help which can help student community is most welcomed.

Link of QUESTION papers moved to new website

2009-09-07T08:51:00.000-07:00

Hello friends

Due to sudden change of events all the links of ICSE and ISC questions papers have been shifted to new location.

My students will know the website address very shortly.

For link/web address, contact me on my email kumardks@gmail.com.

For the HARD COPY of all Question PAPERs write to me on my email address.

Solutions for ICSE Questions and Additional Programs

2009-08-30T01:30:00.000-07:00

Who want solution of question paper???

If you want solutions wait till 15th September and check this blog for update.

ICSE - Programs on Conditional Statement
ICSE - Programs on Looping Statements
ICSE - Programs on Functions, Function Overloading
ICSE - Programs on Arrays

Links will be given for very short duration.

Board Paper ISC and ICSE

2009-01-03T22:29:00.000-08:00

Computer Science board papers - Links deleted

ISC

ISC 2010 Specimen Paper and ISC 2003 to ISC 2009 Theory Paper

ISC 2003 to 2009 Practical Question Papers and ISC 2010 Practical Specimen Paper

ICSE

ICSE 2009 to ICSE 2005 Theory Paper

Note:-For question papers email me on kumardks@gmail.com

OUTPUT related Programs

2008-09-27T07:46:00.000-07:00

Download the file and print it.

Download pdf file

ISC 2008 Reverse a string to check Palindrome through Recursion

2008-08-16T10:21:00.000-07:00

Link for Downloading Full Program C++ version

ISC 2007 Decimal to Binary conversion through Recursion

2008-08-16T10:19:00.000-07:00

Link for Downloading Full Program C++ version

void recursive(int x)

{
int m=x%2;
x=x/2;
if(x>0) recursive(x);
z=z*10+m;
}

ISC 2007 Digit to word conversion through Recursion

2008-08-16T10:14:00.000-07:00

Link for Downloading Full Program C++ version

void extdigit(int x)
{
int m=x%10;
x=x/10;
if(x>0) extdigit(x);
numtoword(m);
}
void numtoword(int p)
{
char a[10][10]={"Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine"};
cout< }

ISC 2006 HCF and LCM through Recursion

2008-08-16T10:08:00.000-07:00

Link for Downloading Full Program C++ version

int rechcf(int p,int q)
{
if(p==0) return q;
else return rechcf(q%p, p);
}
int fn_lcm(int p,int q, int gcd)
{
return p*q/gcd;
}

ISC 2005 Fibonacci Series through Recursion

2008-08-16T05:41:00.000-07:00

Link for Downloading full program C++

VERSION I

int fib(int n)
{
if(n==1) return 0;
else if(n==2) return 1;
else if(n>2) return fib(n-1)+fib(n-2);
else return -1;
}
loop from 1 to the limit

display fib(i)

VERSION II

fibrec()
{
a=0; b=1;
}
int fib(int n)
{
if(n>0)
{
c = a + b; a = b; b = c;
display c;

n--;

fib(n);
}
return b;
}

2008-08-12T08:03:00.000-07:00
QUESTION BASED ON RECURSION
Ques 1. A class Revstr defines a recursive function to reverse a string and check whether it is a Palindrome. .............
(ISC 2008 Link for full question )

Ques 2. Class Convert has been defined to express digits of an integer in words. .............
(ISC 2007 Link for full question )

Ques 3. A class dec_Bin has been defined to convert a decimal number into its equivalent binary number..............
(ISC 2007R Link for full question )

Ques 4. Class Hifact has been defined to to find the HCF of two numbers using the recursive technique. This HCF is used to find the LCM of the two numbers..............
(ISC 2006 Link for full question )

Ques 5. A class recursion is defined to find the fibonacci series upto the n terms...............
(ISC 2005 Link for full question )

Ques 6. Additional question( Link for full question )

Ques 7. Additional question( Link for full question )

2008-07-20T10:29:00.000-07:00
Hello Friends
Very soon you will see the programms comming up on this blog