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...

Algorithm   Start rows:=0 columns:=0 Print "Enter the number of rows" Read rows Print "Enter the number of columns" Read columns i=0 if i<rows, go to step 10 or else go to step 18 j=0 If j<columns, go to step 12 or else go to step 16 If i==0||i==rows-1||j==0||j==columns, go to step 13 or else go to step 14 Print "*". Go to step 15 Print " " j++. Go to step 11 Go to next line. i++. Go to step 9 Stop Program Buffered Reader import java.io.*; class HollowRectangle {     int rows, columns;          void accept() throws IOException     {         BufferedReader br = new BufferedReader (new InputStreamReader(System.in));         System.out.println("Enter the number of rows");         rows=Integer.parseInt(br.readLine());         System.out.println("Enter the number of columns");         columns = Integer.parseInt(br.readLine());   ...

Algorithm   Start a:=null i:=0 n:=0 j:=0 temp:=0 Print "Enter the size of the array" Read n a=new int[n] i=0 If i<n, go to step 12 or else go to step 15 Print "Enter a number" Read a[i] i++. Go to step 11 i=0 If i<n, go to step 17 or else go to step 25 temp=a[i] j=i-1 If j>=0 && a[j]>temp, go to step 20 or else go to step 23 a[j+1]=[j] j=j-1 Go to step 19 a[j+1]=temp i++. Go to step 16 i=0 If i<n, go to step 27 or else go to step 29 Print a[i]; i++. Go to step 26 Stop Program Buffered Reader import java.io.*; class SortArray {     int a[], i, n, j, temp;          void accept() throws IOException     {         BufferedReader br=new BufferedReader(new InputStreamReader (System.in));         System.out.println("Enter the size of the array");         n=Integer.parseInt(br.readLine());         a=new int[n];         for(i=...