Loading...

Messages

Proposals

Stuck in your homework and missing deadline? Get urgent help in $10/Page with 24 hours deadline

Get Urgent Writing Help In Your Essays, Assignments, Homeworks, Dissertation, Thesis Or Coursework & Achieve A+ Grades.

Privacy Guaranteed - 100% Plagiarism Free Writing - Free Turnitin Report - Professional And Experienced Writers - 24/7 Online Support

Blackout crew ravers binge lyrics

19/11/2021 Client: muhammad11 Deadline: 2 Day

Java Algorithem

Programming Standards

When writing code for this course, follow the programming standards, available on this course’s website on UMLearn. Failure to do so will result in the loss of marks.

Objective

The objective of this assignment is to implement a spell checking program using hash tables and separate chaining.

Your Program

General Overview: Most spell checkers use hashing to determine if a given word in a document is correct (that’s why they can check your spelling as you type).

The Dictionary: First, you must set up a dictionary in which to look up words. When your program starts, use either JFileChooser or JOptionPane.showInputDialog or a Scanner object to allow the user to specify the dictionary file to load. (The dictionary file is words.txt, which can be found in the Content Browser on D2L with this assignment in an Assignment 3 folder under Assignments.) Read in the dictionary file. There is one word per line. Insert each word in the dictionary into a Table ADT.

Implement the Table ADT as follows:

• Use a hash table of size 94321 (a prime number that gives a load factor of about 0.5).

• Use separate chaining (in which each table slot is a (singly) linked list of nodes) to resolve collisions. Node words may be inserted at the front of the appropriate linked list.

• Use the polynomial hashing algorithm discussed in class to hash each word — use Horner’s method to compute the polynomial hash code and take the result of each operation mod the table size to avoid integer overflow. In Horner’s method, use a = 13 when evaluating your polynomial p(a).

Checking the spelling in a file: After you have read in the dictionary file and stored them in a table, you must check the spelling of all words in another file, a document file.

Again, use either JFileChooser or JOptionPane.showInputDialog or a Scanner object to allow the user to specify the document file to load. The file book.txt is provided for testing. This file contains multiple words per line. You are encourage to test against other document files.

For each word in the document file, perform a Table search to see if the word is in the dictionary. If a word isn’t present in the Table, then it is a spelling error (that is, a mis-spelled word). It should be pointed out that words.txt is not a very complete dictionary and so some words that are spelled correctly will be flagged as erroneous.

1

Once your program has process the document file, indicate the spelling errors by printing each mis-spelled word once. With each word, include the line numbers on which the word appears (in the order in which you found them). Note that a word can be mis-spelled multiple times on a single line. So an mis-spelled word might generate the following line in the output:

Invalid word "Michiko" found on lines 1 59 21 21

To keep track of mis-spelled words and on which lines they occur, use another hash table, known as the mis-spelled word table, to keep track of the mis-spelled words (and where they were found in the document):

• This hash table should have size 2797.

• An mis-spelled word will only be added to the mis-spelled word table if the word is not already in the mis-spelled word table. Thus, you must do a search for the word, and only add the word to the mis-spelled word table if it is not found.

• Each element of the mis-spelled word table will contain two things: a word and a queue of the line numbers on which this mis-spelled word was found in the document file. The queue of line numbers is an ordinary queue: line numbers are enqueued at the end of the queue. You may implement this as a linked list (of your choice).

• If a mis-spelled word is already in the table, simply add the new line number to the end of queue of line numbers for that word.

After the document file is completely processed, traverse the mis-spelled word table. For each mis-spelled word found in the table, print out both the word and the numbers of all lines on which it appeared (removing the line numbers one-by-one from the line number queue). Note that the output will likely be in alphabetic order, which is perfectly okay.

Suggestions

• The document file that you will read has punctuation that must be handled. You must ensure that no word is seen as error because it had punctuation attached to it. Note that an apostrophe is a valid part of a word and should not be considered punctuation. Punctuations other than apostrophe will split a word into two. Eg) Input abc-def becomes two words abc and def.

Suggestion: If String inLine is an input line from the document file, then the command nLine.trim().split( "[^a-zA-Z']+" ) splits the line into tokens using one or more characters that are NOT letters or an apostrophe as the splitting pattern (“^” means “not”). Try this on some sample strings to see what it does.

