A string of characters is given.Find the highest occurrence of a character and display that character.

-
eg.: INPUT: AEGBCNAVNEETGUPTAEDAGPE OUTPUT: E or I,J(if equal occurance)


package assignment1;
/*
 * @author snlkjha
 */

public class Charfreq {
   
    public static void charFreq(String x){
       
        String toUpperCase = x.toUpperCase();   /*If the given string is in lower case or mixed case , convert it into upper case.*/
        char y[]=toUpperCase.toCharArray();
        int freq[]=new int[26],max=0;
        for(int i=0;i<y.length;i++) ++freq[(int)y[i]-65];
        System.out.println("________________________________________");
        for(int i=0;i<y.length;i++)
            if(freq[i]!=0)  System.out.println((char)(i+65)+" "+freq[i]);
        for(int i=1;i<freq.length;i++)  max=freq[max]<freq[i]?i:max;
        System.out.println("________________________________________");
        for(int i=0;i<y.length;i++)
          if(freq[i]==freq[max])  System.out.println((char)(i+65)+" "+freq[i]);
        System.out.println("________________________________________");
}
   
    public static void main(String[] args){      
        String x="AAEGBCNAVNEETGUPTAEDAGPE";
        charFreq(x);        
    }
}

INPUT : String x="AAEGBCNAVNEETGUPTAEDAGPE";
OUTPUT:

A 5
B 1
C 1
D 1
E 5
G 3
N 2
P 2
T 2
U 1
V 1
________________________________________
A 5
E 5

INPUT : String x="AAAEGBCNAVNEETGUPTAEDAGPE";
OUTPUT:
________________________________________
A 6
B 1
C 1
D 1
E 5
G 3
N 2
P 2
T 2
U 1
V 1
________________________________________
A 6

Popular posts from this blog

8 Bit Plane Slicing of an image in Image Processing

-
Image
%================ Bit Plane Slicing Program =================% A=imread('bit_plane_img.tif'); subplot(3,3,1),imshow(A),title('INPUT IMAGE'); for i=1:8     B=bitplaneslicing(A,i);     subplot(3,3,i+1),imshow(B),title(i); end %====================================================% %================ Bit Plane Slicing Function =================% function [ B ] = bitplaneslicing( A ,n) % function for n bit plane slicing where n<=8 [M,N]=size(A); B=zeros(M,N); for i = 1:M     for j = 1:N         str=dec2bin(A(i,j),8);         if strcmp(str(9-n),'0')             B(i,j)=0;         else             B(i,j)=2^(n-1);         end     end end end %====================================================% Input Image: bit_plane_img.tif Output Image:
Read more

Code to upload multiple files simultaneously using JSP, Servlet .

-
Image
Step 1 : Create a jsp page. index.jsp <%--      Document   : index     Created on : 21 Sep, 2013, 5:58:32 PM     Author     : snlkjha --%> <%@page contentType="text/html" pageEncoding="UTF-8"%> <!DOCTYPE html> <html>     <head>         <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">         <title>JSP Page</title>     </head>     <body>         <form action="UploadServlet" method="post" enctype="multipart/form-data">             <input type="file" id="file" name="file1" accept="image/*"  multiple="muliple" required/><br>             <input type="submit"/>            <br><br> ${requestScope.message} ...
Read more

STRING PALINDROME USING STACK AND QUEUE

-
#include<stdio.h> #include<stdlib.h> #include<string.h> void push(char ); char pop(); void nq(char ); char dq(); typedef struct list {     char data;     struct list *next; }node; node *top=NULL,*front=NULL,*rear=NULL; int main() {     char word[20];     printf("Type the Word:");     scanf("%s",word);     int length=strlen(word),i=0;     while(word[i]!='\0')     {         push(word[i]);         nq(word[i]);         i++;     }     for(i=0;i<length;i++)     {         if(pop()!=dq())         break;             }     if(i==length)        ...
Read more