HTML Tutorial

2. HTML tags

HTML Tags
 HTML tags contain three main parts: opening tag, content and closing tag. But some HTML tags are unclosed tags. When a web browser reads an HTML document, browser reads it from top to bottom and left to  right. HTML tags are used to create HTML documents and render their properties.  Each HTML tags have different properties.
Syntax
<tag> content </tag>
HTML Tag Examples

Note: HTML Tags are always written in lowercase letters. The basic HTML tags are given below:
         <p> Paragraph Tag </p>
         <h2> Heading Tag </h2>
         <b> Bold Tag </b>
         <i> Italic Tag </i>
         <u> Underline Tag</u>

Unclosed HTML Tags
Some HTML tags are not closed, for example br and hr.
<br> Tag: br stands for break line, it breaks the line of the code.
<hr> Tag: hr stands for Horizontal Rule. This tag is used to put a line across the webpage.
HTML Meta Tags
DOCTYPE, title, link, meta and style
HTML Text Tags
<p>, <h1>, <h2>, <h3>, <h4>, <h5>, <h6>, <strong>, <em>, <abbr>, <acronym>, <address>, <bdo>, <blockquote>, <cite>, <q>, <code>, <ins>, <del>, <dfn>, <kbd>, <pre>, <samp>, <var> and <br>

HTML Image and Object Tags
<img>, <area>, <map>, <param> and <object>
HTML List Tags
<ul>, <ol>, <li>, <dl>, <dt> and <dd>
HTML Table Tags
table, tr, td, th, tbody, thead, tfoot, col, colgroup and caption
HTML Form Tags
form, input, textarea, select, option, optgroup, button, label, fieldset and legend
HTML Scripting Tags
script and noscript

Introduction

                       HTML tutorial or HTML 5 tutorial provides basic and advanced concepts of html. Our HTML tutorial is Developed for beginners and professionals. The major points of HTML are given below:
  • HTML stands for Hyper Text Markup Language.
  • HTML is used to create web pages.
  • HTML is widely used language on the web.
  • We can create static website by HTML only.
HTML 5 Tags
           In this tutorial, we will learn HTML 5 tags such as audio tag, video tag, canvas tag, HTML svg, HTML Geo-location, HTML drag and drop etc.

All HTML Tags
          At last, we will learn all HTML tags one by one for example, marquee tag, textarea tag, br tag, hr tag, pre tag, h tag, code tag, input tag, title tag, meta tag, script tag, style tag etc.

What is HTML ?
           HTML is an acronym which stands for Hyper Text Markup Language. Let's see what is Hyper Text and what is Markup Language?

Hyper Text: Hyper Text simply means "Text within Text". A text has a link within it, is a hypertext. Every time when you click on a word which brings you to a new webpage, you have clicked on a hypertext.
Markup language: A markup language is a programming language that is used make text more interactive and dynamic. It can turn a text into images, tables, links etc.

       An HTML document is made of many HTML tags and each HTML tag contains different content.
              <!DOCTYPE>
              <html>
              <body>
              <h1>Write Your First Heading</h1>
              <p>Write Your First Paragraph.</p>
              </body>
              </html>
Output:



Description of HTML example
DOCTYPE: It defines the document type.
html : Text between html tag describes the web document.
body : Text between body tag describes the body content of the page that is visible to the end user.
h1     : Text between h1 tag describes the heading of the webpage. p : Text between p tag describes the paragraph of the webpage.

Brief History of HTML
            In the late 1980's , A physicist, Tim BernersLee who was a contractor at CERN, proposed a system for CERN researchers. In 1989, he wrote a memo proposing an internet based hypertext system.
           Tim BerneLrsee is known as father of HTML. The first available description of HTML was a
document Called "HTML Tags" proposed by Tim in late 1991.

Features of HTML
  • It is a very easy and simple language. It can be easily understood and modified.
  • It is very easy to make effective presentation with HTML because it has a lot of formatting tags.
  • It is a markup language so it provides a flexible way to design web pages along with the text.
  • It facilitates programmers to add link on the web pages (by html anchor tag) , so it enhances the interest of browsing of the user.
  • It is platformindependent because it can be displayed on any platform like Windows, Linux and Macintosh..etc..
  • It facilitates the programmer to add Graphics, Videos, and Sound to the web pages which makes it more attractive and interactive.

String Comparision Using Bubble Sort



1.    Write a program to find whether two given strings are permutations of each other.  A string str1 is a permutation of str2 if all the characters in str1 appear the same number of times in str2 and str2 is of the same length as str1.

Input: Two strings S1 and S2
Output:
yes - if they satisfy given criteria
no - otherwise

Constraints:
1 <= len(S1), len(S2) <= 100.
Characters from ASCII range 0 to 127.
White space will not be given in the string.




#include<iostream>
#include<string>
using namespace std;

