代写data程序、代做Python代写编程、Python语言程序调试-代写Python编程

联系方式

QQ：99515681
邮箱：99515681@qq.com
工作时间：8:00-23:00
微信：codinghelp

您当前位置：首页 >> Python编程Python编程

代写data程序、代做Python代写编程、Python语言程序调试

日期：2020-12-04 09:23

ASSIGNMENT 6

copyrighted by its creators (the professors in this course). You are forbidden to share any part of this

assignment in private or on internet; doing so will constitute an infringement of copyright and will be

treated as an academic violation and prosecuted as such. If any part of your assignment is found online or

shared with someone else at any time before, during, or after the assignment this will also be treated as an

academic violation.

Read the instructions below carefully. The instructions must be followed. This assignment is worth 7% of your

grade. The assignment is due on Monday 7 of December 8AM. No late assignment will be accepted.

This is an individual assignment. Please review the Plagiarism and Academic Integrity policy presented in

the first class.

In addition to the assignment files specified later, if you used any code that you did not create/write

yourself, your submission will need to contain declaration-YOUR-FULL-NAME.txt file. Specifically:

About declaration-YOUR-FULL-NAME.txt file:

It needs to be a plane text file and it must contain references to any code you used that you did not write

yourself, including any code you got from a friend, internet, social media/forums (including Stack

Overflow and discord) or any other source or person. The only exclusion from that rule is the following:

all the material on the Brightspace of the course, anything from your textbook, anything from python.org

and python’s help pages. So here is what needs to be written in that file. In every question where you used

code from somebody else, you must write:

1. question number

2. copy-pasted parts of the code that were written by somebody else. That includes the code you

found/were-given that you then slightly modified.

3. whose code it is: name of a person or place on internet/book where you found it.

While you may not get points for that part of the question, you will not be in position of being accused of

plagiarism.

Not including declaration-YOUR-FULL-NAME.txt will be taken as you declaring that all the code in the

assignment was written by you. Any student caught in plagiarism will receive zero for the whole

assignment and will be reported to the dean. Finally showing/giving any part of your assignment code to a

friend also constitute plagiarism and the same penalties will apply.

If you have nothing to declare, you do not need to submit the file declaration-YOUR-FULL-NAME.txt

The goal of this assignment is to learn and practice Sets, Dictionaries, and Objects.

This assignment has 2 parts, the first concerns Sets and Dictionaries and the second is about Objects.

Put all your documents into a folder called a6.xxxxxx, where you replace xxxxxx in the file name with

your student number, zip the folder and submit it in BRS. The folder should a6_part1_xxxxxx.py,

a6_part2_xxxxxx.py and a6_part2_testing_xxxxxx.txt where you changed xxxxxx to your student

number.

For part 1, I provided you with starter code in file called a6_part1_xxxxxx.py. Begin by replacing xxxxxx

in the file name with your student number. Then open the file. Your solution (code) for the assignment

must go into that file in the clearly indicated spaces.

The file has a part of the main pre-coded for you. It also has some functions completely pre-coded for

you. Your task will me to code the remaining functions. You are not allowed to delete or comment-out

any parts of the provided code. The only exception to that rule is the keyword pass. Some functions have

that keyword. You can remove it once you are done coding that function. You also must follow the

instructions given in comments and implied by docstrings. You are however allowed to add your own

additional (helper) functions. In, fact you must add at least THREE more function. If you are running out

of ideas here are the names of some of the extra functions my solution has: remove_punctuation(words),

process_lines(ls), make_dict(lsw), is_valid(D,query) is_word(word)

I have provided 5 text files to test and debug your code with as explained in the next section.

As always, you can make multiple submissions, but only the last submission before the deadline will be

graded.

As always, each of your programs must run without syntax errors. In particular, when grading your

assignment, TAs will first open your file a6_part1_xxxxxx.py with IDLE and press Run Module. The

same will be done with a6_part2_xxxxxx.py

If pressing Run Module causes any syntax error, the grade for that part becomes zero. Furthermore, for

each function whose code is missing, I have provided below one or more tests to test your functions with.

To obtain a partial mark for these function your solutions may not necessarily give the correct answer on

these tests. But if your function gives any kind of Python error when run on the tests provided, that

function will be marked with zero points. Finally, each function has to be documented with docstrings.

Using global variables inside of functions is not allowed.

1 Part 1: Sets and Dictionaries – 40 points

For this part, you will need to write a program that solves co-existence problem.

What is co-existence problem?

You will write a Python program to solve the co-existence problem. The co-existence problem is stated as

follows. We have a file containing English sentences, one sentence per line. Given a list of query words,

your program should output the line number of lines that have all those words. While there are many

ways to do this, the most efficient way is to use sets and dictionaries. Here is one example. Assume that

the following is the content of the file. Line numbers are included for clarity; the actual file doesn’t have

the line numbers.

1. Try not to become a man of success, but rather try to become a man of value.

2. Look deep into nature, and then you will understand everything better.

3. The true sign of intelligence is not knowledge but imagination.

4. We cannot solve our problems with the same thinking we used when we created them.

5. Weakness of attitude becomes weakness of character.

6. You can’t blame gravity for falling in love.

7. The difference between stupidity and genius is that genius has its limits.

(These are attributed to Albert Einstein. )

