HSC time table 2016 maharashtra board

HSC time table 2016 of Maharashtra Board

for Science, Arts and Commerce released.

Date	First Half		Second Half
	Timings	Subjects	Timings	Subjects
February 18, 2016	11 AM to 2 PM	English
February 20, 2016	11 AM to 2 PM	Marathi, Gujarati, Kannada, Sindhi, Malayalam, Tamil, Telugu, Punjabi, Bengali	3 PM to 6 PM	Urdu, French, Pali
February 22, 2016	11 AM to 2 PM	Hindi	3 PM to 6 PM	German, Ardhamagadhi, Persian, Avesta - Pahalavi
February 23, 2015	11 AM to 2 PM	History & Development of Indian Music	3 PM to 6 PM	English Literature
February 24, 2016	11 AM to 2 PM	Secretarial Practice and Physics	3 PM to 6 PM	Political Science
		Physics
February 25, 2016	11 AM to 2 PM	Sociology
February 26, 2016	11 AM to 2 PM	Mathematics & Statistics (A/S)	3 PM to 6 PM	Hindi Applied
		Mathematics & Statistics (C)
February 27, 2016	11 AM to 2 PM	Economics
February 29, 2016	11 AM to 2 PM	Organisation of Commerce , Management, Chemistry	3 PM to 6 PM	History
March 02, 2016	11 AM to 2 PM	Textiles	3 PM to 6 PM	Marathi Literature
March 04, 2016	11 AM to 2 PM	Book Keeping & Accountancy, Biology	3 PM to 6 PM	Philosophy
March 09, 2016	11 AM to 2 PM	Geography	3 PM to 6 PM	Japanese
March 11, 2015	11 AM to 2 PM	Biofocal Courses paper I, General Civil Engineering, Electronics, Computer Science, Commerce Group Paper-I Banking, Office Management Marketing and Salesmenship Small Industries and Self Employment Fishery Group Paper - I Fish processing technology Fresh Water Fish Culture	3 PM to 6 PM	Education
	11 AM to 1.30 PM	Electrical Maintenance, Mechanical Maintenance, Scooter Motor Cycle Serving
	11 AM to 1 PM	Agricultural Group Paper-I Animal Science and Dairying Crop Science Horticulture
March 14, 2016	11 AM to 2 PM	Vocational Biofocal Courses Paper-II TECHNICAL GROUP General Civil Engineering Electronics Computer Science Commerce Group Paper-II  Banking Office Management Marketing and Salesmenship Small Industries and Self Employment Fishery Group Paper - II Fish processing technology Fresh Water Fish Culture		Occupational Orientation Library & information Science
	11 AM to 1 PM	Agricultural Group Paper-II Animal Science and Dairying Crop Science Horticulture
	11 AM to 1.30 PM	Electrical Maintenance Mechanical Maintenance Scooter and Motorcycle Servicing
March 16, 2016	11 AM to 2 PM	Co-operation, Geology	3 PM to 6 PM	Percussion
March 17, 2016			3 PM to 6 PM	Psychology
March 18, 2016	11 AM to 2 PM	Sanskrit
March 19, 2016	11 AM to 2 PM	Russian, Arabic	3 PM to 6 PM	Child Development (A/S) Agricultural Science and Technology Animal Science and Technology
	11 AM to 1 PM	General Knowledge (for Military Schools)
March 21, 2016			3 PM to 6 PM	Logic
March 22, 2016	11 AM to 2 PM	History of Art and Appreciation	3 PM to 6 PM	Defence Studies
March 23, 26 and 28, 2016	11 AM to 1.30 PM	ONLINE EXAM Information Technology Science Arts Commerce	3 PM to 5.30 PM	ONLINE EXAM  Information Technology Science Arts Commerce

---

*****BEST OF LUCK FOR YOUR EXAM*****

Update (03.09.2015) : Maharashtra HSC Time Table 2016 Exam has been released by the Maharashtra board on 03rd September.

php notes

Special data type in php
 Null is a special data type which can have only one value: NULL.
A variable of data type NULL is a variable that has no value assigned to it.
Ex:-
<?php
$x = "Hello world!";
$x = null;
var_dump($x);
?>
Output:- NULL

