Question

USING JAVA

• A method that parses the valid word file to a list of Strings. You may use a loop in the parsing method.
• A nonrecursive method that prints the input String, makes the first call to the recursive anagramizer method, sends the result to the filter method, and prints the filtered result. You may use this code:
• private void anagramize(String inString) {
•         System.out.println("input string: " + inString);
•         List < String > l = filter(anagramizeRecursive(inString.toLowerCase()));
•         System.out.println("Anagrams: " + l);
• }

Answer 1

package File;

import java.io.BufferedReader;

import java.io.File;

import java.io.FileReader;

import java.io.IOException;

public class FileWordSearch

{

public static void main(String[] args) throws IOException

{

File f1=new File("input.txt"); //Creation of File Descriptor for input file

String[] words=null; //Intialize the word Array

FileReader fr = new FileReader(f1); //Creation of File Reader object

BufferedReader br = new BufferedReader(fr); //Creation of BufferedReader object

String s;

String input="Java"; // Input word to be searched

int count=0; //Intialize the word to zero

while((s=br.readLine())!=null) //Reading Content from the file

{

words=s.split(" "); //Split the word using space

for (String word : words)

{

if (word.equals(input)) //Search for the given word

{

count++; //If Present increase the count by one

}

}

}

if(count!=0) //Check for count not equal to zero

{

System.out.println("The given word is present for "+count+ " Times in the file");

}

else

{

System.out.println("The given word is not present in the file");

}

  

fr.close();

}

}