Skip to main content

Introduction to HTML: Hyper Text Transfer Language

Introduction

HTML is a document - layout and hyperlink - specification language. It defines syntax and placement of special, embedded direction that are not displayed by the browser, but tell it how to display content of the document, including text, images, and other support media. The language also tells you to how to make a document interactive through special hypertext link, which connect your document with other documents.

HTML in brief

1. HTML stands for Hyper Text Markup Language.
2. HTML is not a programming language and used for data representation on web.
3. A markup language is a set of markup tags which describe how text should be displayed. 

HTML Tags

1. HTML tags are keywords surrounded by angle brackets like <html>
2. HTML tags are used in pairs like <b> and </b>
3. The first tag in a pair is the start tag (opening tag), the second tag is the end tag (closing tag). 

HTML File

1. An HTML file is a text file with HTML tags.
2. HTML file name must end with .htm or .html.
3. An HTML file is a simple text file so it  can be created using simple text editor.
4. An HTML file is often known as HTML document or a web page.

With all multimedia-enabling, new page layout features, and hot technologies that give life to HTML document over Internet. It is also important to understand the languages limitations : HTML is not a word processing tool, a desktop publishing solution, or even a programming language. Its fundamental purpose is to define the structure and appearance of document and document families so that they may be delivered quickly and easily to user. 

Structure of an HTML Document

An HTML document consists of :
1. Text: which defines the content of the document
2. Tags: which defines the structure and appearance of the document .

The structure of HTML document is simple , consisting of an outer <html> tag enclosing the document head and body :
<html>
  <head>
     <title>Title of page</title>
  </head>
  <body>
      This is an Example of simple <b>HTML document </b>
  </body>
</html>

HTML file is a plain text so it can be created using any text editor  and can be saved as filename.htm.
Each document has a head and a body, delimited by the <head> and <body> tags. The head where you give HTML document a title and where you indicate other parameters the browser may use when displaying the  document. The body is where you put the actual contents of HTML documents. This includes the text to display and document control markers (tags) that advise the browser how to display text. Tags also references special-effects files, including sound and graphics, and indicate the hyperlinks and anchors that are used to link document to other document.

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 …