void dump(char *buf, int size) { // recreate the hexdump output = int lines (int)ceil(size / 16.0); int lineLength = 16; for (int i = 0; i < lines; i++) { char *start = =&buf[i* 16]; if (size % 16 != 0 && i == lines -1) { lineLength = size % 16; } printf("%08x", offset); offset += 16; for (int j=0; j < lineLength; j++) { printf("%02x", (unsigned char)start[j]); if (j == 7) { printf(" "); } printf(" ["); for (int j = 0; j < lineLength; j++) { if (start[j] >= 32 && start[j] <= 126) { printf("%c", start[j]); } else { printf("."); } } printf("\\n"); } } // compile with gcc rec2.c -lm // run with ./rec2 rec2.c #include #include #include #include #include const int BUF_SIZE = 256; void dump(char *buf, int size); unsigned int offset = 0; int main(int argc, char **argv) { // open the file int fd, count; char buf[BUF_SIZE]; if (argc != 2) { } fprintf(stderr, "Usage: %s \n", argv[0]); exit(1); fd = open(argv[1], O_RDONLY); if (fd < 0) { perror("open failed"); exit(1); } } // read chunks while ((count = read(fd, buf, BUF_SIZE)) > 0) { } dump(buf, count); if (count < 0) { perror("read failed"); exit(1); } close(fd);

Instructions in python: Create a compression algorithm that will compress the text "nnneennwnneeeennwwnneeeessseeenneeesswsswwwsssswww" in the parchment piece into a smaller form. The algorithm must include simple instructions of no more than 1 or 2 sentences. It is recommended that you use basic ASCII characters, as the focus here is the algorithm rather than the physical space occupied by the result. Create a copy of this spreadsheet to organize your results and calculate the compression ratios. After working for about 10 minutes, you can access a clue: 2D Map. After another 10 minutes, you can view the 2D Map with Terrain. There are many correct answers to this exercise.