Skip to main content

Refreshing / reloading of pages and delayed redirect using Meta tags in ASP.Net c#

In this article, I will explain you, how to reload page after few seconds. This types of logics appear where web page refresh just after few seconds like yahoo cricket. By using Meta tag, we can implement in web technologies. I will give you an example of it. This article cover such things like :
Watch full code video

  1. Page Reload/ Refresh after 10 seconds.
  2. By using code we can do reload/ refresh page.
  3. By using AppendHeader( ) method we can solve this query.
  4. Redirect after 5 seconds to new page.
  5. Redirect page after session out.
Refreshing / reloading of pages and delayed redirect using Meta tags in ASP.Net c#

By using meta tag's attribute, we can refresh webpage, in which we have two attributes i.e http-equiv and content. Let's, take an example:

<head runat="server">
    <title>Meta Tags Example</title>
     <meta http-equiv="Refresh" content="10" />
</head>

We can do this thing by using c# code. By using HtmlMeta class's property, we can also refresh page just after 10 seconds.

C#

protected void Page_Load(object sender, EventArgs e)
{
    HtmlMeta meta = new HtmlMeta();
    meta.HttpEquiv = "Refresh";
    meta.Content = "10";
    this.Page.Header.Controls.Add(meta);
}

By using AppendHeader method we can do the same things.

C#

protected void Page_Load(object sender, EventArgs e)
{
    Response.AppendHeader("Refresh", "10");
}


If you want to do redirect page after few seconds then you should use meta tag at compile as well as runtime. In compile time, you can use meta tag with similar attribute which is defined in above code. The only one difference in both code i.e URL. URL pass in content as a attribute with some interval. Like:

Compile time : 
<head runat="server">
       <meta http-equiv="Refresh" content="10;url=Default.aspx" />
</head>

You can do the same code using c#

protected void Page_Load(object sender, EventArgs e)
{
    HtmlMeta meta = new HtmlMeta();
    meta.HttpEquiv = "Refresh";
    meta.Content = "10;url=Default.aspx";
    this.Page.Controls.Add(meta);
}

II-Method

protected void Page_Load(object sender, EventArgs e)
{
    Response.AppendHeader("Refresh", "10;url=Default.aspx");
}

If you want to out your page after session out then you can replace seconds with Session.Timeout property.

Comments

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 …