If we are asked to find all the lines that contain this set of words: {“true”, “knowledge”, “imagination”}

the answer will be line 3 because all three words appeared in line 3. If they appear in more than one line,

your program should report all of them. For example, co-existence of {“the”, “is”} will be lines 3 and 7.

IMPORTANT: You should download a text file version of book War and Piece from here:

https://www.dropbox.com/s/pg4p9snzv60rp5v/WarAndPiece.txt?dl=0

Download it and save it in the same directory as your program. You solution should be instantaneous on

that book, i.e. your program should produce the required dictionary in 1 or 2 seconds on that book and it

should answer questions about any co-existence instantaneously.

Alternatively, you can find the book on Gutenberg project. That is where I downloaded it from. You can

find it here under PlainS Text UTF-8: http://www.gutenberg.org/ebooks/2600

Python Implementation:

You need to implement the following functions:

1) open_file()

The open_file function will prompt the user for a file-name, and try to open that file. If the file exists, it

will return the file object; otherwise it will re-prompt until it can successfully open the file. This feature

must be implemented using a while loop, and a try-except clause.

2) read_file(fp) This function has one parameter: a file object (such as the one returned by the open_file()

function).

This function will read the contents of that file line by line, process them and store them in a dictionary.

The dictionary is returned. Consider the following string pre-processing:

1. Make everything lowercase

2. Split the line into words

3. Remove all punctuation, such as “,”, “.”, “!”, etc.

4. Remove apostrophes and hyphens, e.g. transform “can’t” into “cant” and “first-born” into “firstborn”

5. Remove the words that are not all alphabetic characters (do not remove “cant” because you have

transformed it to “cant”, similarly for “firstborn”).

6. Remove the words with less than 2 characters, like “a”

Hint for string pre-processing mentioned above:

To find punctuation for removal you can import the string module and use string.punctuation which has

all the punctuation.

To check for words with only alphabetic characters, use the isalpha() method. Furthermore, after preprocessing,

you add the words into a dictionary with the key being the word and the value is a set of line

numbers where this word has appeared.

For example, after processing the first line, your dictionary should look like:

{'try': {1}, 'not': {1}, 'to': {1}, 'become': {1}, 'man': {1},'of': {1}, 'success': {1}, 'but': {1}, 'rather': {1},

'value': {1}}

This should be repeated for all the lines; the new keys are added to the dictionary, and if a key already

exists, its value is updated. At the end of processing all these 7 lines, the value in the dictionary associated

with key ``the'' will be the set {3, 4, 7}. (Note: the line numbers start from 1.)

3) find_coexistance(D, query) The first parameter is the dictionary returned by read_file; the second one

is a string called query. This query contains zero or more words separated by white space. You need to

split them into a list of words, and find the line numbers for each word. To do that, use the intersection or

union operation on the sets from D (you need to figure out which operation is appropriate). Then convert

the resulting set to a sorted list, and return the sorted list. (Hint: for the first word simply grab the set from

D; for subsequent words you need to use the appropriate set operation: intersection or union.)

4) #main

The main part of the program should call the three functions above. Loop, prompting the user to enter

space-separated words. Use that input to find the co-occurrence and print the results. Continue prompting

for input until ``q'' or ''Q'' is inputted.

Very important considerations:

Every time you want to look up a key in a dictionary, first you need to make sure that the key exists.

Otherwise it will result in an error. So, always use an if statement before looking up a key:

if key in data_dict:

## the key exists in a dictionary, so it is safe to use data_dict[key]

After you completed the program, see how it works for the two files provided: einstein.txt, and

gettysburg.txt

1.1 Testing Part 1

1.2 Testing with einstein.txt file

Enter the name of the file: b.txt

There is no file with that name. Try again.

Enter the name of the file: grrrr

There is no file with that name. Try again.

Enter the name of the file: einstein.txt

Enter one or more words separated by spaces, or 'q' to quit: the

The one or more words you entered coexisted in the following lines of the file:

3 4 7

Enter one or more words separated by spaces, or 'q' to quit: the is

The one or more words you entered coexisted in the following lines of the file:

3 7

Enter one or more words separated by spaces, or 'q' to quit: true knowledge imagination

The one or more words you entered coexisted in the following lines of the file:

Enter one or more words separated by spaces, or 'q' to quit: bla

Word 'bla' not in the file.

Enter one or more words separated by spaces, or 'q' to quit: can't

The one or more words you entered coexisted in the following lines of the file:

Enter one or more words separated by spaces, or 'q' to quit:

Word ‘’ not in the file.

Enter one or more words separated by spaces, or 'q' to quit: ?

Word '' not in the file

Enter one or more words separated by spaces, or 'q' to quit: a

Word 'a' not in the file.

Enter one or more words separated by spaces, or 'q' to quit: nature

The one or more words you entered coexisted in the following lines of the file:

Enter one or more words separated by spaces, or 'q' to quit: THE

The one or more words you entered coexisted in the following lines of the file:

3 4 7

Enter one or more words separated by spaces, or 'q' to quit: tHe

The one or more words you entered coexisted in the following lines of the file:

3 4 7

Enter one or more words separated by spaces, or 'q' to quit: q

联系方式

最新辅导

热门辅导

您当前位置：首页 >> Python编程Python编程

代写data程序、代做Python代写编程、Python语言程序调试

日期：2020-12-04 09:23

相关文章