---

Abstract class in php:-
1. PHP 5 introduces abstract classes and methods. Classes defined as abstract may not be instantiated, and any class that contains at least one abstract method must also be abstract. Methods defined as abstract simply declare the method's signature - they cannot define the implementation.
2. When inheriting from an abstract class, all methods marked abstract in the parent's class declaration must be defined by the child; additionally, these methods must be defined with the same (or a less restricted) visibility.
3. For example, if the abstract method is defined as protected, the function implementation must be defined as either protected or public, but not private. Furthermore the signatures of the methods must match, i.e. the type hints and the number of required arguments must be the same.
4. For example, if the child class defines an optional argument, where the abstract method's signature does not, there is no conflict in the signature. This also applies to constructors as of PHP 5.4. Before 5.4 constructor signatures could differ.
Abstract example:-
<?php
abstract class AbstractClass
{
    // Our abstract method only needs to define the required arguments
    abstract protected function prefixName($name);

}

class ConcreteClass extends AbstractClass
{

    // Our child class may define optional arguments not in the parent's signature
    public function prefixName($name, $separator = ".") {
        if ($name == "Pacman") {
            $prefix = "Mr";
        } elseif ($name == "Pacwoman") {
            $prefix = "Mrs";
        } else {
            $prefix = "";
        }
        return "{$prefix}{$separator} {$name}";
    }
}

$class = new ConcreteClass;
echo $class->prefixName("Pacman"), "\n";
echo $class->prefixName("Pacwoman"), "\n";
?>
The above example will output:
Mr. Pacman
Mrs. Pacwoman

---

COOKIE IN PHP:
A cookie is often used to identify a user. A cookie is a small file that the server embeds on the user's computer. Each time the same computer requests a page with a browser, it will send the cookie too. With PHP, you can both create and retrieve cookie values.

Purpose of cookie:-
Cookies make the interaction between users and web sites faster and easier. Without cookies, it would be very difficult for a web site to allow a visitor to fill up a shopping cart or to remember the user's preferences or registration details for a future visit.

Web sites use cookies mainly because they save time and make the browsing experience more efficient and enjoyable. Web sites often use cookies for the purposes of collecting demographic information about their users.

Cookies enable web sites to monitor their users' web surfing habits and profile them for marketing purposes (for example, to find out which products or services they are interested in and send them targeted advertisements).
 In php :-
1. PHP transparently supports HTTP cookies.
2. Cookies are a mechanism for storing data in the remote browser and thus tracking or identifying return users.
3. We can set cookies using the setcookie() or setrawcookie() function.
4. Cookies are part of the HTTP header, so setcookie() must be called before any output is sent to the browser. This is the same limitation that header() has
5. We can use the output buffering functions to delay the script output until you have decided whether or not to set any cookies or send any headers.
6. Any cookies sent to you from the client will automatically be included into a $_COOKIE auto-global array if variables_order contains "C". To assign multiple values to a single cookie, just add [ ] to the cookie name.
7. Depending on register_globals, regular PHP variables can be created from cookies. However it's not recommended to rely on them as this feature is often turned off for the sake of security
Setting new cookie:-
<?php
setcookie("name","value",time()+$int);
/*name is your cookie's name
value is cookie's value
$int is time of cookie expires*/
?>
Getting Cookie:-
<?php
echo $_COOKIE["your cookie name"];
?>
Updating Cookie:-
<?php
setcookie("color","red");
echo $_COOKIE["color"];
/*color is red*/
/* your codes and functions*/
setcookie("color","blue");
echo $_COOKIE["color"];
/*new color is blue*/
?>
Deleting Cookie:-
<?php
unset($_COOKIE["yourcookie"]);
/*Or*/
setcookie("yourcookie","yourvalue",time()-1);
/*it expired so it's deleted*/
?>.

To solve multiplication of numbers in few seconds

