Skip to main content

Computer Programming: Web Form controls, General introduction in ASP.NET

The Web form controls are closely designed to resemble standard Visual basic Winforms controls. These controls are used for designing the interface for any Web application, for example, when you visit the website of Google, you type your search query in a TextBox, which is a control. ASP.NET provides a standard set of controls that can be used for the development of Web Applications. You can access all these controls from the ToolBox present in the Visual Studio Integrated Development Environment ( IDE ) . These controls can easily be used by just dragging and dropping them at any desired location on the Web form. Based on the tasks performed by them, these controls on the ToolBox are grouped under various categories known as tabs. For example, controls for validating the data are put under the validation tab and controls used for logging on the websites are put under the Login tab. Similarly, controls for common use are put under the standard tab and are known as standard controls . All these controls come under the Control class. All the Standard/ Web server controls are based on the WebControl class, which, in turn, is based on the control class. In other words, the WebControl class has originated from the Control class.

Later session we will discuss about the inheritance hierarchy, pubic properties, public methods, and public events of the Controls and the WebControl classes. We also get to know about the various controls such as Label, Button, TextBox, Literal, Placeholder, Hidden Field, and FileUpload that originate from the WebControl class, along with their implementations.  

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 …