Display Browser information using javascript

By -

Q. Write a program using Java script for Web Page to display browsers information.


 Ans.

<!DOCTYPE>
<html>
<head>
    <title>Browsers information</title>

  <script language=javascript>

  function showBrowserinfo()
  {
    document.write("<b>Web Page to display browsers information</b> <br><br>");
    document.write("Name "+navigator.appName+"<br>");
    document.write("Version "+navigator.appVersion  +"<br>");
    document.write("Codename " +navigator.appCodeName  +"<br>");
    document.write("Cookie enable"+navigator.cookieEnabled  +"<br>");
    document.write("Java Enable"+navigator.javaEnabled  +"<br>");
    document.write("Mime type"+navigator.mimeTypes  +"<br>");
    document.write("Platform"+navigator.platform  +"<br>");
    document.write("Plug ins"+navigator.plugins  +"<br>");
    document.write("System Language"+navigator.systemLanguage  +"<br>");
    document.write("User language"+navigator.userAgent  +"<br>");
    document.write("User Agent"+navigator.userAgent  +"<br>");
  }
  </script>
</head>
<body>
  <h1>Web Page to display browsers information</h1>
    <form id="form1">
    <div>
        <input id="Button1" type="button" value="Click me" onclick="showBrowserinfo()" /> 
    </div>
    </form>
</body>
</html>



INFO@
Here’s a table of all the parsed properties:

     Property                      Description

    browser.family          Browser’s name
    browser.name            Browser’s name and version number
    browser.version         Browser’s full version
    browser.major           Browser’s major version number
    browser.minor           Browser’s minor version number
    browser.patch            Browser’s patch number
    device.family            Device name
    device.name              Device name and version
    device.version           Device full version
    device.major             Device’s major version number
    device.major             Device’s minor version number
    device.patch              Device’s patch number
    device.type               Type of device (e.g. “Desktop” or “Mobile”)
    device.manufacturer        Manufacturer of the device
    os.family                   Operating system name
    os.name                    Operating system name a full version
    os.version                 Operating system’s full version
    os.major                   Operating system’s major version number
    os.minor                   Operating system’s minor version number
    os.patch                    Operating system’s patch number

Comments

Post a Comment

Popular posts from this blog

C program that contains a string XOR each character in this string with 0 ,127

By -
Write a C program that contains a string (char pointer) with a value \Hello World’. The program should XOR each character in this string with 0 and displays the result. Program: #include<stdlib.h> main() { char str[]="Hello World"; char str1[11]; int i,len; len=strlen(str); for(i=0;i<len;i++) { str1[i]=str[i]^0; printf("%c",str1[i]); } printf("\n"); } Q.2 Write a C program that contains a string (char pointer) with a value \Hello World’. The program should AND or and XOR each character in this string with 127 and display the result. PROGRAM: #include <stdio.h> #include<stdlib.h> void main() { char str[]="Hello World"; char str1[11]; char str2[11]=str[]; int i,len; len = strlen(str); for(i=0;i<len;i++) { str1[i] = str[i]&127; printf("%c",str1[i]); } printf("\n"); for(i=0;i<len;i++) { str3[i] = str2[i]^127; printf("%c",str3[i]); } pri
Read more

Queue in Data Structure(DS)

By -
Image
Queue Queues are data structures that follow the First In First Out (FIFO) i.e. the first element that is added to the queue is the first one to be removed. Elements are always added to the back(rear) and removed from the front. Think of it as  a line of people waiting for a bus. The person who is at the beginning of the line is the first one to enter the bus.   Basic features of Queue Like a stack, the queue is also an ordered list of elements of similar data types. A queue is a FIFO( First in First Out ) structure. Once a new element is inserted into the Queue, all the elements inserted before the new element in the queue  must be removed, to remove the new element. In a simple queue, there is a disadvantage after deleting element we cannot insert the element in the queue because of insertion  is possible from the rear but deletion is performed from the front.                                           insertion                                     ------------------
Read more

Implementation of stack Using Array

By -
Implementation  of stack Using Array #include<stdio.h> void pop(); void push(); void display(); int i,n,ch=0,top,item,stack[50]; int main() {     printf("Enter the number of element in Stack:\t");     scanf("%d",&n);     top=-1;     printf("Stack Operations");     printf("\n1.Push\n2.Pop\n3.Display\n4.Exit\n");    do     {         printf("Enter the choice: ");         scanf("%d",&ch);         switch(ch)         {             case 1:push();                    break;             case 2:pop();                    break;             case 3:display();                    break;             case 4:exit(0);                    break;             default:printf("!!Wrong choice!!\n");         }     }     while(ch!=4);     return 0; } void push(int item) {     if(top==n-1)         printf("Overflow\n");     else     {        
Read more