string  asc(string str)
    {
    int i,j,temp;
   for(i=0;str[j]!='\0';i++)
    {
        for(j=i+1;str[j]!='\0';j++)
        {
            if(str[j]<str[i])
            {
                temp=str[j];
                str[j]=str[i];
                str[i]=temp;
            }
        }
    }
    return str;
    }


    int stringCompare(string str1,string str2)
    {
    int i,flag=0;

    for(i=0;str1[i]!='\0' && str2[i]!='\0';i++)
        {
         if(str1[i]!=str2[i])
            {
             flag=1;
             break;
            }
        }

    if (flag==0 && str1[i]=='\0' && str2[i]=='\0')
         return 1;
    else
         return 0;

}

int main()
{
    string s1,s2;
    int res;
    cout<<"Enter the string 1:";
    cin>>s1;
    s1=asc(s1);
    cout<<"Enter the string 2:";
    cin>>s2;
    s2=asc(s2);
    res=stringCompare(s1,s2);
    if(res==0)
        cout<<"\nYes";
    else
        cout<<"No";
}

Operating Systems

Topics:-

              Introduction 
             System Structures 
                                                    Click here to view objectives.....
             Process Concept 
             Multi-thread Programming 
             Process  Scheduling
             Synchronization 
             Deadlocks
                                                      Click here to view objectives.....
3.Memory & File Management
             Memory Management Strategies
             Virtual Memory management
             Secondary Storage Structure
                                                    Click here to view Objectives......
             
           

Memory Management 61-72

1.       The problem of thrashing is effected scientifically by ________.
1 Program structure
2 Program size
3 Primary storage size
4 None of the above
                Ans ) 1
2.       The mechanism that bring a page into memory only when it is needed is called _____________
1 Segmentation
2 Fragmentation
3 Demand Paging
4 Page Replacement
                Ans ) 3
3.        A thread
1 is a lightweight process where the context switching is low
2 is a lightweight process where the context switching is high
3 is used to speed up paging
4 none of the above
                Ans ) 1
4.        A tree structured file directory system
1 allows easy storage and retrieval of file names
2 is a much debated unnecessary feature
3 is not essential when we have millions of files
4 none of the above
                Ans ) 1
5.       Which of the following disk scheduling techniques has a drawback of starvation ?
1 SCAN
2 SSTF
3 FCFS
4 LIFO
                Ans ) 2
6.        A set of resources' allocations such that the system can allocate resources to each process in some order, and still avoid a deadlock is called ________.
1 Unsafe state
2 Safe state
3 Starvation
4 Greedy allocation
                Ans ) 2
7.       What is the first step in performing an operating system upgrade ?
1 Partition the drive
2 Format the drive
3 Backup critical data
4 Backup old operating system
                Ans ) 3
8.       In a virtual memory environment
1 segmentation and page tables are stored in the cache and do not add any substantial overhead
2 slow down the computer system considerable
3 segmentation and page tables are stored in the RAM
4 none of the above
                Ans ) 3
9.        If all page frames are initially empty, and a process is allocated 3 page frames in real memory and references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total number of page faults caused by the process will be __________.
1 10
2 7
3 8
4 9
                Ans ) 4
10.   Which of the following is crucial time while accessing data on the disk?
1 Seek time
2 Rotational time
3 Transmission time
4 Waiting time
                Ans ) 1
11.   In the ___________ method of data transfer, the participation of the processor is eliminated during data transfer.
1 Buffering
2 Caching
3 Direct Memory Access
4 Indirect Memory Access
                 Ans ) 3
12.   Data reside in file on disk under DOS environment, which of the following file name is invalid ?
1 OSCONCEPTS.doc
2 RAW
3 COMPAQ.BOOK
4 JUMPSTART.BOS

                Ans ) 3

Memory Management 46-60

1.       Virtual memory is __________.
                                                1 An extremely large main memory
                                                2 An extremely large secondary memory
                                                3 An illusion of extremely large main memory
                                                4 A type of memory used in super computers.
                                                                Ans ) 3
2.        The kernel keeps track of the state of each task by using a data structure called __
1 Process control block
2 User control block
3 Memory control block
4 None of the above
                Ans ) 1
3.        _________ page replacement alogorithm suffers from Belady's anamoly.
1 LRU
2 MRU
3 FIFO
4 LIFO
                Ans ) 3
4.       _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory
1 Translation Look aside buffer
2 Inverse page table
3 Segmented page table
4 All the above
Ans ) 1
5.        If you don’t know which version of MS-DOS you are working with, which command will you use after booting your operating system ?
1 Format command
2 FAT command
3 VER command
4 DISK command
                Ans ) 3
6.       _______ OS pays more attention on the meeting of the time limits.
1 Distributed
2 Network
3 Real time
4 Online
                Ans ) 3
7.       Paging _________.
1 solves the memory fragmentation problem
2 allows modular programming
3 allows structured programming
4 avoids deadlock
                Ans ) 1
8.        A thread is a __________ process .
1 Heavy Weight
2 Mutliprocess
3 Inter Thread
4 Light weight
                Ans ) 4
9.       _________ allocates the largest hole (free fragment) available in the memory.
1 Best Fit
2 Worst Fit
3 First Fit
4 None of the above
Ans ) 2
10.   Number of CPU registers in a system depends on ____________.
1 Operating system
2 Computer Architecture
3 Computer Organization
4 None of the above
                Ans ) 2
