Skip to main content

How to Upload File/Files in Asp.Net MVC

Uploading a file is need some Html code with setting the encoding type to multipart/form-data and the method of form is post. After setting this type, programmer have to use file upload control having the property name and id. Here is the code written in the view page:

@using (Html.BeginForm(null, null, FormMethod.Post, new { enctype = "multipart/form-data" }))
        <input type="file" name="file" id="file"/>
<input type="submit" value="Upload" />

This code will place a file upload control to browse a single file of any type of extension and a submit button which will help to post this file to action. Now our action method must have a specific parameter written below in the code:

public ActionResult GetValues(HttpPostedFileBase file)
var fileName = System.IO.Path.GetFileName(file.FileName);
var path = System.IO.Path.Combine(Server.MapPath("Path/"), fileName);

In this action method programmer can easily get this file and can save this file as done in above code. This code is for uploading/accessing single file, what if programmer want to upload multiple files.

To upload multiple files in view page, just change the file upload control as written below:

<input type="file" name="files" id="files" multiple/>

In the action method of controller change the parameter as written below:

public ActionResult GetValues(IEnumerable<HttpPostedFileBase> files)
foreach (var file in files)

All the files can easily accessed and using the foreach loop, programmer can perform individual action with these files. If programmer want to limit the no. of files to be uploaded by the user, no. of file upload control can be used in the view page and action code will remain same as is.

What if two files are uploaded with the same name, the previous file will be overwritten by the new one. To overcome with these issues we can rename the file when we are saving them like unique identifier or may be other unique name. Programmer can also perform some validation discussed earlier.


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 …