Computer Science Illuminated
Computer Science Illuminated
7th Edition
ISBN: 9781284155617
Author: Nell Dale, John Lewis
Publisher: Jones & Bartlett Learning
bartleby

Concept explainers

Question
Book Icon
Chapter 7, Problem 61E
Program Plan Intro

a.

Top-down design for calculating the average of ten test scores:

From the problem 54,

  • Assign value to the given variables.
  • Perform loop iteration for 10 times.
    • Get the input from user.
    • Compute the sum of 10 test scores.
    • Increment the value of counter.
  • Finally, find the average of 10 scores.

Example:

The example code for calculating average of ten scores is given below:

//Initialize count to 0

Set count to 0           

//Initialize total to 0

Set total to 0         

//Performs iteration for 10 times

WHILE (count < 10)   

    //Read the scores

    Get mark

    //Compute sum of test score

    Set total to total + mark

    //Performs increment for count

    Set count to count + 1

//Print the result of average

Set average to total/10      

Explanation:

The above code is used for calculating the average of ten scores using “WHILE” loop. In “WHILE” loop, the addition will perform until the score become greater than “10”.

Program Plan Intro

b.

Top-down design for calculating the average of an unknown number of test scores:

  • Assign value to the given variables.
  • Performs iteration for n times.
    • Get the input.
    • Compute the sum of test scores for n scores.
    • Increment the value of counter.
  • Finally, determine the average of test scores.

Example:

The example code for calculating average of unknown number of scores is given below:

//Initialize count to 0

Set count to 0

//Initialize total to 0

Set total to 0      

//Performs iteration for n times

WHILE (number of scores)

    //Read the scores       

    Get mark 

    //Compute sum of test score    

    Set total to total + mark

    //Performs increment for count

    Set count to count + 1

//Print the result of average

Set average to total / count

Explanation:

The above code is used to compute the sum of score for “n” values using “WHILE” loop. In “WHILE” loop, the addition will perform until the score becomes greater than “n”.

Blurred answer
Students have asked these similar questions
Please answer JAVA OOP problem below: You are working at a university that tracks students. Each student is identified by their name and faculty advisor. Each faculty advisor is identified by their name, department, and maximum number of students they can advise. Using solid OO design principles, create a modular program that implements all the classes for the problem and also creates an implementation class that gathers user input for one student and then prints out the information gathered by creating the appropriate data definition and implementation classes. All data must be validated.    I have given the code so far: Implementation: import javax.swing.JOptionPane; public class Implementation {     public static void main(String[] args) {         FacultyAdvisor facultyAdvisor = new FacultyAdvisor("Sharmin Sultana", "IT", 30);         Student student = new Student("John", facultyAdvisor);         JOptionPane.showMessageDialog(null, student.toString());     } }   Student: public…
Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head { NULL) return 0;B = first; while (head->next != NULL) { if (head == first) { return 1; } head head->next; } return 0; void test_11_has_cycle() { int i; node nodes [6]; for (i = 0; i < 6; i++) nodes [i] .next = NULL; nodes [i].value i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next = & nodes [4]; nodes [4] .next = NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it hass cycle\n\n", 11_has_cycle (&nodes [0]) ?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…
checkpoint exercice for my students for Amortized Analysis
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education