11.    Which directory implementation is used in most Operating System?
1 Single level directory structure
2 Two level directory structure
3 Tree directory structure
4 Acyclic directory structure
                Ans ) 3
12.   A page fault occurs
1 when the page is not in the memory
2 when the page is in the memory
3 when the process enters the blocked state
4 when the process is in the ready state
                                                                                Ans ) 1
13.   What is the memory from 1K - 640K called ?
1 Extended Memory
2 Normal Memory
3 Low Memory
4 Conventional Memory
                Ans ) 4
14.   The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________.
1 Editors
2 Compilers
3 System Call
4 Caching
                Ans ) 3
15.   If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,67.
1 310
2 324
3 315
4 321                Ans ) 4 


Previous page                                                    Next Page

Memory Management 16-30

1.       A disc queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 If the head is initially at 53rd cylinder, what will be the total number of cylinders traversed if we are using SSTF disc scheduling algorithm.
1) 156  
2) 236  
3) 366 
4) 456
Answer: 2
2.       The Best-Fit algorithm for allocating regions of contiguous memory does_________ 
1) Scan memory region list from start for first fit
2) Pick the closest free region in the entire list.
3) There is no such algorithm
4) Find the worst fit in the entire list 
Answer: 2
3.       Question: From the given data Bytes/Sector = 500
Sectors/Track = 50
Tracks/Platter = 150
Platters/ Hard Disk = 10
Data Transfer rate = 10 millisecs per byte
Total number of millisecs taken to transfer all the bytes in the hard disk?
1) 500 x 50 x 10 x 10
2) 500 x 50 x 150 x 10 
3) 500 x 50 x 150 x 10 x10 
4) 500 x 150 x 10 x10
Answer: 3
4.       From the given data Bytes/Sector = 500
Sectors/Track = 50
Tracks/Platter = 150
Platters/ Hard Disk = 10
Data Transfer rate = 10 millisecs per byte
Total number of millisecs taken to transfer the bytes from one single platter?
1) 500 x 50 x 150 x 10
 2) 500 x 50 x 10
 3) 500 x 150 x 50 x 10
 4) 500 x 150 x 10 x10
Answer: 1
5.       From the given data Bytes/Sector = 500
Sectors/Track = 50
Tracks/Platter = 150
Platters/ Hard Disk = 10
Data Transfer rate = 10 millisecs per byte
Total number of ms taken to transfer all the bytes from a cylinder cylinder? 
1) 500 x 50 x 10 x 10
2) 500 x 150 x 50
3) 500 x 150 x 10 x10
4) 50 x 150 x 10 x10
Answer: 1
6.        In a Hard disk,  Bytes per sector = 512
Sectors/track = 63
Number of Magnetic disks = 5
Tracks / platter = 50
Total number of bytes in a cylinder is ________
1) 512X 63X 5 
2) 512X 50X 5 
3) 512X 63 X 50 
4) 512 X 5
Answer: 1
7.       In a Hard disk,  Bytes per sector = 512
Sectors/track = 63
Number of Magnetic disks = 5
Tracks / platter = 50
The total number of bytes/platter is _____
1) 512X 63X 5
2) 512X 50X 5
3) 512X 63 X 50 
4) 512 X 5
Answer: 3
8.       In a Hard disk,  Bytes per sector = 512
Sectors/track = 63
Number of Magnetic disks = 5
Tracks / platter = 50
The total number of cylinders in the hard disk is_______.
1) 63 
2) 50 
3) 512 
4) 63 X 5
Answer: 2
9.       The size of single unit of allocation on disk is called ____.
1) Sector size 
2) Page size 
3) Segment size  
4)File size
Answer: 1
10.   Memory utilization factor shall be computed as follows 
(A)   memory in use/allocated memory.
(B)   memory in use/total memory connected.
(C) memory allocated/free existing memory.
 (D) memory committed/total memory available.  
                                Answer: B
11.     ‘LRU’ page replacement policy is                   
(A)    Last Replaced Unit.                 
(B) Last Restored Unit.
(C)  Least Recently Used.               
(D) Least Required Unit.           
Ans: (C)
12.     Nested Macro calls are expanded using the 
(A)    FIFO rule (First in first out)       
 (B)  LIFO (Last in First out)
(C)  FILO rule (First in last out)         
(D)  None of the above                     
Ans: (B) 
13.     A parser which is a variant of top-down parsing without backtracking is       
(A) Recursive Descend.          
 (B) Operator Precedence.                  
 (C) LL(1) parser.                     
  (D) LALR Parser.                                                                       
Ans: (A)    
14.    The expansion of nested macro calls follows 
(A)  FIFO rule.                                 
(B)  LIFO rule. 
(C)  LILO rule.                                
 (D)  priority rule.                         
Ans: (B) 
15.    In a two-pass assembler, the task of the Pass II is to  
(A)  separate the symbol, mnemonic opcode and operand  fields.                                        (B)  build the symbol table.
(C)  construct intermediate code.         
(D) synthesize the target program.                 

                                                Ans: (D)



Previous Page                                                                  Next Page