1)Use recursion to implement a method boolean find(String t) that tests whether a
string is contained in a sentence:
Sentence s = new Sentence("Mississippi!");
boolean b = s.find("sip"); // Returns true
Hint: If the text starts with the string you want to match, then you are done. If not,
consider the sentence that you obtain by removing the ﬁrst character.
2)Use recursion to implement a method boolean find(String t) that tests whether a
3)Using only the public interface of the linked list class, write a method
public static void downsize(LinkedList staff)
that removes every other employee from a linked list.
4)The standard Java library implements a Stack class, but in this exercise you are asked
to provide your own implementation. Do not implement type parameters. Use an
Object array to hold the stack elements. When the array ﬁlls up, allocate an array
of twice the size and copy the values to the larger array
5)Implement a Stack class by using a linked list to store the elements. Do not implement type parameters
Yes. I can help. There are 5 questions and will take time. I am sending an email indicating new and fair price for this question. You may increase the price of the question. Please check inbox/spam/junk folder of the email address registered with JustAnswer and let me know.
You can ask me again using "For LogicPro only" at the start of your questions like other customers to get instant answers.
It will ensure that question is for me.
Please bookmark my profile page:
so you can come back and ask me a question anytime.
Remember, if for any reason you are unsatisfied with my answer, we can continue the conversation until you’re satisfied and rate my answer as excellent. I can address follow up questions on original requirements at no extra charge and I’m always here to help.
Thank you for using this site!
second needs to be this question i missed i submit same can you do that with include same price.
Implement a SubsetGenerator that generates all subsets of the characters of a string For example, the subsets of the characters of the string "rum" are the eight strings
"rum", "ru", "rm", "r", "um", "u", "m", "" Note that the subsets don’t have to be substrings—for example
Note that the subsets don’t have to be substrings—for example
I do have some assignments more .Can you help me that?
Yes. Post that as a new question using only "For LogicPro only" as question text. Once I reply on that page, you can copy paste the question
Go to following link
to create the question under my profile
can i send from message box?
are you available? can i send my assignment now?
i submitted questions. Can you take look them please?
1)Write a program that reads text from System.in and breaks it up into individual
words. Insert the words into a tree set. At the end of the input ﬁle, print all words,
followed by the size of the resulting set. This program determines how many
unique words a text ﬁle has.
2)Write a program that reads a Java source ﬁle and produces an index of all identiﬁers
in the ﬁle. For each identiﬁer, print all lines in which it occurs.
Hint: Call in.useDelimiter("[^A-Za-z0-9_]+"). Then each call to next returns a string
consisting only of letters, numbers, and underscores.
3)Try to ﬁnd two words with the same hash code in a large ﬁle, such as the /usr/share/
dict/words ﬁle on a Linux system. Keep a Map<Integer, HashSet<String>>. When you
read in a word, compute its hash code h and put the word in the set whose key is h.
Then iterate through all keys and print the sets whose size is > 1.
what do u mean ?