Skip to main content

How to make Custom error page in

If the error isn't properly handled anywhere ,it generates an ugly error message that your visitor will see -- you don't want this to happen

So add a custom error page to your site that your visitor will see in case an unhandled error happens. That page will politely ask the visitor to come back later.

Report the error once again , so the Administrator knows that this serious error gets to the visitor and needs to be taken care of as soon as possible.

Steps to follow for add custom error page:

  1. In Solution Explorer , Double-click web.config and add the following element as a child of the                     
      <customErrors mode ="RemoteOnly"  defaultRedirect ="errorpage.aspx" />

Note : If you want to handle errors using status code then specifies status code in <error> tag. Like

<customErrors mode ="On" defaultRedirect ="">
      <error statusCode ="404" redirect ="errorpage.aspx"/>     

2. Add a new web form to your application's root , named errorpage.aspx . This form should not use a Master page , to make sure nothing gets in the way of displaying out simple error . The page also doesn't need a code-behind file

Note: After this change , remote clients will be forwarded to errorpage.aspx when unhandled exceptions are thrown ; however on the local machine you will still receive detailed error information . if you want to see the same error message as your visitors , set mode to On instead of RemoteOnly

3. Write some message into your errorpage.aspx like

<%@ Page Language="C#" %>

<!DOCTYPE html>

<script runat="server">


<html xmlns="">

<head runat="server">
    <form id="form1" runat="server">
   Your requested generated an error message 
        we apolgize for the inconvenience.



4. Test your application by generating error 


Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video

Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:

      Suppose next node is allocated at an address 506, so the list becomes,

  Suppose next node is allocated with an address with an address 10,s the list become,

The other way to represent the linked list is as shown below:

 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …