Name your shell scripts/C++ programs as the following table shows and put them together into one directory. Make sure that the folder  contains  only these  source {les   * .cpp) and no other {les. Compress this directory as a [uid] .zip {le where [uid] is your university number and check carefully that the correct {les have been submitted.

You are advised to prepare the zip {le on the standard environment, then transfer the zip {le to your own machine through FTP and submit it on Moodle. You should not transfer content of your {les through copy-and-paste as the process is error prone. We suggest you to download your submitted {le from Moodle, extract them, and check for correctness.  You  will  risk  receiving  0  marks  for  this  assignment  if  you  submit  incorrect/incomplete  {les. Resubmission after the deadline is not allowed.

Late submission

If submit within 3 days after the deadline, there will be 50% mark deduction. After that, no mark.

Evaluation

Your code will be auto-graded for technical correctness. In principle, we use test cases to benchmark your solution, and you may get zero marks for not being able to pass any of the test cases. Normally partial credits will not be given for incomplete solution, as in many cases the logic of the programs are not complete and an objective assessment could be diycult. However, your work may still be considered on a case-by-case basis during the rebuttal stage.

Academic dishonesty

We will be checking your code against other submissions in the class and from the Internet for logical redundancy. Please be reminded that no matter whether it is providing your work to others, assisting others to copy, or copying others will all be considered as committing plagiarism, and we will follow the departmental policy to handle such cases. Please refer to the course information notes for details.

Use of generative AI tools, like ChatGPT, is not allowed for the assignment.

Getting help

You are not alone! If you {nd yourself stuck on something, post your question to the course forum. We want this assignment to be rewarding and instructional, not frustrating and demoralizing. But we don’t know when or how to help unless you ask.

Discussion forum

Please be careful not to post spoilers. Please don’t  post any code that is directly related to the assignments. However, you  are welcome and encouraged to discuss general ideas on the discussion forums. If you have any questions about this assignment you should post them in the discussion forums.

Problem 1: Count Substring Matches

Write a shell script that takes two command line arguments substring and file. It will count the words that contains substring in file and produce the result.

Input:

The shell script does not read input from user. However, it expects two command line arguments substring and file.

Output:

The script should list all words found, with the number of occurrences of that word in file. Refer to the sample outputs for the exact format.

The words should be listed in descending order of the number of occurrences. For words with the same number of occurrences, they should be listed in ascending order of their ASCII values.

The script should output nothing when there are fewer than two command line arguments speci{ed or when the file does not exist.

Assumptions:

The command line argument substring contains alphabets only. There will be no digits, symbols, or whitespace characters in substring.

file, ifexists, is a plaintext {le and is readable by all user.

Requirements:

For this question, a word is bounded by spaces or symbols, or by line boundaries (i.e., start of a line or end of a line). For example, the string Gutenberg(TM) 's should be treated as three words Gutenberg, TM, and s.

Substring matching should be case insensitive. E.g., searching for tale should {nd TALE and tale.

On the other hand, when counting the number of occurrences of a word, it should be done in a case-sensitive manner. E.g., TALE and tale should be counted separately.

Notes:

A {leebook .txt is provided for testing. A dixerent {le maybe used when grading your work. Study the man page of grep and sort to learn about possible options to use for this task.

As |ag -Bw will be used when grading your work (refer to How to use the sample testcases above), there is no need to follow the exact amount of leading spaces shown in the sample outputs.

Sample Test Cases

1_1

Command: ./1 .sh  tale  ebook .txt

Output:

1_2

Command: ./1 .sh  time  ebook .txt

Output:

1_3

Command: ./1 .sh  jerry  ebook .txt

Output:

1_4

Command: ./1 .sh  pokemon  ebook .txt

Output: (it's empty)

Problem 2: Dictionary Lookup

Write   a   shell   script   that   reads   one   word   from   the   user   and   {nd   all   words   in   the   system   dictionary /usr/share/dict/words that start with the input word.

Input:

The shell script reads one word from user.

Output:

The script should list all words found in the same order as they are listed in the dictionary.

When listing the words found, the matching part should be highlighted by wrapping it around two asterisks  *). Refer to the sample outputs for the exact format.

Assumptions:

The input will always be one single word that contains alphabets only.

Requirements:

All matching should be case insensitive.

Notes:

The system dictionary /usr/share/dict/words may contain a dixerent list of words in dixerent systems. Your work will be graded using the dictionary on the academy server.

Sample Test Cases

2_1

Input:

Output:

2_2

Input:

Output:

2_3

Input:

Output: