Define about anchor tag, Computer Engineering

Assignment Help:

Q. Define about Anchor Tag?

Anchor tag is used to create links between various objects such as HTML pages, web sites, files etc. It is introduced by characters <A> and terminated by </A>. HREF is the most common attribute of ANCHOR tag. It defines destination of the link.

<HTML>

<HEAD>

<TITLE>Expertsmind</TITLE>

</HEAD>

<BODY BGCOLOR="#FFFFFF">

Go to <A HREF="https://www.expertsmind.com/">Expertsmind!</A>

</BODY>

</HTML>

As demonstrated in Figure below, text "EXPERTSMIND.COM" present between <A> and </A> tags becomes the hyperlink. On clicking anywhere on this hyperlink, browser would attempt to connect to given URL and website https://www.expertsmind.us would open, if possible. An email link could be specified in the same way. We just have to specify email address rather than a page address as the value of HREF as demonstrated in following code. On clicking on the link, default mail program on the user's computer opens up with a "To:" address as specified in the hyperlink. You can then type your message and send e-mail to that particular address.

<BODY BGCOLOR="#FFFFFF">

Send me <A HREF="mailto:[email protected]">mail</A>

</BODY>

It's also possible to make an image a link if desired. This is achieved using <IMG> tag. Consider the below illustration.

<HTML>

<HEAD>

<TITLE>EXPERTSMIND.COM</TITLE>

</HEAD>

<BODY BGCOLOR="#FFFFFF">

Go to <A HREF="https://expertsmind.com.com/"><IMG SRC="image.gif" WIDTH=130

HEIGHT=101></A>

</BODY>

</HTML>

So in the illustration demonstrated in Figure, image becomes the link. When user clicks on image, web site https://www.expertsmind.us opens up, if possible.


Related Discussions:- Define about anchor tag

Explain the handshaking signals, a. Explain the hardware mechanism for hand...

a. Explain the hardware mechanism for handling multiple interrupt requests. b. What are handshaking signals? Describe the handshake control of data transfer during input and out

Execution of a full instruction - computer architecture, Execution of a ful...

Execution of a full Instruction: Regard as the instruction: Add (R3), R1 Executing this particular instruction needed the below described actions: a) Fetch the

State the term- combinational circuit, In a pure combinational circuit is ...

In a pure combinational circuit is it necessary to mention all the inputs in sensitivity disk? if yes, why? Yes in a pure combinational circuit is it essential to mention all

Define dynamic linking, Define dynamic linking.  Dynamic linking is sam...

Define dynamic linking.  Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually us

Cisc approach - cisc architecture, CISC Approach - CISC architecture: ...

CISC Approach - CISC architecture: The main goal of CISC architecture is to finish a task in as few lines of assembly as possible as. This is gain by building processor hardwa

Opcode field of an instruction, For this machine there can be two more poss...

For this machine there can be two more possible addressing modes in addition to direct andimmediate.   Opcode field of an instruction is a group of bits which define various pro

Responsibilities of application layer, Application layer: It's the topmost...

Application layer: It's the topmost layer in OSI model, which allows the user to access network. This layer provides user interface for network applications like remote login, Wor

Illustrate about first generation computers, Q. Illustrate about First Gene...

Q. Illustrate about First Generation Computers? It is certainly ironic that scientific inventions of great impact have frequently been linked with supporting a very sad as well

Find the boolean expression for boolean algebra, Find the Boolean expressio...

Find the Boolean expression for logic circuit shown in Figure below and reduce it using Boolean algebra. Ans. Y = (AB)' + (A' + B)' = A' + B' + AB' by using Demorgan's Theorem. =

Why process scheduling algorithm favour i/o bound processes, Suppose that a...

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd