Subscribe at Guide For School – Java For School has moved there

Kindly note that www.javaforschool.com has moved to www.guideforschool.com. From now on, all contents of the website www.javaforschool.com will be redirected to www.guideforschool.com

All new posts will be done on http://www.guideforschool.com from now on. It we will be having posts for other subjects also to serve you all with similar important study notes, council advices etc regarding other subjects.

Kindly subscribe with the e-mail address at http://www.guideforschool.com to keep yourself updated of new posts.

Also like the Facebook page at : www.facebook.com/guideforschool.

We highly regret the inconvenience faced if any.

Update 14.11.2012

---

Hello Students,

We are pleased to inform that we have modified the design and layout of the website www.javaforschool.com and the website is now Hosted.

We would like to request all those who have subscribed to Email updates, to visit: www.javaforschool.com and subscribe again by filling in their Email address and clicking the Subscribe button.

We are sorry for the inconvenience caused.

Program to find the Prime Factors of a Number [Method 1]

---

Question:

Write a program in JAVA to find the Prime factors of a number.

Prime factors of a number are those factors which are prime in nature and by which the number itself is completely divisible (1 will not be taken as prime number).

Few such numbers are:
Prime Factors of 24 are 2, 2, 2, 3
Prime Factors of 6 are 2, 3

[Week 3] Important Practice Questions for ICSE and ISC

---

This week we have a few questions which deals with converting from one type of loop to another type, for the ICSE as well as ISC students preparing for their 2013 Computer Applications and Computer Science Examinations respectively.

[To know more about these weekly practice questions, Click Here]

You need to answer the given questions, and reply it as comments by filling the “Leave a Reply” section below this post.

The correct answers will be posted next week.

ISC 2012 Computer Science Practical – Program 1 [Solved]

Download the complete ISC 2012 Computer Science Practical Question Paper from here: [ISC 2012] Computer Science Practical Question Paper

Question 1

A prime palindrome integer is a positive integer (without leading zeros) which is prime as well as a palindrome. Given two positive integers m and n, where m < n, write a program to determine how many prime-palindrome integers are there in the range between m and n (both inclusive) and output them.

The input contains two positive integers m and n where m < 3000 and n < 3000. Display the number of prime-palindrome integers in the specified range along with their values in the format specified below:

Program on Decimal to Roman Number Conversion [Method 2]

---

This is the Second Method of Converting a Decimal Number entered by the user into its Roman Equivalent. For Method 1, kindly Click Here: Decimal to Roman Conversion – Method 1

[Note: The number entered should be within the Range 1-3999]

For Brief Note on Roman Number System, kindly Read Method 1

[Week 2] Weekly Important Practice Questions for ICSE Computer Applications

---

This week we have a few questions  which deals with finding the output of certain given programming codes for the ICSE students preparing for their 2013 Computer Applications Examination.

[To know more about these weekly practice questions, Click Here]

You need to answer the given questions, and reply it as comments by filling the “Leave a Reply” section below this post.

The correct answers will be posted next week.

[Week 2] Weekly Important Practice Questions for ISC Computer Science

---

This week we have a few short questions on the topic of Inheritance for the ISC students preparing for their 2013 Computer Science Examination.

[To know more about these weekly practice questions, Click Here]

You need to answer the given questions, and reply it as comments by filling the “Leave a Reply” section below this post.

The correct answers will be posted next week.