Example 1
Calculate 98 * 93
Solution
Select a closest base ( a power of 10). In this case we can select 100 as a base. Write these numbers with the difference from the base. That is 98-100 = -2 and 93-100 is -7. So write it as
98   :   -2
93   :   -7
Left side of the answer will be the diagonal sum including their signs. That is 98-7=91. So 91 will be the left side of the product. (You can take the other diagonal sum also, that is 93-2=91. Always these diagonal sums will be same).
To find the right hand side, just multiply the differences including their signs. That is -2 * -7 = 14
So we got that left side of the product is 91 and right side is 14. So answer is 9114

---

Example 2
Calculate 96 * 112
Solution
Use the same method. Let's select 100 as the base (Closed to both of the numbers).Write these numbers with the difference from the base. That is 96-100 = -4 and 112-100 is 12. So write it as
96    :   -4
112  :   12
Take the diagonal sum to get the left side of the product. That is 96+12 = 108 (Or 112-4 = 108).
For the right side, find the product of the differences. That is -4*12 = -48. Since it is -ve, we need to make it as +ve. For this borrow 1 from our left hand side 108. This borrowed 1 becomes 100 and our right hand side becomes 100+(-48) = 52. This is our right hand side
Since we borrowed one from left hand side, left hand side is 107
So answer is 10752

---

Example 3
Calculate 103 * 115
Solution
Use the same method. Let's select 100 as the base (Closed to both of the numbers).Write these numbers with the difference from the base. That is 103-100 = 3 and 115-100 is 15. So write it as
103  :   3
115  :   15
Take the diagonal sum to get the left side of the product. That is 103+15 = 118 (Or 115+3= 118).
For the right side , find the product of the differences. That is 3*15 = 45.
So answer is 11845

---

Example 4
Calculate 122 * 89
Solution
Use the same method. Let's select 100 as the base (Closed to both of the numbers).Write these numbers with the difference from the base. That is 122-100 = 22 and 89-100 is -11. So write it as
122  :  22
89    :   -11
Take the diagonal sum to get the left side of the product. That is 122+(-11) = 111 (Or 89+22= 111).
For the right side , find the product of the differences. That is 22*(-11) = -242. Since it is -ve, we need to make it as +ve. For this borrow 3 from our left hand side 111. This borrowed 3 becomes 300 and our right hand side becomes 300+(-242) = 58. This is our right hand side
Since we borrowed 3 from left hand side, left hand side is 108
So answer is 10858

---

Example 5
Calculate 1024 * 989
Use the same method. Let's select 1000 as the base (Closed to both of the numbers).Write these numbers with the difference from the base. That is 1024-1000 = 24 and 989-1000 is -11. So write it as
1024  :  24
989    :  -11
Take the diagonal sum to get the left side of the product. That is 1024+(-11) = 1013 (Or 989+24= 1013).
For the right side, find the product of the differences. That is 24*(-11) = -264. Since it is -ve, we need to make it as +ve. For this borrow 1 from our left hand side 1013. This borrowed 1 becomes 1000 and our right hand side becomes 1000+(-264) = 736.
Since we borrowed 1 from left hand side, left hand side is 1012 now.
So our answer is 1012736

---

Example 6
Calculate 997 * 986
Use the same method. Let's select 1000 as the base (Closed to both of the numbers).Write these numbers with the difference from the base. That is 997-1000 = -3 and 986-1000 is -14. So write it as
997  : -3
986  :  -14
Take the diagonal sum to get the left side of the product. That is 997+(-14) = 983 (Or 986-3= 983).
For the right side, find the product of the differences. That is (-3)*(-14) = 42. But here 42 has only 2 digits whereas our base 1000 has three zeros. So write 42 as 042.
So our answer is 98304

---

Quotes and thoughts for peace of mind and to think positive.

---

“The love of learning, the sequestered nooks, and all the sweet serenity of books” ― Henry Wadsworth Longfellow

---

---

“Life is a series of natural and spontaneous changes. Don't resist them; that only creates sorrow. Let reality be reality. Let things flow naturally forward in whatever way they like.” ― Lao Tzu

---

---

“There are two ways to get enough. One is to continue to accumulate more and more. The other is to desire less.” ― G.K. Chesterton

---

---

“Nothing is so aggravating as calmness.” ― Mahatma Gandhi

