Skip to main content

How to Create a File System Web Site in Visual Studio

In a file-system Web site, you store the files for your application in a folder on your local computer or on a computer that is accessible on your network. File system Web sites are useful for developing locally on your computer because you do not need Internet Information Services (IIS) to create or test them.

To create a file-system Web site

  1.   In Microsoft Visual Studio, on the File menu, point to New and then click Web Site.
  2. Under Visual Studio installed templates, select the template for the type of web site you want to create.
  3. In the Location list, click File System.
  4. In the language list, click the language you want to use as the default programming language for the Web application.
  5. In the Location text box, type the path and folder where you want to create the Web site. You can specify a local path or a UNC path to a different computer on your network.
  6. If you prefer to browse to an existing location, do the following:
  • Click Browse
  • In the Choose Location dialog box, click the File System tab.
  • In the File System tree, select the folder you want to use or type the path in the folder box.
  • To create a new folder, select the location, click Create New Folder, and then type a name for the new folder.
  • Click Open to return to the New Web Site dialog box.
  1. Click
Visual Studio creates the site, opens a default page in the page designer, and then displays the folder in Solution Explorer.
If the path you specified already contains files, Visual studio prompts you to specify a different location, open the existing web site, or create the Web site anyway. In the last case, the files are created with the Web site overwrite any files with the same name that are already in the folder.


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 …