Questions
Problem 1: Recursive anagram finder please used Java please Write a program that will take a...

Problem 1: Recursive anagram finder

please used Java please

Write a program that will take a word and print out every combination of letters in that word. For example, "sam" would print out sam, sma, asm, ams, mas, msa (the ordering doesn't matter)

input:

cram

output:

cram

crma

carm

camr

cmra

cmar

rcam

rcma

racm

ramc

rmca

rmac

acrm

acmr

arcm

armc

amcr

amrc

mcra

mcar

mrca

mrac

macr

marc

Hints:

Your recursive function should have no return value and two parameters: string letters and string wordSoFar. You can initially call it getComb("sam","");

Base case:

no letters left. print out the word and return

Recursive case:

go through each letter from the word, remove it from letters (use substring), add it to wordSoFar, call the recursive function

In: Computer Science

Write a program that prompts the user for a file name, make sure the file exists...

Write a program that prompts the user for a file name, make sure the file exists and if it does reads through the file, count the number of times each word appears and then output the word count in a sorted order from high to low.

The program should:

  • Display a message stating its goal
  • Prompt the user to enter a file name
  • Check that the file can be opened and if not ask the user to try again (hint: use the try/except structure)
  • Count the number of times each word appears in the file, regardless if in lowercase or uppercase (hint: use dictionaries and the lower() function)
  • Display the word count in order from high to low
  • Bonus: if a few words have the same count, sort the display in an alphabetic order
  • For example, for the attached file NYT2.txt, the top five words in the output should be

the - 7

in - 6

to - 5

and - 4

of - 4

Using Python as program language

In: Computer Science

Implement synchronous send and receive of one word messages (also known as Ada-style rendezvous), using condition...

Implement synchronous send and receive of one word messages (also known as Ada-style rendezvous), using condition variables (don't use semaphores!). Implement the Communicator class with operations, void speak(int word) and int listen().

speak() atomically waits until listen() is called on the same Communicator object, and then transfers the word over to listen(). Once the transfer is made, both can return. Similarly, listen() waits until speak() is called, at which point the transfer is made, and both can return (listen() returns the word). Your solution should work even if there are multiple speakers and listeners for the same Communicator (note: this is equivalent to a zero-length bounded buffer; since the buffer has no room, the producer and consumer must interact directly, requiring that they wait for one another). Each communicator should only use exactly one lock. If you're using more than one lock, you're making things too complicated.

In: Computer Science

1.Search the Web for a project that was completed successfully. Write a 100-200 word summary of...

1.Search the Web for a project that was completed successfully. Write a 100-200 word summary of the project, including the critical factors that made this project a success.

2.Search the Web for a project that was not completed successfully. Write a 100-200 word summary of the project, including the reasons why you think this project failed.

In: Operations Management

Problem 1. How many bits are required to address a 4M × 16 main memory under...

Problem 1. How many bits are required to address a 4M × 16 main memory under the following conditions. (“4M x 16” means there are 4x220 16-bit words.) a) The main memory is byte-addressable? b) The main memory is word-addressable? (For part b, assume a 16-bit word.)

In: Computer Science

Consider this word problem about baking cookies:You are baking cookies for your class. You put pink...

Consider this word problem about baking cookies:You are baking cookies for your class. You put pink frosting on 1/3 of the cookies and you put red sugar on 1/4 of the cookies. How many cookies have both pink frosting and red sugar on them?(a) Is the cookie word problem a problem for 1/3 • 1/4 ? If so, explain briefly whyit is, if not, modify the problem so that it is a problem for 1/3 • 1/4 .(b) Is the cookie word problem a problem for 1/3 + 1/4 ? If so, explain briefly whyit is, if not, modify the problem so that it is a problem for 1/3 + 1/4 .

In: Statistics and Probability

( Note:Please answer this factor of consumer duities and responsibility in 1-11 respectively i your own...

( Note:Please answer this factor of consumer duities and responsibility in 1-11 respectively i your own word)

CONSUMER DUTIES AND RESPONSIBILITIES are given below and explain this in your own word.

1.Substantiate the complaint,

2.Listen to the seller,

3.Cooperate with the seller if needed,

4.Avoid inconvenience to others,

5.Do not personalize issues,

6.Not lend self to others,

7.Be well informed,

8.Understand the grievances redressal process,

9.Avoid impulsive buying,

10.Buy goods from authorized agents,

11.Other duties and responsibilities

explain this(1 to11) factor in your own word.

In: Accounting

question 1 – In 150 – 200 words (don’t include the lit cited in the word...

question 1 – In 150 – 200 words (don’t include the lit cited in the word count) summarize in your own words about why fishing is ethical and should be allowed.

Question 2 – In 150 – 200 words (don’t include the lit cited in the word count) summarize in your own words why fishing is unethical and should not be allowed.

two peer-reviewed journal articles must be cited for each question include arguments that were included in the lectures. You must include in-text citations and literature cited.




please make sure include the citations pleaes make sure more then 150 word

In: Biology

a)     How many four-letter words can be formed from the letters of the word LAUNDRY if each...

a)     How many four-letter words can be formed from the letters of the word LAUNDRY if each letter can only be used one time in a word? Y is NOT considered a vowel in this word.

b)    How many contain the letter Y?

c)     How many contain both vowels?

d)    How many of them contain exactly three consonants?

e)    How many of them begin and end in a consonant?

f)      How many begin with N and end in a vowel?

g)     How many begin with N and also contain Y?

h)    How many of them contain both N and Y?


In: Statistics and Probability

Q21 Write an essay of 1000+ words on the topic ‘The Relationships between Strategic Level and...

Q21 Write an essay of 1000+ words on the topic ‘The Relationships between Strategic Level and Functional Level’. [8 Marks]

VERY IMPORTANT:

DO NOT WRITE THE ANSWER - USE WORD FORMAT.

NO PLAGIARISM ACCEPTED IN THE ANSWER - QUESTION WILL BE SEND BACK.

THE ANSWER HAS TO BE MORE THAN 1000 WORD, NOT LESS THAN A 1000 WORDS.

In: Advanced Math