Skip to main content

How to Use ViewModel in Asp.Net MVC

ViewModel is used to specify the fields which may be required in create, edit or list the data on a strongly typed view. Asp.Net MVC uses these type of classes in which each field may contains specific validation rules using data annotations. These validation rules may be used for any type of data like DateTime, String or Integer.

Basically, Models are used to create database in Entity Framework and may be used to access database using the same name of classes. To differentiate the model with views programmer have to use ViewModel to interact view to make them strongly typed.

According to our previous article, Student Model have a list of field i.e. Id (primary key), name, age and city. In a view, we want to show only name and city then we have to create a view model with only these two fields and some validation rules like written below:

public class StudentViewModel
[Display(Name="Student Name")]
[Required(ErrorMessage="Name Required")]
public string Name { get; set; }

[Display(Name = "Student City")]
[Required(ErrorMessage = "City Required")]
public string City { get; set; }
Open our controller and write an action type of HttpGet with some line of code to return just a blank view model of type StudentViewModel.
public ActionResult StudentVM()
StudentViewModel svm = new StudentViewModel();
return View(svm);
Add a strongly typed view to select particular options listed in the below image:

How to Use ViewModel in Asp.Net MVC

The view page which is automatically creates as strongly typed, when run in the browser, have the display name for each field set in the ViewModel. When create button is clicked without any value, both of them show the error messages assigned previously in the ViewModel.

How to Use ViewModel in Asp.Net MVC

So ViewModels are used to organize and manage data in strongly typed view with more flexible way than other complex ways like Models or ViewBag etc.


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 …