If their mark sheets are Fifty students in a class appeared in their final examination. The division column of their mark sheets contains the division (FIRST, SECOND, THIRD, or FAIL) obtained by them. available with you, write an algorithm to calculate and print the total number FIRST division. of students who passed in

If their mark sheets are Fifty students in a class appeared in their final examination. The division column of their mark sheets contains the division (FIRST, SECOND, THIRD, or FAIL) obtained by them. available with you, write an algorithm to calculate and print the total number FIRST division. of students who passed in

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

dont copy else downvote
Exams.cpp) Suppose a teacher weights the fourexams he gives 10%, 25%, 30%, and 35%. Write a programthat reads ten sets of four grades, prints the weightedaverage of each set, and prints the unweighted average ofeach test. The number of students should be in a globalconstant.
The price of 2 liters of milk was R14.99 in 2014. Using a rate of inflation of 6.3% per year, calculate and print each year since 2014 to 2020 with the price of milk in that year, up to and including 2020. Which of the following algorithms will solve this problem statement? Select one: a.DeterminePriceIncrease price = 14.99 for k = 2014 to 2020 display “Year: “, k, “ price: R”, price price = 14.99 * 0.063 next k end b.DeterminePriceIncrease for k >= 2020 display “Year: “, k, “ price: R”, price price = price * 1.063 next k end c.DeterminePriceIncrease for k = 2014 to 2020 display “Year: “, k, “ price: R”, price price = 14.99 * 1.063 next k end d.DeterminePriceIncrease price = 14.99 for k = 2014 to 2020 display “Year: “, k, “ price: R”, price price = 14.99 * 1.063 next k end
A men and women's assignment can be created using the postponed acceptance procedure. Members of one gender act as suitors in this algorithm, while members of the opposite gender act as suitees. Every suitor whose proposal was rejected in the previous round makes a proposal to his or her highest-ranking suitee who has not yet rejected this suitor in the algorithm's sequence of rounds. Except for the suitor who ranks highest among all the suitors who have proposed in this round or prior rounds, the suitees reject all the proposals. This highest ranking suitor's proposal is still pending and will be rejected if a more alluring suitor makes a proposal in a later round. The series of rounds ends when every suitor has exactly one pending proposal. All pending proposals are then accepted.a) Write the deferred acceptance algorithm in pseudocode.b) Show that the deferred acceptance algorithm terminates.c) Show that the deferred acceptance always terminates with a stable assignment
int is total, not totalthat
Celebrity problem A celebrity among a group of n people is a person who knows nobody but is known by everybody else. The task is to identify a celebrity by only asking questions to people of the form: ”Do you know him/her?” Solution Select two people from the group given, say, A and B, and ask A whether A knows B. If A knows B, remove A from the remaining people who can be a celebrity; if A doesn’t know B, remove B from this group. Solve the problem recursively for the remaining group of people who can be a celebrity Which design strategy does the following solution use? A-)Decrease-by-a-constant factor algorithm B-)Variable-size-decrease algorithm C-)Decrease-by-a-constant algorithm D-)Divide-and-Conquer
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: Compute the remainder of dividing the larger number by the smaller number. Replace the larger number with the smaller number and the smaller number with the remainder. 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 accompanying Homeownership spreadsheet contains a partially completed spreadsheet model for computing the monthly costs of home ownership. Complete the spreadsheet model by inserting the formulas for monthly mortgage payment, monthly property tax, monthly homeowner insurance premium, monthly maintenance costs , and total in the appropriate cells. Variables: House value: $ 450,000.00 Interest rate: 4.25% Down payment (% of house value): 20% Number of years: 30 Property tax rate: 1.25% Annual homeowner insurance premium: $ 1,400.00 Maintenance cost rate (% of house value): 1% Monthly Cost of Home Ownership Monthly mortgage payment: Monthly property tax: Monthly homeower insurance premium: Monthly maintenance costs: Total: 1. Is this a deterministic or stochastic model? 2. Which of the following is NOT an input of the spreadsheet model? A. Interest rate B. Monthly mortgage payment C. Number of years of…
To answer the following please use the first picture for the reference to solve the prefinal task 2.
Addition Rule Product Rule Log Exponent Rule Log Base Rule Transitivity In the following section, indicate what reference function (g(x)) we should use when attempting to prove that f(x) is O(g(x)). Use the rules and reference functions above to guide you. f(x)=n+log2n f(x)=n2+log n4 f(x)=n2∗n3 f(x)=n5/n2 f(x)=n∗(log n)∗n f(x)=n+n log n+log n
Question 2.1 Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by twoto get a new value for N If N is an odd number, then multiply N by 3 and add 1to get a new value for N. Continue to generate numbers in thisway until N becomes equal to 1 For example, starting from N = 3 the complete ’3N+1’ sequence would be: 3, 10, 5, 16, 8, 4, 2, 1 Write code to ask the user to enter a positive integer (N)in the main()function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that was received (entered by the user). The function must also count and return the numbers that the sequence consists of. Thereturned value must be displayed from the main() function. Question 2.2 Write a function createPassword()with no return value to randomly select 8 capital letters from the alphabet. The function receives the address of the first characters of the…
PYTHON QUESTION : The Syracuse sequence of an integer N is the sequence of integers starting with the term N, where each following term is half of the preceding term if it is even, and one plus three times the preceding term if it is odd. The sequence ends when it reaches the integer 1. The maximum of the Syracuse sequence of an integer N is the highest number reached by this sequence. This maximum can sometimes be very high compared to the starting integer N. What is the maximum of the Syracuse sequence of 3428767? To answer this question it is useful to modify the code given in demonstration which calculates the Syracuse sequence. The code given in the demo : n = 27 print(n) while n != 1: if n%2 == 0: n = n // 2 # where n //= 2 or n >>= 1 else: n = 1 + 3*n print(n)