SMT. SULOCHANADEVI SINGHANIA SCHOOL, THANE

FIRST TERM PRACTICAL TIME TABLE FOR STD 12 (AUGUST 2011)

16^th August, 2011 (Tuesday)

Class	Roll Nos.	Subject	Time
12 A	1-33	Biology	8.45-11.45 a.m
12 B	1-42	Computer Science	8.45-9.00 a.m R.T 9.00- 10.30 a.m W.T 10.30- 12.00 noon Lab
12 C 12 D	1-39 28, 32	Computer Science	11.15-11.30 a.m R.T 11.30- 1.00 p.m W.T 1.00- 2.30 p.m Lab

Reporting Time: 8.20 a.m for all students in their respective classrooms

Note:

• 12C will have teaching from 8.45- 11.00 a.m

Teaching will continue from

• 12.00- 1.30 p.m for 12 A,

• 12.15- 1.30 p.m for 12 B

---------------------------------------------------------------------------------------------------------------------

17^th August, 2011 (Wednesday)

Batch	Class	Roll Nos.	Subject	Time
I	12 A	1-28	Physics	8.45-10.45 a.m
II	12 A 12 B	29-33 1-24	Chemistry	8.45-11.15 a.m
III	12 B 12 C	25-42 1-11	Physics	11.15-1.15 p.m
IV	12 C	12-39	Chemistry	11.45- 2.15 p.m

Reporting Time: (In the classrooms)

• Batch I and II will report at 8.20 a.m

• Batch III will report at 11.00 a.m and

• Batch IV will report at 11.30 a.m

---------------------------------------------------------------------------------------------------------------------

18th August, 2011 (Thursday)

Batch	Class	Roll Nos.	Subject	Time
I	12 A	1-28	Chemistry	12.00- 2.30 p.m
II	12 A 12 B	29-33 1-24	Physics	9.00- 11.00 a.m
III	12 B 12 C	25-42 1-11	Chemistry	9.00- 11.30 a.m
IV	12 C	12-39	Physics	12.00-2.00 p.m

Reporting Time: (In the classrooms)

• Batch II and III will report at 8.20 a.m and

• Batch I and IV will report at 11.30 a.m

PRINCIPAL

Installing ubuntu inside windows (i hv demonstrated how to install 10.10, the only difference is you will see 11.04):

• this window will open then:

• click install inside windows. then this will appear: now select the drive in which you want to install it

• installation size: give how much space you want for ubuntu, REMEMBER, you can not change this space after installing, so better give some 20GB, or atleast 10 GB!!

• enter user name:

• DO NOT CHANGE 'Desktop environment'. just enter the password you want twice

• click Install

• reboot, and select Ubuntu in the list!!

After your computer restarts, choose 'Ubuntu' from the boot menu.

You can uninstall Ubuntu by going to 'Add or remove programs' in windows xp.

NOTE: all changes will be lost in ubuntu if you unistall ubuntu.

/*22)

* 28/07/11

* input a max of 20 nos

* print longest monotonic increasing and longest monotonic decreasing sequence

*/

import java.io.*;

public class LSequence

{

int ar[];

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

LSequence()

{}

LSequence(int n)

{

ar=new int[n];

}

void input()throws IOException

{

System.out.println("enter the no's");

for(int i=0;i< ar.length;i++)

{

ar[i]=Integer.parseInt(in.readLine());

}

}

void display(int n[])

{

for(int i=0;i< n.length;i++)

{

if(i!=n.length-1)

System.out.print(n[i]+",");

else

System.out.print(n[i]);

}

System.out.println();

}

boolean inc_dec(int n,int i)

{

boolean ret=false;

if(n==1 && ar[i]< ar[i+1])

ret=true;

else if(n==2 && ar[i]>ar[i+1])

ret=true;

return ret;

}

int[] MaxSeries(int n)

{

int temp[]=new int[20],i=0,j=0,t[]=new int[0];

while(i< ar.length-1)

{

if(inc_dec(n,i) && i!=ar.length-2)

{

temp[j]=ar[i];

j++;

}

else

{

temp[j]=ar[i];

if(i==ar.length-2 && inc_dec(n,i))

{

j++;

temp[j]=ar[i+1];

}

if(t.length< j+1)

{

t=new int[j+1];

for(int k=0;k< j+1;k++)

t[k]=temp[k];

}

temp=new int[20];

j=0;

}

i++;

}

return t;

}

void main()throws IOException

{

System.out.println("enter n");

int n=Integer.parseInt(in.readLine());

LSequence ob=new LSequence(n);

if(n>20||n< 1)

System.out.println("max value of n is 20 / invalid input");

else

{

ob.input();

System.out.println("\u000cOriginal array:");

ob.display(ob.ar);

System.out.println("longest monotonic increasing sequence:");

int Series1[]=ob.MaxSeries(1);

ob.display(Series1);

System.out.println("longest monotonic decreasing sequence:");

int Series2[]=ob.MaxSeries(2);

ob.display(Series2);

}

}

}

javatest

/*22)
* 28/07/11
* input a max of 20 nos
* print longest monotonic increasing and longest monotonic decreasing sequence
*/
import java.io.*;
public class LSequence
{
int ar[];
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
LSequence()
{}
LSequence(int n)
{
ar=new int[n];
}
void input()throws IOException
{
System.out.println("enter the no's");
for(int i=0;iar[i+1])
ret=true;
return ret;
}
int[] MaxSeries(int n)
{
int temp[]=new int[20],i=0,j=0,t[]=new int[0];
while(i20||n<1)
System.out.println("max value of n is 20 / invalid input");
else
{
ob.input();
System.out.println("\u000cOriginal array:");
ob.display(ob.ar);
System.out.println("longest monotonic increasing sequence:");
int Series1[]=ob.MaxSeries(1);
ob.display(Series1);
System.out.println("longest monotonic decreasing sequence:");
int Series2[]=ob.MaxSeries(2);
ob.display(Series2);
}
}
}

my sudoku

Powered by SudokuKingdom.com

sudoku