Skip to main content

HTML forms-Week 3

  Write an HTML page that has one input, which can take multi-line text and a submit button. Once the user clicks the submit button, it should show the number of characters, words and lines in the text entered using an alert message. Words are separated with white space and lines are separated with new line character.




<html>
        <head>
        <title>WT Lab Experiment-3</title>
        <script type="text/javascript">
        var cnt;
        function wordcount(count) {
        var words = count.split(/\s/);
        var lines = count.split("\n").length;
        cnt = words.length;
        document.getElementById('w_count').value = cnt;
        document.getElementById('c_count').value = count.length;
        document.getElementById('l_count').value = lines;
        }
        </script>
        </head>
        <body>
        <pre><b>
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Input Box : <textarea name="ta" rows="10" cols="30"  onkeyup="wordcount(this.value)"></textarea>
          <br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;No.of Words : <input type=text id="w_count" size="4" readonly><br>
         <br>No.of Characters : <input type=text id="c_count" size="4" readonly><br>
        <br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;No.of Lines : <input   type=text id="l_count" size="4" readonly><br>
        </b></pre>
        </body>
        </html>

output

HTML forms-Week 3


For more info regarding technology and pro stuff...visit http://peoplezmind.com/

Labels:

Comments

Post a Comment

Popular posts from this blog

RSA Algorithm For Encryption and Decryption

#include<stdio.h> #include<conio.h> #include<stdlib.h> #include<math.h> #include<string.h> long int p,q,n,t,flag,e[100],d[100],temp[100],j,m[100],en[100],i; char msg[100]; int prime(long int); void ce(); long int cd(long int); void encrypt(); void decrypt(); void main() { printf("\nENTER FIRST PRIME NUMBER\n"); scanf("%d",&p); flag=prime(p); if(flag==0) { printf("\nWRONG INPUT\n"); getch(); exit(1); } printf("\nENTER ANOTHER PRIME NUMBER\n"); scanf("%d",&q); flag=prime(q); if(flag==0||p==q) { printf("\nWRONG INPUT\n"); getch(); exit(1); } printf("\nENTER MESSAGE\n"); fflush(stdin); scanf("%s",msg); for (i=0;msg[i]!=NULL;i++) m[i]=msg[i]; n=p*q; t=(p-1)*(q-1); ce(); printf("\nPOSSIBLE VALUES OF e AND d ARE\n"); for (i=0;i<j-1;i++) printf("\n%ld\t%ld",e[i],d[i]); encrypt(); decrypt(); getch(); } int prime(long i...
Post a Comment
Read more

CRC-Cyclic Redundancy Check Program

#include <stdio.h>  #include <conio.h>  #include <string.h>  void main() { int i,j,keylen,msglen; char input[100], key[30],temp[30],quot[100],rem[30],key1[30]; printf("Enter Data: "); gets(input); printf("Enter Key: "); gets(key); keylen=strlen(key); msglen=strlen(input); strcpy(key1,key); for (i=0;i<keylen-1;i++) { input[msglen+i]='0'; } for (i=0;i<keylen;i++) temp[i]=input[i]; for (i=0;i<msglen;i++) { quot[i]=temp[0]; if(quot[i]=='0') for (j=0;j<keylen;j++) key[j]='0'; else for (j=0;j<keylen;j++) key[j]=key1[j]; for (j=keylen-1;j>0;j--) { if(temp[j]==key[j]) rem[j-1]='0'; else rem[j-1]='1'; } rem[keylen-1]=input[i+keylen]; strcpy(temp,rem); } strcpy(rem,temp); printf("\nQuotient is "); for (i=0;i<msglen;i++) printf("%c",quot[i]); printf("\nRemainder is "); for...
Post a Comment
Read more

Dijkstra Algorithm

Program to find the shortest path #include<stdio.h> #include<string.h> #include<math.h> #define IN 99 #define N 6 int dijkstra(int cost[][N], int source, int target); int dijsktra(int cost[][N],int source,int target) {     int dist[N],prev[N],selected[N]={0},i,m,min,start,d,j;     char path[N];     for(i=1;i< N;i++)     {         dist[i] = IN;         prev[i] = -1;     }     start = source;     selected[start]=1;     dist[start] = 0;     while(selected[target] ==0)     {         min = IN;         m = 0;         for(i=1;i< N;i++)         {             d = dist[start] +cost[start][i];             if(d< dist[i]&&selected[i]==0)       ...
Post a Comment
Read more