logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

he third project is a combinatoric problem concerning the words given in sgb words.txt

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Project Three: Packing Words in Bins 

The Problem To Solve 

The third project is a combinatorial problem concerning the words given in sgb-words.txt that contains 5757 five-letter English words, sorted by their frequency of actual use. 

Given a list of suitably randomly chosen words from this dataset, (the automated tester will choose these words for each run) for example 

upset, abaci, ahold, runty, bones, kulak, mange, jerky, crook, frisk, pulse, frump, harpy, paste, poles, knows, musks, ensue, wahoo, gouts, elide, paced, terns, hewer, fault, stave, train, yukky, fluky, leash, chuff, fined, glyph, enema, shrub, blend, chant, fungo, genii, midst, dolly, deism, grook, couch, spina, torsi, estop, mylar, rigid, ichor 

your task is to pack these words into separate "bins" under the constraint that no two words in the same bin may have the same letter in the same position anywhere. For example, the words frump and gouts cannot go in the same bin, since both have the same letter u in the middle position. Under this constraint, the previous fifty words can be packed into seven separate bins using, for example, the following arrangement, one of the exponentially many equally valid arrangements possible. (Packing of these words into only six bins turns out to be impossible within the constraints of this problem.) 

Bin 1: [bones, fluky, paste, leash, kulak, ahold, estop, spina] Bin 2: [pulse, fined, gouts, jerky, crook, abaci, enema] Bin 3: [poles, fault, runty, deism, grook, ensue, blend] Bin 4: [mange, frisk, terns, dolly, upset, chuff, rigid, glyph, ichor] Bin 5: [fungo, paced, torsi, elide, chant, knows, mylar] Bin 6: [musks, frump, harpy, genii, stave] Bin 7: [couch, yukky, hewer, midst, wahoo, train, shrub] 

Only the total number of bins used to achieve the packing arrangement matters; how evenly the words are distributed into these bins is irrelevant. (In practice, minimizing the number of bins tends to create roughly equally sized bins.) 

An equivalent but more computer science-y way to phrase this problem would be to ask for a minimum vertex colouring in the SGB word graph where two word vertices are connected by an edge if and only if those words share the same letter in at least one position.

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

641 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

587 Answers

Hire Me
expert
Husnain SaeedComputer science

979 Answers

Hire Me
expert
Atharva PatilComputer science

506 Answers

Hire Me

Get Free Quote!

345 Experts Online