I’m continually amazed when I discover some aspect of the C programming language that I’ve not encountered before. This time, the trick is how to initialize individual array elements.
Continue reading →

Scanning the digital dictionary is fun, but it’s gone on way too long! I was going to end this series with code that solves the Spelling Bee game, but decided to end things with this Lesson. This final post scans the dictionary for words that match a given clutch of characters.
Continue reading →

I introduced the pangram concept in last week’s Lesson. The code demonstrated how to locate 7-letter words where no letter repeats, based on the online game Spelling Bee. But a pangram need not be limited to just seven letters.
Continue reading →

I’m a fan of the online game Spelling Bee. In this game, you use a combination of seven letters to spell various words. Each word is at least four-letters long and must contain a special letter, shown in the center of Figure 1. When you create a word that contains all seven letters, you’ve discovered a pangram.
Continue reading →

Not all the nasty words are four letters long, but a good chunk of them are. If you ran the program from last week’s Lesson, you can quickly check the computer’s dictionary for the words you once couldn’t say on TV, gleefully typing them in and confirming that they exist in the dictionary. But how many four letter words are there?
Continue reading →

At the basic level, a spell-checker works as a simple comparison program: The word in question is compared with each word in the dictionary. When the source word isn’t found, it’s assumed to be misspelled. With a dictionary file on your computer, it’s easy for a C programmer to code this type of program.
Continue reading →

It’s time for your computer to babble nonsensically. No alcohol is necessary. All you must do is pluck out a random word from the dictionary. Run the program several times and you have babbly nonsense: subtotal spectacles lute's sushi's. Brilliant! *HIC*
Continue reading →

Beyond knowing how many words are in the computer’s dictionary, another good measure to know is how many characters are in the longest word. Together, these two values give you a profile for the complete word matrix.
Continue reading →

I admit it: I’m a nerd and I read the dictionary. I know it’s a reference, not a work of fiction. The plot is weak. But I found it enjoyable as a kid to discover new words and their meanings. Alas, the Unix dictionary file lists only words and not definitions. But how many words are in there?
Continue reading →

My first Unix System Administrator job was pretty routine: I did backups. It was only later that I discovered some of the many nerdy treasures available in that operating system.
Continue reading →