--%>
Assignment Help - homework help

State the term a markup language

State the term a markup language?

E

Expert

Verified

A markup language is a set of symbols and words for exampling the identity of pieces of a document (for illustration:

  • It is a paragraph,
  • It is a heading,
  • It is a list and
  • It is the caption of this figure).

Programs can utilize it with a stylesheet to create output for print, screen, video, Braille and audio.

Some markup languages (for example: those used within wordprocessors) only describe appearances (it is italics, this is bold), but such method can just be used for display, and is not usually re-usable for anything else.

   Related Questions in Programming Languages

  • Q : Define the term Graphical User Interface

    Graphical User Interface: A Graphical User Interface (abbreviated as GUI) is a part of a program which permits user interaction through graphical components, like menus, buttons, text areas, and so forth. Interaction frequently includes the usage of a

    		•
  • Q : Define Bootstrap classes Bootstrap

    Bootstrap classes: The classes which make up the Java Platform Core Application Programming Interface (API), like those found in the java.lang, java.io and java.io packages.

    		•
  • Q : What are Literals What are Literals and

    What are Literals and also state their respective types?

    		•
  • Q : What is Hash code Hash code : It is a

    Hash code: It is a value returned by a hash function. A hash code can be employed as an index into a random-access data structure, offering a proficient mapping between an object and its position. Employed by classes like HashMap.

    		•
  • Q : Explain Conditional operator

    Conditional operator: It is an operator taking three operands that is, a ternary operator. The conditional operator (?:) is employed in the form bexpr ? expr1 : expr2

    Q : Define Little-endian Little-endian : It

    Little-endian: It is a common difference among machines is the order in which they store up the individual bytes of multi-byte numerical data. The little-endian machine stores the lower-order bytes prior to the higher-order bytes.

    		•
  • Q : Explain the way to write the opening

    Explain the way to write the opening tag of an XHTML element.

    		•
  • Q : Explain LURCH LURCH (Menzies et al.

    LURCH (Menzies et al. 2004) uses random search to explore a state machine’s state space. Because the search is random, it gives no guarantee that the state space has been exhaustively explored, so LURCH cannot be used for verification. However,

    		•
  • Q : Explain the difference between the

    Explain the difference between the Interpreter and Compiler?

    		•
  • Q : Define Finally clause Finally clause :

    Finally clause: This is a part of try statement which is always executed, either subsequent the handling of caught exception, and normal termination of the protected statements.

    		•