Assignment 11 (The Last One) Due Date for Programs: December 13, 2016

Transcription

1 Jonn Klukowsk Due Dte for Progrms: December 13, 2016 Problem 1 (10 points): Wht does this code do? Tke look t code below nd output tht it produces. Try to figure out exctly wht is going on. Explin wht this code does. 1 def extrct_lph ( word ): 2 clen_word = "" 3 if len(word) == 0 : 4 return clen_word 5 if not word[0].islph() : 6 return clen_word 7 for c in word : 8 if c.islph() or c== - or c== _ or c== \ \ 9 or c==u \u2019 or c==u \u2018 : # u n i c o d e f o r s m r t s i n g l e q u o t e s 10 clen_word = clen_word + c 11 if len(clen_word) == 1 nd not clen_word.islph() : 12 return "" 13 return clen_word.lower() phrse = "You re guest Ford fmily - Fords." + \ 16 "They live on 4th floor three-story brownstone. " + \ 17 "Wow!!!" words = phrse.split() 20 words_clen = [] for i in rnge(len(words)) : 23 words_clen.ppend( extrct_lph( words[i] ) ) for i in rnge(len(words)) : 26 print (formt(words[i], "<15s"), formt(words_clen[i], "<15s") ) 27 You re guest Ford fmily - Fords. They live on 4th floor three-story you re guest ford fmily fords y live on floor three-story 1

2 Jonn Klukowsk brownstone. Wow!!! brownstone wow Problem 2 (40 points): List Intersection Write progrm tht prompts user to enter two seprte lists numbers ( lists should be rbitrry length nd user input should be terminted by negtive vlue). Compute intersection two lists (which vlues occur in both lists) - progrm should produce list ll vlues tht re in intersection those two lists. Here is smple run progrm: Enter vlues for list 1 (terminte with -1): Enter vlues for list 2 (terminte with -1): List 1: [98,, 43, 18,, 98, 32, 17, 21] List 2: [87, 90, 65, 43, 17, 25, ] The lists hve 3 elements in common: [, 43, 17] Comment your source code by 1) briefly describing prts your progrm 2) including your nme, dte, nd your clss section t top your file (bove everything else) 3) documenting ll functions following IPO formt This Wht to Submit progrm should be nmed (i.e., nme file contining progrm should be) list_intersection.py. You only need to submit source code for this problem. Problem 3 (50 points): Word Count Write progrm tht once gin opens text book. This progrm should count occurrences user specified word in text. Your progrm should count exct mtches s well s occurrences tht word s substring in lrger word (for exmple ct is substring ctfood ). The progrm should be cse-insesitive, i.e., ct, Ct nd CAT should be counted ll s exct mtches ct. The progrm should prompt user for nme file contining book nd for word tht he/she wnts to serch for. The progrm should produce results with counts for exct mtches nd substring mtches s well s totl number words in input file. 2

3 Jonn Klukowsk Finlly, progrm should print sorted list ll UNIQUE words tht were mtched in process. For exmple, if user entered ct nd tht produces 10 exct mtches s well s 3 mtches to ctfood, 4 mtches to cts nd one mtch to ctrcts, n list unique words should contin [ ct, ctrcts, ctfood, cts ]. NOTE: you will need code from problem 1 for solving this problem. Here is smple run progrm: Enter file nme: moby_dick.txt Enter word to serch for: whle totl number words: whle occurs 9 times by itself whle occurs 739 dditionl times s substring lrger word Here re unique words: fishersright-whle horse-whles jons-in--whle nrwhle nrwhlehowever nrwhles right-whle sperm-whle sperm-whlemen whle whle-blls whle-bot whle-bots whle-bot s whle-bone whle-bones whle-books whle-crft whle-cruisers whle-cry whle-e whle-fstener whle-fish whle-fishers whle-fishery whle-fleet whle-ground whle-hter whle-hunt whle-hunter whle-hunters whle-hunting whle-jets whle-killer whle-lnce whle-line whle-lines whle-nturlists whle-pike whle-pole whle-ports whle-ship whle-ships whle-ships whle-ship s whle-smitten whle-spdes whle-spout whle-stek whle-surgeon whle-teeth whle-trover whle-wise whle whlenor whles whlebots whlebot s whlebone whleboning whled whledid whledrive whleeven whleho whlehow whlein whlemn whlemn s whlemen whlemento whlemen s whlemoby whlemodifying whleno whler whlers whles whles whleship whleships whleshirr whlesmen whlesnow whlesquid whle whlethis whle whle s whle sno Comment your source code by 1) briefly describing prts your progrm 2) including your nme, dte, nd your clss section t top your file (bove everything else) 3) documenting ll functions following IPO formt This Wht to Submit progrm should be nmed (i.e., nme file contining progrm should be) word_counter.py. You only need to submit source code for this problem. Wht nd how to submit? You should submit source code file for ech progrm to NYU Clsses by due dte stted bove. Mke sure tht you get n emil confirmtion fter you submit ssignment. You should keep tht emil until grdes re returned - it is your pro tht ssignment ws submitted! If you do not get n emil confirmtion, you should try to resubmit ssignment. If you do not get tht emil, it mens tht we did not get your ssignment. 3

4 Jonn Klukowsk 4

5 Nme(s) nd NetId(s): Wht does this code do? Describe in detils wht function does to word tht is pssed to it: Describe wht hppens to phrse vrible: