Node *temp; //Temp node

Node *prv = NULL; //Previous pointer

while(ptr !=NULL) //looping through the list and reversing

{

temp = ptr->next;

ptr->next = prv;

prv = ptr;

ptr = temp;
}

return prv;

sum = sum + arr[i];

if(sum > maxSum)

{

maxSum = sum;

end= i;

}

if(sum < 0)

{

sum = 0 ;

start = start + 1;
}

}
}

BigInteger bigRandom = GivenFunction() * 100000

if pivot > 0

then

loop to find data

return false

for(int current=1 ; current<size ; current++ , prev++)

{

if(arr[current]==arr[prev])

{

flag=1;

}

else

{

flag=0;

temp[j] = arr[prev];

j++;
}

}

if(printf(“hello world”))
}

push(tree);

while(stack is not empty)

{

myNode= pop();

print myNode->info;

push(node->right);

push(node->left);

}

• ASP has limited oops support and no built in support for xml.
• Error handling system is very poor in ASP.
• ASP is not having in-built facility for validation of controls.

• ASP .NET is fully Object Oriented Programming and full XML support
•  Error handling is very good.
• Inbuilt validations controls are provided in ASP.NET. which are easy to implement

if(((r1.left > r2.right || r1.right < r2.right) || (r1.top < r2.bottom || r1.bottom>r2.top)))

return 1;

else

return 0;

if(n == 0)

return 0;

if(n == 1)

return 1;
int first = 0;
int second = 1;   
int ans = 0;
for(int i=0; i < n-1; i++)
{
      ans = first + second;
      first = second;
      second = ans;

}
return ans;

c = getc();

putc(array[c - 'a']);

}*/

if(i%50==0)

{

flag = 1;

}

if(flag==0)

{

row = col-i%50;

printf(“%d ”,arr[row][k]);

}

else

{

col = i%50+1;

printf(“%d ”,arr[k][col])

}

node->data = s->data;

while(s!=NULL)

{

temp = (Node*)malloc(sizeof(Node));

temp->data = s->data;

prv->next = temp;

prv = temp;

s = s->next;

}

return node;
}

h1=tree_height(p->left);

h2=tree_height(p->right);

return str.matchs(regr);

while(s!=NULL && p!=NULL)

{

if(s==p)

{

return true;

}
}

return false;

return(tree_size(node->left) + tree_size(node->right) + 1);

if (p != NULL)

{

clear(p->left);

clear(p->right);

delete p;

}

public boolean park(ParkingSlot slot);

public boolean park(ParkingSlot slot)

{

if(slot is motobikeslot)

return true;

else

return false;

}

if(slot is Carslot or handicappedslot)

return true;

else

return false;

 else {
               goodRevision = mid;
           }
     }

 { // found two elements that sum up to our sought value

return 0;

return dp[index];

dp[index] = a;

dp[index] = b+arr[index];

if(temp==NULL)

return 0;

if(temp->val==n)

return height;

else

return (distance(n,temp->left,height+1) | distance(n,temp->right,height+1));

String regExp = "[0-2][0-5][0-5]\\.[0-2][0-5][0-5]\\.[0-2][0-5][0-5]\\.[0-2][0-5][0-5]";

return ipAdd.matches(regExp);

int total = 0;

while(fscanf(fp, "%d", &num))

{

total = total + num;

}

if (total%8==0)

return 1;

else

return 0;

wait(wrt);

if (t == null)

return (sum == 0);

int data = t.Data;

int result = sum - data;

if (result == 0)

return true;

return (SumExistsOverAnyPathInBinTree(t, result) ||

SumExistsOverAnyPathInBinTree(t.LeftChild, sum) ||

SumExistsOverAnyPathInBinTree(t.RightChild, sum));

while(ptr!=NULL)

{

temp = ptr->next;

ptr->next = ptr->prev;

ptr->prev = temp;

ptr = temp;

}

if(root==NULL)

return 0;

if(root->left==NULL && root->right==NULL)

return 1;

return CountLeafNode(root->left)+CountLeafNode(root->right);

if (n == null)

return 0;

else

return 1 + (width(n.left) + width(n.right));