ISC Science

In this blog, we shall look at the various methods applied for the conversion of a Complex Sentences to Simple Sentences . The following examples have been taken from the english language textbook prescribed for ISC students studying in class 11. Use these as practice and climb your stepping stones to better grammar! A complex sentences can be converted to a simple sentence by changing a noun clause, an adjective clause or an adverb clause, as shown below: Noun Clause Complex:Tell me where you live. Simple:Tell me your address. Complex:That you should be present is essential. Simple:Your presence is essential. Adjective Clause Complex:Time which is once lost is lost forever. Simple:Time once lost is lost forever. Complex:I have no advice that I can offer you. Simple: I have no advice to offer you. Adverb Clause Complex:When he had finished his work, he went out to play. Simple:Having finished his work, he went out to play. Complex:If I make a promise, I will ke...

A pronic number, oblong number, rectangular number or heteromecic number, is a number which is the product of two consecutive integers, that is, n (n + 1). Algorithm   Start x:=0 Print "Enter a number" Read x n=(int)Math.sqrt(x) If n*(n+1)==true, go to step 7 or else go to step 8 Print "The given number is a Pronic Number". Go to step 9. Print "The given number is not a Pronic Number" Stop Program Buffered Reader import java.io.*; class Pronic {     int x;          void accept() throws IOException     {         BufferedReader br=new BufferedReader (new InputStreamReader (System.in));         System.out.println("Enter a number");         x=Integer.parseInt(br.readLine());     }          boolean isPronic()     {         int n=(int)Math.sqrt(x);         if(n*(n+1)==x)         { ...

Fascinating Numbers :  Some numbers of 3 digits or more exhibit a very interesting property. The property is such that, when the number is multiplied by 2 and 3, and both these products are concatenated with the original number, all digits from 1 to 9 are present exactly once, regardless of the number of zeroes. Algorithm   Start x:=0 Print "Enter a number" Read x; count=0 i=1 if i<=9, go to step 8 or else go to step 24 j=i a=Integer.toString(x*2) b=Integer.toString(x*3) c=Integer.toString(x) t=Integer.parseInt(c+a+b) digit:=0 c=0 If t>0, go to step 16 or else go to step 21 digit=t%10  t=t/10 if digit==j, go to step 19 or else go to step 20 c++ Go to step 15 If c==1, go to step 22 or else go to step 23 count ++ i++. Go to step 7 If count==9, go to step 25 or else go to step 26 Print "The given number is fascinating number" Print "The given number is not a fascinating number" Stop Program Buffered Reader import java.io.*; class Fascinating {     int x...