Skip to main content

XML: Presenting Data in Different Formats

Information pertaining to the way in which XML data must appear in a browser is specified using either CSS or XSLT style sheets. In certain situations, these two methods do not have the capability to display data in certain formats. For example, it is not feasible to display data in the form of tables using either of these documents. In such situations, it is both easier and less time-consuming to use other markup languages that are primarily created to display information in different formats in a browser.

Displaying Data in a Tabular Format

HTML is a markup language that is primarily used for data display. It provides a variety of predefined tags that can be used to display information in a web browser. You can combine the features of HTML and XSLT to format the data from an XML document for appropriate display.

Elements Required to Display Data in a Tabular Format

In order to use HTML tags in an XSLT style sheet, you first write the HTML code to display the data in the desired format. You then embed the HTML code in the XSLT document. The following table lists the HTML elements that are required to display data in a tabular format.

Acts as a container for all other tags used to specify the appearance of data in a table. It has attributes, such as border, background color, cell-padding, cell-spacing, and width that enable you to specify the appearance of the table.
Used to specify headings for a table.
Used as a parent for the TR and TD elements.
Used to represent a row in a table. This tag acts as a container for the TH and TD elements.
Used to add column headings.
Used to specify the data to be displayed in columns.


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 …