• Hashing "A" and "a" produces different values, but you would not expect them to be different words in a dictionary. To manage this difference, convert all text to all lower case when processing (this comment also applies to the dictionary words). This conversion simplifies things and makes the spell checker more reliable.

Suggestion: The helpful String method toLowerCase() will do the job for you and a good idea to do this as soon as an input is read in.

• You must organize you program into appropriate classes. You should have a class representing your hash table, a class representing a the data to be stored in the hash table, a class representing a queue, a class representing the data to be stored in your queue, and a main application class. You may have other classes if you need them.

2

• Do not have more than one hash table class. There should be one hash table class, that can be used for both the dictionary words and the mis-spelled words (of course you’ll need two hash table objects). The key is to make the class that holds your hash table data data flexible enough to handle both situations.

• Your data structures (hash tables, queues, etc.) should NOT contain any program logic specific for solving this program. Instead, they just should implement the standard features as discussed in class.

• Test your program using a small dictionary and document file first. Using small files along with small hash table sizes (say size=5) will allow you to quickly check if your code is working or not. A small dictionary file test-dict.txt is provided, along with a small document file test-file.txt.

Sample output: Your output should take the following form (note that this is not the output for the given data files):

There are a total of 10 invalid words:

Invalid "cant" found on lines 1

Invalid "pewter" found on lines 1

Invalid "turbine" found on lines 1

Invalid word "Michiko" found on lines 1 59 21 21

Invalid word "fortune" found on lines 1

Invalid word "fashionable" found on lines 3 5 9 11 11 13

Invalid word "Popcorn" found on lines 5 90 104

Invalid word "10" found on lines 7 139

Invalid word "sensei" found on lines 7 139

Invalid word "haberdasher" found on lines 9 13 13

Hand-in Instructions

Go to COMP2140 in UMLearn, then click “Dropbox” under “Assessments” at the top. You will find a dropbox folder called “Assignment 3”. Click the link and follow the instructions. Please note the following:

• Submit ONE .java file. The .java file must contain all the source code. The .java file must be named A3.java (e.g., A3Daimon1234567.java).

• Please do not submit anything else.

• We only accept homework submissions via UMLearn. Please DO NOT try to email your homework to the instructor or TAs.

• We reserve the right to refuse to grade the homework or to deduct marks if these instructions are not followed.

Honesty Declaration

Your Assignment 3 (and any other work in this course) may not be marked unless you have already handed in the blanket honesty declaration covering all of your term work.

Homework is Completed By:

Writer Writer Name Amount Client Comments & Rating
Instant Homework Helper

ONLINE

Instant Homework Helper

$36

She helped me in last minute in a very reasonable price. She is a lifesaver, I got A+ grade in my homework, I will surely hire her again for my next assignments, Thumbs Up!

Order & Get This Solution Within 3 Hours in $25/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 3 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

Order & Get This Solution Within 6 Hours in $20/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 6 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

Order & Get This Solution Within 12 Hours in $15/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 12 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

6 writers have sent their proposals to do this homework:

Top Essay Tutor
Write My Coursework
Professional Coursework Help
Top Class Engineers
Maths Master
Exam Attempter
Writer Writer Name Offer Chat
Top Essay Tutor

ONLINE

Top Essay Tutor

I can assist you in plagiarism free writing as I have already done several related projects of writing. I have a master qualification with 5 years’ experience in; Essay Writing, Case Study Writing, Report Writing.

$46 Chat With Writer
Write My Coursework

ONLINE

Write My Coursework

I have done dissertations, thesis, reports related to these topics, and I cover all the CHAPTERS accordingly and provide proper updates on the project.

$46 Chat With Writer
Professional Coursework Help

ONLINE

Professional Coursework Help

I am a PhD writer with 10 years of experience. I will be delivering high-quality, plagiarism-free work to you in the minimum amount of time. Waiting for your message.

$46 Chat With Writer
Top Class Engineers

ONLINE

Top Class Engineers

As per my knowledge I can assist you in writing a perfect Planning, Marketing Research, Business Pitches, Business Proposals, Business Feasibility Reports and Content within your given deadline and budget.