---

---

“The mind is everything. What you think you become.” – Buddha

---

---

“Gratitude is not only the greatest of virtues, but the parent of all others” – Cicero

---

---

“For beautiful eyes, look for the good in others; for beautiful lips, speak only words of kindness; and for poise, walk with the knowledge that you are never alone” –Audrey Hepburn

---

---

“Forgiveness liberates the soul, it removes fear. That’s why it is such a powerful weapon.” – Nelson Mandela

---

---

“Happiness is a state of mind. It’s just according to the way you look at things” – Walt Disney

---

---

“The body is the temple of the soul” – Dr. Oz

---

---

“You’re even more amazing than you wish you were” – Colin Wright

---

---

“When the solution is simple, God is answering” – Albert Einstein

---

---

“You yourself, as much as anybody in the entire universe, deserve your love and affection” – Gautama Buddha

---

---

“Acceptance is not love. You love a person because he or she has lovable traits, but you accept everybody just because they’re alive and human.” – Albert Ellis

---

---

“I bless you with pure love and light. I bless you with purified source energy” – Christie Marie Sheldon

---

---

“If you want to be interesting, be interested” – David Ogilvy

---

---

“People always ask me: ‘Were you funny as a child?’ Well, no, I was an accountant.” – Ellen DeGeneres

---

---

“Hope is being able to see that there is light despite all of the darkness” – Desmond Tutu

---

---

“When you say yes, the universe helps you” – Dan Brule

---

---

“My philosophy is simple, it is kindness” – Dalai Lama IVX

---

---

Share it to make the day of others with feeling of happiness.

C program for parenthesized expression using stack

/*PARENTHESIZED EXPRESSION USING STACK */

#include<stdio.h>
#include<conio.h>
#define MAX 10
int top=-1;
int stack[MAX];
void push(char);
char pop();
void main()
{
   char exp[MAX],ch;
   int i,flag=1;
   clrscr();
   printf("\n Enter Infix Expression:-\n");
   gets(exp);
   i=0;
   while(exp[i]!='\0')
   {
     if(exp[i]=='('||exp[i]=='{'||exp[i]=='[')
     {
push(exp[i]);
     }
     if(exp[i]==')'||exp[i]=='}'||exp[i]==']')
     {
       ch=pop();
       if(exp[i]==')'&&(ch=='{'||ch=='['))
       {
flag=0;
       }
       if(exp[i]=='}'&&(ch=='('||ch=='['))
       {
flag=0;
       }
       if(exp[i]==']'&&(ch=='('||ch=='{'))
       {
flag=0;
       }
     }
     i++;
   }
   if(top>=0)
   {
     flag=0;
   }
   if(flag==1)
   {
     printf("\n Valid Expression");
   }
   else
   {
     printf("\n Invalid Expression");
   }
   getch();
}
void push(char c)
{
  if(top==MAX-1)
  {
   printf("\n stack is full");
  }
  else
  {
    top++;
    stack[top]=c;
  }
}
char pop()
{
  char c;
  if(top==-1)
  {
   printf("\n Stack is empty");
  }
  else
  {
   c=stack[top];
   top--;
   return c;
  }
}

C program in stack to concatenate two strings using push and pop functions

#include<stdio.h>
#include<conio.h>
#include<string.h>
#define max 30
void push(char ch);
char pop();
char stack[max];
int top=-1;
void main()
{
char a[20],b[20],k[40],ch;
int i,l1,l2;
clrscr();
printf("\n Enter First String:-\n");
scanf("%s",a);
printf("\n Enter Second String:-\n");
scanf("%s",b);
l1=strlen(a);
l2=strlen(b);
for(i=0;i<l2;i++)
{
 push(b[i]); //push second string into stack
}
push(' ');
for(i=0;i<l1;i++)
{
 push(a[i]); //push first string into stack
}
printf("\n After concatenation of two string:-\n");
i=0;
while(top!=-1)
{
 ch=pop();
 if(ch==' ')
{
k[i]='\0';
printf("%s",strrev(k));
i=0;
 }
else
 {
  k[i]=ch;
  i++;
 }
}
k[i]='\0';
printf("%s",strrev(k));
getch();
}
void push(char ch)
{
if(top==max-1)
{
 printf("\n Stack is full");
}
else
{
 top++;
 stack[top]=ch;
}
}

