Skip to main content

C# Program to write Class average with counter-controlled repetition.

Photo by Startup Stock Photos from Pexels

The class average is equal to the sum of the grades divided by the number of students. The
algorithm for solving this problem on a computer must input each of the grades, perform
the averaging calculation and display the result.



1 //
2 // Class average with counter-controlled repetition.
3
4 usingSystem;
5
6 classAverage1
7 {
8 static voidMain( string[] args )
9 {
10   inttotal,  // sum of grades
11 gradeCounter,  // number of grades entered
12 gradeValue,  // grade value
13 average;  // average of all grades
14
15 // initialization phase
16 total = 0;  // clear total
17 gradeCounter = 1;  // prepare to loop
18
19 // processing phase
20   while( gradeCounter <= 10)  // loop 10 times
21 {
22   // prompt for input and read grade from user
23 Console.Write( "Enter integer grade: ");
24
25   // read input and convert to integer
26 gradeValue = Int32.Parse( Console.ReadLine() );
27
28   // add gradeValue to total
29 total = total + gradeValue;
30
31   // add 1 to gradeCounter
32 gradeCounter = gradeCounter + 1;
33 }
34
35 // termination phase
36 average = total / 10; // integer division
37
38 // display average of exam grades
39 Console.WriteLine( "\nClass average is {0}", average );
40
41 } // end Main
42
43 }// end class Average1

Comments

Popular posts from this blog

40 Redis interview questions for 2021 - 2022

  Redis interview questions 1.What is Redis?. 2. What is the data type of Redis? 3. What are the benefits of using Redis? 4. What are the advantages of Redis over Memcached? 5. What are the differences between Memcache and Redis? 6. Is Redis single-process and single-threaded? 7. What is the maximum storage capacity of a string type value? 8. What is the persistence mechanism of Redis? Their advantages and disadvantages? 9. Redis common performance problems and solutions: 10. What is the deletion strategy of redis expired keys? 11. Redis recycling strategy (elimination strategy)? 12. Why does edis need to put all data in memory? 13. Do you understand the synchronization mechanism of Redis? 14. What are the benefits of Pipeline? Why use pipeline? 15. Have you used Redis cluster? What is the principle of cluster? 16. Under what circumstances will the Redis cluster solution cause the entire cluster to be unavailable? 17. What are the Java clients supp...

8 common methods for server performance optimization

  1. Use an in-memory database In-memory database is actually a database that puts data in memory and operates directly. Compared with the disk, the data read and write speed of the memory is several orders of magnitude higher. Saving the data in the memory can greatly improve the performance of the application compared to accessing it from the disk. The memory database abandoned the traditional way of disk data management, redesigned the architecture based on all data in memory, and made corresponding improvements in data caching, fast algorithms, and parallel operations, so the data processing speed is faster than that of traditional databases. Data processing speed is much faster.       But the problem of security can be said to be the biggest flaw in the memory database. Because the memory itself has the natural defect of power loss, when we use the memory database, we usually need to take some protection mechanisms for the data on the memory in advance, such...

Recursion-maze problem - Rat in the Maze - Game

  package com.bei.Demo01_recursion; public class MiGong {     public static void main(String[] args)  {         //First create a two-dimensional array to simulate the maze         int [][]map=new int[8][7];         //Use 1 for wall         for (int i = 0; i <7 ; i++) {             map[0][i]=1;             map[7][i]=1;         }         for (int i = 0; i <8 ; i++) {             map[i][0]=1;             map[i][6]=1;         }         //Set the bezel         map[3][1]=1;         map[3][2]=1;         //Output         for (int i = 0; i <8 ; i++) {             for (int j = 0; j ...