$41 Chat With Writer
Maths Master

ONLINE

Maths Master

I reckon that I can perfectly carry this project for you! I am a research writer and have been writing academic papers, business reports, plans, literature review, reports and others for the past 1 decade.

$24 Chat With Writer
Exam Attempter

ONLINE

Exam Attempter

This project is my strength and I can fulfill your requirements properly within your given deadline. I always give plagiarism-free work to my clients at very competitive prices.

$39 Chat With Writer

Let our expert academic writers to help you in achieving a+ grades in your homework, assignment, quiz or exam.

Similar Homework Questions

Lego the crisis case study - Discussion - Human resources proposal template - Good kings bad kings by susan nussbaum summary - Responses - Columnar transposition cipher in c - Fetal pig brain dissection - Nursing discussion - Celta assignment focus on the learner example - Week - 5 - Discussion - Legal Reg, Compliance and Invest - Policy/Regulation Fact Sheet - 66/18 cecilia street marrickville - Outdoor education center walton ne - Artemis fowl study guide - How many strings of eight uppercase english letters are there - Assessment 5 Instructions: Professional ePortfolio and Resume - Discussion post - 1950 bette davis film crossword - Great mosque of djenne khan academy - Car rental system project in c programming - Siemens rcr10 433 installation manual - University of indiana plagiarism test - Houston community college southeast - Deadly persuasion jean kilbourne pdf - Tradoc pam 525 8 2 - Greek mythology research project ideas - Similarities between memo and business letter - Mr happy burger elwood closing - Sullivan nicolaides holter monitor - Open area test site - Post its notes on a marriage sparknotes - Hoya double aspheric lenses - Nova power surge video worksheet answers - Lse msc international relations - Multifactor leadership questionnaire rater form - Python Programming - Al bhed primer locations - Frozen food business plan sample - Bsi teradata case of the misconnecting passengers - Psy 325 - 93 little hobart street welch wv - Help - Clothing waste facts australia - Critical Analysis Paper on Journals - Annotated Bibliography - Psychology: Informed Consent Form - RIVONIA ⓶[ ••• +2761O482071•••⓶⓶]@)) EARLY TERMINATION- PILLS FOR SALE IN RIVONIA PRETORIA WEST, MAFIKENG - Chartered accountants full membership - Hangman game source code in c++ - Landlord advice helpline victoria - Carol hathaway wedding dress - Interdisciplinary work - What were the most compelling topics learned in this course - Bcvr entries - WK 2 SOCW 6443: Assignment: Client Advocacy and Connecting Neurobiology to Psychopharmacological Interventions - Introduction to ethical theories a procedural approach pdf - Speech - Uses of duplicating machine - Excel guided project 4 3 - Hcf swimming lessons rebate - HLS685 A3 - Financial Management - Children's auditory performance scale - Joint venture agreement letter - Statistics chapter 10 using random numbers - Theories and techniques of counseling corey - Positive incentive theory of addiction - Short answer 110 - Nasm 75 day study planner pdf - Fence extensions mitre 10 - Sodium bicarbonate plus hydrochloric acid - Billy elliot scene analysis - research questions - At the first psychological clinic the patients were primarily - Isbn 10 1 305 38983 2 - SECURITY ARCHITECTURE AND DESIGN (ISOL-536-M31) PHD IN IT - Graph x less than or equal to 4 - Bus 475 week 5 final strategic plan and presentation - The matching principle requires businesses to record warranty expense - Persuasive speech on sleep - MGT - The duck group malaysia - Daddy poem analysis by stanza - Introduction to statistics and data analysis 3rd edition answer key - Trade support loan payments - Area 20 parking sydney - Girl in hyacinth blue chapter 6 summary - Sap solution manager test suite training - Benchmark patient's spiritual needs case analysis - Inserting a node into a sorted doubly linked list python - 521 Week 5 Field Activity Paper - Graves and corcoran nursing informatics - Comparison of the DNP and PhD Roles in Nursing - Specific volume of refrigerant 134a - Did information systems cause deutsche bank to stumble - Class e induction motor - Discussion needed by Thur by 5pm - Another one bites the dust superbowl commercial - Nanda nursing care plan for renal calculi - Vintage fun reproduces old fashioned style roller skates and skateboards