Chapter

Exercises

From ComputerScienceOne by Dr Chris Bourke

Concepts

1. How can file input/output programs process text, binary data, and word searches?

   "There are additional performance issues when reading/writing the data and converting binary numbers to their string representations. With binary data no such parsing is necessary. As long as the data

2. How can file-processing programs solve dictionary matching, bridge scoring, Sudoku validation, and CSV conversion?

   "Exercise 9.6. Write a crossword puzzle cheater. The program will take, as input, a “partial” word in a crossword puzzle. That is, some of the letters are known (from other solved clues) while some of

3. How does a Borda-count program process ranked election ballots?

   "Exercise 9.10. Ranked voting elections are elections where each voter ranks each candidate rather than just voting for a single candidate. If there are n candidates, then each voter will rank them 1

4. How can programs analyze DNA n-gram frequencies and subsequence occurrences?

   "Exercise 9.11. A DNA sequence is a sequence of some combination of the characters A (adenine), C (cytosine), G (guanine), and T (thymine) which correspond to the four nucleobases that make up DNA. Gi