Skip to main content

Get Value by Custom View to Empty Controller in VS 2013: MVC 4

In earlier article we have added an empty controller with an action named GetValues in Visual Studio 2013. That action is of type HttpGet and return a simple view having a textbox control only. In this article we will access that value in the same controller with of course an HttpPost type of action.

The first thing is to create an HttpPost type of action having the same name to access the value from the view. Write the following code in the Empty controller just below the previously written GetValues action that is of type HttpGet.

public ActionResult GetValues(string username)
ViewBag.insertedValue = username;
return View();
Check out the parameter name of this action, it have the same spelling our textbox have. I have just save that value in the ViewBag and return the same view. Now in the view page I have added a simple submit button the section to display the value of this ViewBag. Here is the code of view page:

@using (Html.BeginForm())
        <div>Name: </div>
        <input type="submit" value="Send" />
            Accessed value: @ViewBag.insertedValue
Remaining code is as same as in earlier article, the change is only the submit button and a section to display the value. Now run this MVC application and write http://localhost:portNo/Empty/GetValues in the address bar of the browser and press enter.

Get Value by Custom View to Empty Controller in VS 2013: MVC 4

At the last of image Accessed value:  is blank initially. Write anything in the textbox (here DotProgramming) and click on the Send button. It will go to the HttpPost action of this view i.e. written above with the value inserted and then save that value in ViewBag. Remember, we have return the view in post action so it will come back with the value inserted and write on the view page as shown.

Get Value by Custom View to Empty Controller in VS 2013: MVC 4


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 …