Peer-graded Assignment: Reading & Writing Pseudocode /AN
Project Title
Question #1. Below is the pseudocode that we saw in the previous lesson for the linear search algorithm:
1. for each item in list
2. if item = target
3. then output: true
4. stop
5. output:false
Rewrite this pseudocode so that, instead of indicating whether or not the target was found in the list, the output is the number of occurrences of the target. For instance, if list were {8, 3, 5, 1, 3, 9, 2, 8, 3, 3} and target were 3, then the output should be 4, since the number 3 occurs four times in the list.
The pseudo code above uses <- as assignment operators for this assessment.
In your answer, please use underscores (“_”) to indent lines.
Question #2. Below is the flowchart for the “find two smallest” algorithm that we saw in a previous assignment. The algorithm identifies the two smallest items in the collection by making one pass through the collection and keeping track of the two smallest values seen so far:
1. Initialize the two smallest values so far to be the first two items of the list
2. For each remaining value in the list: if the value is smaller than either of the two smallest so far, replace the larger of the two
In this case, the input is a list of items and the outputs are min1 and min2, which are the two smallest items, not necessarily in that order.
Write the pseudocode for this algorithm, based on the flowchart. As before, you can assume that the list contains at least two items and that all items are distinct. For this question, use a 0-based index for accessing individual items of the list, e.g., the first item is {list_0}list0 or list[0].
Hint: Review the pseudocode for algorithms and flowcharts we’ve previously seen, e.g., for the find-max algorithms, and see which patterns occur in those flowcharts and in this one. Also, keep in mind that not every instruction in the flowchart corresponds to exactly one instruction in the pseudocode: in some cases, there may not be a pseudocode instruction for something that appears in the flowchart; in others, it may be the case that one instruction in the flowchart can occur twice in the pseudocode if there are two ways to get to it.
