Ask your own question, for FREE!
Computer Science 17 Online
OpenStudy (cloudx):

Please save my life Make a block that finds the acronym of all words not in list: this block takes an input phrase and an input list and gives the acronym of all words in the phrase that do not appear in the list. Must use Higher order function blocks This is to be programmed on http://snap.berkeley.edu/snapsource/snap.html

OpenStudy (rsmith6559):

Okay, so you break the input phrase into individual words, check each word against the list, if the word isn't in the list add it to another list. After you've processed the words in the phrase, Take the first letters of the words in the new list and make a string out of them and you have an acronym. I don't know snap from a hole in the ground.

OpenStudy (cloudx):

do you know how i would be able to do this with higher order function blocks? such as map, keep, and combine blocks

OpenStudy (rsmith6559):

I've never seen keep and combine blocks, so I have no idea. Maps are usually associative arrays, instead of using an index number to access an element, you can use a key (a string) to access an element. I don't see any advantage to using a map in this.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!