Skip to main content

Data Bound Control in ASP.NET

What are databases? Why do we need them? How does a .NET application work with databases? These are some of the questions whose answers we need to know before we learn about working with databases in ASP.NET.
A. database is a collection of records or information that is stored in the form of tables in a systematic way so that a computer program can access the information easily whenever required. Structured Query Language (SQL) is used for retrieving, storing, deleting, and updating the records stored in a database. An application may need to use the databases for performing various functions, such as:
Displaying data in a tabular format by retrieving the records from the database
Displaying the data after processing the record retrieved from the database, such as calculating the service duration of each employee and then displaying the records
Processing the retrieved data and updating them in the database
Deleting the records from the database depending on the choice or condition specified by the user of the application
Here you learn about data bound controls that supported by ASP.NET. You can bind the data bound controls to the data source controls to display the data. Following is a list of data bound controls:
The GridView Control
The DataList Control
The DetailsVlew Control
The FormView Control
The ListView Control
The Repeater Control
The DataPager Control
The data source controls allow you to work with different types of data sources, such as SQL server or an XML file. Following is a list of data source controls:
The SqlDataSource Control
The AccessDataSource Control
The LinqDataSource Control
The ObjectDataSource Control
The XmlDataSource Control
The SiteMapDataSource Control


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 …