Show Bid Request dictionary Bid Request Id: 29643 Bookmark in my 'To Do' list Posted by: amerelkhatib (4 ratings) (Software buyer rating 10) Non-action Ratio: Very Good - 0.00% Buyer Security Verifications: Good Approved on: Oct 2, 2002 11:57:49 PM EDT Bidding Closes: Oct 7, 2002 12:15:16 AM EDT Viewed (by coders): 255 times Deadline: 10/7/2002 TIME EXPIRED Phase: 100% of work completed and accepted. Coder has been paid. Max Accepted Bid: Bidding is closed Project Type: Personal Project / Homework Help Bidding Type: Open Auction Categories: C++ / C Enter chat room for this bid request (0 active users at Sep 29, 2003 2:50:37 AM EDT) Description: Problem Statement The idea of a dictionary is fundamental to many programming applications, including spell-checkers for editors and word processing, code breaking, compilers, and much more. In its most general form, a dictionary can be more than just a list of words and definitions in a natural language; for example, the FORTH language uses a dictionary to store all built-in and user-defined functions (which it calls "words"). In this case, the dictionary has a default membership (the built-in words) and can be expanded as new "words" are defined. Another example "dictionary" is a router for the Internet, which takes incoming messages over the network and determines where they should go next in order to get to the proper destination. Finding an efficient way to represent large dictionaries will be one of our tasks this quarter. Not every container class we study will be appropriate as a dictionary, but we will see several which are and should spend some time comparing implementations of these types to see which perform well. To start, we can think about using a simple list class based on the linked list representation. Let's assume a spell checker application. Typically, a program which uses a such a dictionary loads its word lists from files at startup time, or as needed when it executes. This implies that part of the code executing after the program loads is opening data files and reading the information in those files into lists in memory. Assuming the information is sorted (in this case, in alphabetical order), then simply adding each item to the end of a list retains the sorting. On the other hand, the list will get quite large. After the dictionary information has been read, the rest of the operations run on the dictionary will primarily be searches, or lookups. The user wants these searches to be as fast as possible. Occasionally the program might be asked to add something to the dictionary, but this is rare. For example, there may be jargon or technical words in a document which the user wants the spell checker to recognize, but aren't in the default dictionaries. The user should be able to add such words (either temporarily or permanently) to the spell checker's dictionary. In any event, the fastest operation on a dictionary should be the search. For a dictionary containing thousands of words, searching a linked list linearly will potentially require thousands of comparisons. Binary search is faster, but difficult to Deliverables: 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. Platform: windows XP with internet explorer Must be 100% finished and received by buyer on: Oct 7, 2002 EDT Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date. Special Conditions / Other: NOTE: i have the starter code which could be helping Additional Files: This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding. Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements. We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation. If you notice a violation please help out the site and report it. Thanks for your help.   Bidding/Comments: All monetary amounts on the site are in United States dollars. Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. See all rejected bids (and all comments) Name   Bid Amount    Date   Coder Rating   This bid was accepted by the buyer! Alex K (61 ratings) in N-Novgorod, N-Novgorod Russian Federation Bid id: 331,868   $25 (USD) Oct 3, 2002 5:45:34 AM EDT  9.84 (Excellent)     Hi. I researched very carefully your assignement. It is simple and straight forward. I'd be glad to do this task for you. I've over 6 years experience programming in C++. I've already done array sorting, binary search (you'll find it in my portfolio). I will follow the specifications exactly. It can be finished in a day. Good luck to you in this project. Sincerely, Alex.