I saw few people posted this but wrongly formatted and incomplete.
This is the real thing.
Now see if anyone can pls help. Thank u.
As for the rest, finally u know what this is all about ",
 
Task 1
------
Class, Inheritance, String Processing, Sorting, Searching
 
Consider the code:
------------------
 
public class Meth1
 
{
	public static boolean words(String[]p,String[]q)
 
	{
	boolean flag=true;
 
	for(int i=0;(i<q.length && flag);i++)
	flag=(look(p,q[i]));
 
	return flag;
}//words
	
	public static boolean look(String[]p,String w)
	{
 
	boolean flag=false;
 
	for(int i=0;(i<p.length && !flag);i++)
	if (p[i].equals(w))flag=true;
 
	return flag;
	}
 
}//Meth1
 
 
a) Work out and document the processes being carried out by the method "words"
   in the above class. Your documentation should include any data used for this purpose.
 
Tips:
-----
 
import java.io.*;
 
public class TestMeth1
{
	public static void main(String args[])
	{
		String w1[]={"cast","static","thread","make","void","import"};
		String w2[]={"import","cast","static"};
 
		Meth1 m = new Meth1();
 
System.out.println(m.words(w1,w2));
 
}//main
 
 
 
b) A client has an array of English words. What is required to list all those words
   from the array, which come alphabetically after the word "make", and they are to
   appear in alphabetical order.
   For example, given an array of words as shown below:
 
   cast    static    thread    make    void    import
 
   should produce an array of words:
 
   static    thread    void
 
   Use inheritance to extend the class "Meth1" to provide the necessary methods
   which achieves the specified requirement.
 
Tips: 
-----
 
//Do inheritance with Task 1 a)
 
{
	void sortWords(...)
 
	{
   	 .
   	 .
	 .
  	}
 
	void displayAll(...)
 
	{
   	 .
   	 .
   	 .
  	}
 
	void displayFrom(String w[], String point)
 
	{
   	 .//if point exist in String w[], output all words after "make"  
   	 .//else, error message.
   	 .
  	}
} 
 
 
public class TestTask1b
{
	public static void main
	{
	 Task1b t = new Task1b();
	 .
	 .
	 .
	}
}
 
THE END