Learn to enjoy every minute of your life.Only I can change my life.

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

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

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

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

/*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]==']'&...

#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) { ...

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