char pop()
{
char t;
if(top==-1)
{
 printf("\n Stack is Empty");
}
else
{
 t=stack[top];
 top--;
 return(t);
}
}

C program for binary search

#include<stdio.h>
#include<conio.h>
void main()
{
 int a[20],n,i,k,mid,s,e,f=0;
 clrscr();
 printf("\n Enter how many number u want:-");
 scanf("%d",&n);
 printf("\n Please enter %d sorted numbers:-",n);
 for(i=0;i<n;i++)
 {
  scanf("%d",&a[i]);
 }
 printf("\n numbers are:-");
 for(i=0;i<n;i++)
 {
  printf("\t%d",a[i]);
 }
 printf("\n\n Enter search key number:-\n");
 scanf("%d",&k);
 s=0;
 e=n-1;
 while(s<=e)
 {
  mid=(s+e)/2;
  if(k==a[mid])
  {
   printf("\n %d number is found on %d position.",k,mid+1);
   f=1;
   break;
  }
  else
  {
   if(k>a[mid])
   {
    s=mid+1;
   }
   else
   {
    e=mid-1;
   }
  }
 }
 if(f==0)
 {
  printf("\n number is not found");
 }
 getch();
}



/* OUTPUT
 Enter how many number u want:-5                                              
                                                                               
 Please enter 5 sorted numbers:-10 11 12 13 14                                
                                                                               
 numbers are:-  10      11      12      13      14                            
                                                                               
 Enter search key number:-                                                    
 12                                                                            
                                                                               
 12 number is found on 3 position.   */

C program for linear searching

#include<stdio.h>
#include<conio.h>
void main()
{
 int a[10],n,i,k,f=0;
 clrscr();
 printf("\n Enter how many number u want:-");
 scanf("%d",&n);
 printf("\n Enter %d numbers:-",n);
 for(i=0;i<n;i++)
 {
  scanf(" %d",&a[i]);
 }
 printf("\n numbers are:-\n");
 for(i=0;i<n;i++)
 {
  printf("\t%d",a[i]);
 }
 printf("\n Enter search key number:-");
 scanf("%d",&k);
 for(i=0;i<n;i++)
 {
  if(k==a[i])
  {
   printf("\n %d number is found on %d position.",k,i+1);
   f=1;
   break;
  }
 }
 if(f==0)
 {
  printf("\n Number is not found");
 }
 getch();
}
/*
 Enter how many number u want:-5                                              
                                                                               
 Enter 5 numbers:-4 6 8 9 14                                                  
                                                                               
 numbers are:-                                                                
        4       6       8       9       14                                    
 Enter search key number:-9                                                    
                                                                               
 9 number is found on 4 position.      */

C program in data structure to make circular linked list

#include<stdio.h>
#include<conio.h>
#include<process.h>
void create();
void display();
void addbeg();
void addlast();
struct node
{
 int info;
 struct node *link;
}*start=NULL;
void main()
{
 int n;
 clrscr();
 while(1)
 {
  printf("\n **menu**\n");
  printf("\n 1. to create list \n 2. to display list");
  printf("\n 3. to add node at beginning of linked list");
  printf("\n 4. to add node at the last of linked list");
  printf("\n 5. exit");
  printf("\n Enter your choice:-");
  scanf("%d",&n);
  switch(n)
  {
   case 1 : create();
   break;
   case 2 : display();
   break;
   case 3 : addbeg();
   break;
   case 4 : addlast();
   break;
   case 5 : exit(0);

  }
 }
 getch();
}

void create()
{
 struct node *temp,*q;
 int x;
 temp=(struct node *)malloc(sizeof(struct node));
 if(temp==NULL)
 {
  printf("\n Insufficient memory");
 }
 else
 {
  printf("\n Enter number:-");
  scanf("%d",&x);
  temp->info=x;
  temp->link=NULL;
  if(start==NULL)
  {
   start=temp;
  }
  else
  {
   q=start;
   while(q->link!=start)
   {
    q=q->link;
   }
   q->link=temp;
  }
  temp->link=start;
 }
}

