Given a list of scores and a passing score, you are asked to find out the number of scores which are equal to or higher than the passing score, the lowest score, and the highest score. For examples, if the list of scores is as follows: 46, 58, 55, 43, 89, 93, 77, 82, 99, 64; and if the passing score is 60, then the answers should be 6, 43 and 99. Implement the above task using MIPS. Initialize the array of scores in memory using any integer values between 0 and 100. The passing score should be obtained from user’s input and the answer must be printed out.

Given a list of scores and a passing score, you are asked to find out the number of scores which are equal to or higher than the passing score, the lowest score, and the highest score. For examples, if the list of scores is as follows: 46, 58, 55, 43, 89, 93, 77, 82, 99, 64; and if the passing score is 60, then the answers should be 6, 43 and 99. Implement the above task using MIPS. Initialize the array of scores in memory using any integer values between 0 and 100. The passing score should be obtained from user’s input and the answer must be printed out.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Task 1: In ocean navigation, locations are measured in degrees and minutes of latitude and longitude. Thus if you’re lying off the mouth of Papeete Harbor in Tahiti, your location is 149 degrees 34.8 minutes west longitude, and 17 degrees 31.5 minutes south latitude. This is written as 149°34.8’ W, 17°31.5’ S. There are 60 minutes in a degree. (An older system also divided a minute into 60 seconds, but the modern approach is to use decimal minutes instead.) Longitude is measured from 0 to 180 degrees, east or west from Greenwich, England, to the international dateline in the Pacific. Latitude is measured from 0 to 90 degrees, north or south from the equator to the poles. Create a class angle that includes three member variables: an int for degrees, a float for minutes, and a char for the direction letter (N, S, E, or W). This class can hold either a latitude variable or a longitude variable. Write one member function to obtain an angle value (in degrees and minutes) and a direction…
Algorithm Analysis Start with 102 coins on a table, 98 showing heads and 4 showing tails. There are two ways to change the coins: • flip over any ten coins, or • place n+ 1 additional coins, all showing tails, on the table where n is the number of heads currently showing on the table. For example, you might begin by flipping nine heads and one tail, yielding 90 heads and 12 tails, then add 91 tails, yielding 90 heads and 103 tails. (a) Model this situation as a state machine, carefully defining the set of states, the start state, and the possible state transitions. (b) Optionally, explain how to reach a state with exactly one tail showing. (c) Consider the following derived variables: C ::= the number of coins on the table H ::= the number of heads on the table T::= the number of tails on the table C, ::= parity (C) H2 ::= parity(H) T2 ::= parity(T) Here the parity : Z → {0,1} function is defined as parity(n) = 0 when n is even and 1 otherwise. Which of these variables is strictly…
with T=4, n=12 and A=(3,5,8,8,9,16,29,41,50,63,64,67). Draw the corresponding walkthrough as shown
Correct answer will be upvoted else downvoted. Computer science. You have two positive integers an and b. You can perform two sorts of tasks: a=⌊ab⌋ (supplant a with the integer part of the division among an and b) b=b+1 (increment b by 1) Track down the base number of activities needed to make a=0. Input The primary line contains a solitary integer t (1≤t≤100) — the number of experiments. The main line of the depiction of each experiment contains two integers a, b (1≤a,b≤109). Output For each experiment, print a solitary integer: the base number of activities needed to make a=0.
The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid's algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner: 1. Compute the remainder of dividing the larger number by the smaller number. 2. Replace the larger number with the smaller number and the smaller number with the remainder. 3. Repeat this process until the smaller number is zero. The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD. An example of the program input and output is shown below: Enter the smaller number: 5 Enter the larger number: 15 The greatest common divisor is 5
The pandigital number contains all digits (0-9) at least once. Write a task that takes a whole number, and returns the truth if the number is pandigital, and false in some way. Examples isPandigital (98140723568910) is true isPandigital (90864523148909) → false // 7 is missing. isPandigital (112233445566778899) Answer in java script → false
The pandigital number contains all digits (0-9) at least once. Write a task that takes a whole number, and returns the truth if the number is pandigital, and false in some way. Examples isPandigital (98140723568910) → is true isPandigital (90864523148909) → false // 7 is missing. isPandigital (112233445566778899) → false in Ruby
In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once. Example is in the image below. The problem: Input: an integer followed by the maze. Output: total number of unique steps. (no need to print the unique steps) Task: Design an algorithm in pseudocode to print the total number of unique steps using a backtracking algorithm.
In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once. Example: The problem: ➢ Input: an integer followed by the maze. ➢ Output: total number of unique steps. (no need to print the unique steps) ➢ Task: Design an algorithm in pseudocode/code to print the total number of unique steps using a backtracking algorithm.
Bob is playing a game. He and his team have come up with a plan to throw a ball so that it can hit the target object. The target is at a distance of X meters from Bob. He is at a height of Y meters from the ground and the target is at a height of Z meters from the ground. Bob can throw the ball with a certain speed Task Determine the speed that he should throw the ball. Notes He is aiming at an angle parallel to the ground. Assume acceleration due to gravity is 10m/s² Example Assumptions • X = 2 • Y=5 • Z=2 Approach It can be calculated that he needs to fire at speeds 2.58m/s at an angle parallel to the ground respectively. The answers are taken up to 2 decimal places only. Hence, the answer is 2.58 m/s. Function description Complete the solve function provided in the editor. This function takes the following 3 parameters and returns the minimum speed required: • X Represents an integer denoting the distance of the target from Bob • Y Represents an integer denoting the height of Bob…
Q15. * After performing the operations: dequeue(), dequeue(), enqueue('S'), the value of Front becomes ........ 4 O 1 O 3 O 2 0 E Front 1 X 2 A 3 M Rear 4
In the classic problem FizzBuzz, you are told to print the numbers from 1 to n. However,when the number is divisible by 3, print "Fizz''. When it is divisible by 5, print "Buzz''. When it isdivisible by 3 and 5, print"FizzBuzz''. In this problem, you are asked to do this in a multithreaded way.Implement a multithreaded version of FizzBuzz with four threads. One thread checks for divisibilityof 3 and prints"Fizz''. Another thread is responsible for divisibility of 5 and prints"Buzz''. A third threadis responsible for divisibility of 3 and 5 and prints "FizzBuzz''. A fourth thread does the numbers