void display()
{
  struct node *q;
  printf("\n Circular linked list is:-\n\n");
  q=start;
  while(q->link!=start)
  {
   printf("   %d",q->info);
   q=q->link;
  }
  printf("   %d",q->info);
}

void addbeg()
{
 int x;
 struct node *temp,*q;
 temp=(struct node*)malloc(sizeof(struct node));
 if(temp==NULL)
 {
  printf("\n Insufficient memory");
 }
 else
 {
  printf("\n Enter number:-");
  scanf("%d",&x);
  temp->info=x;
  temp->link=NULL;

  q=start;
  while(q->link!=start)
  {
   q=q->link;
  }
  temp->link=start;
  start=temp;
  q->link=start;
 }
}
void addlast()
{
 struct node *temp,*q;
 int x;
 temp=(struct node*)malloc(sizeof(struct node));
 if(temp==NULL)
 {
  printf("\n Insufficient memory");
 }
 else
 {
  printf("\n Enter number:-");
  scanf("%d",&x);
  temp->info=x;
  temp->link=NULL;

  q=start;
  while(q->link!=start)
  {
   q=q->link;
  }
  q->link=temp;
  temp->link=start;
 }
}

C program in data structure to find the intersection between two linked list

#include<stdio.h>
#include<conio.h>
#include<process.h>
#include<stdlib.h>
struct node
{
 int info;
 struct node *link;
}*start1=NULL,*start2=NULL;
void main()
{
 struct node *temp,*q,*p;
 int n,i,x,f=0;
 clrscr();
 printf("\n First linked list");
 printf("\n Enter How many number:-");
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  temp=(struct node*)malloc(sizeof(struct node));
  if(temp==NULL)
  {
   printf("\n Insufficient memory");
   getch();
   exit(0);
  }
  printf("\n Enter number:-");
  scanf("%d",&x);
  temp->info=x;
  temp->link=NULL;
  if(start1==NULL)
  {
   start1=temp;
  }
  else
  {
   q=start1;
   while(q->link!=NULL)
   {
     q=q->link;
   }
   q->link=temp;
  }
 }
 printf("\n first list\n");
 q=start1;
 while(q!=NULL)
 {
  printf("\t%d",q->info);
  q=q->link;
 }
 start2=NULL;
 printf("\n Second linked list");
 printf("\n Enter How many number:-");
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  temp=(struct node*)malloc(sizeof(struct node));
  if(temp==NULL)
  {
   printf("\n Insufficient memory");
   getch();
   exit(0);
  }
  printf("\n Enter number:-");
  scanf("%d",&x);
  temp->info=x;
  temp->link=NULL;
  if(start2==NULL)
  {
   start2=temp;
  }
  else
  {
   q=start2;
   while(q->link!=NULL)
   {
     q=q->link;
   }
   q->link=temp;
  }
 }
 printf("\n second list\n");
 q=start2;
 while(q!=NULL)
 {
  printf("\t%d",q->info);
  q=q->link;
 }
 printf("\n intersection of two list is:-\n");
 q=start1;
 while(q!=NULL)
 {
  p=start2;
  while(p!=NULL)
  {
   if(q->info==p->info)
   {
    printf("\t%d",q->info);
   }
   p=p->link;
  }
  q=q->link;
 }
 getch();
}

/*   OUTPUT
 First linked list                                                            
 Enter How many number:-5                                                      
                                                                               
 Enter number:-1                                                              
                                                                               
 Enter number:-2                                                              
                                                                               
 Enter number:-3                                                              
                                                                               
 Enter number:-4                                                              
                                                                               
 Enter number:-5                                                              
                                                                               
 first list                                                                    
        1       2       3       4       5                                      
 Second linked list                                                            
 Enter How many number:-4

 Enter number:-1

 Enter number:-2

 Enter number:-5

 Enter number:-6

 second list
1       2       5       6
 intersection of two list is:-
1       2       5            
*/