In this program, I am using the school-based grading system and the program should accept the subject and the number of students.
Program approach:-
- Using the necessary header file.
- Using the standard I/O namespace function.
- Define the main function.
- Declare the variable.
- Display enter obtain marks in 5 subjects.
- Return the value.
Program:-
//header file
#include<iostream>
//using namespace
using namespace std;
//main method
int main()
{
//declare variable
int j;
float mark, sum=0, a;
//display enter obtain marks in 5 subjects
cout<<"Enter Marks obtained in 5 Subjects: ";
for(j=0; j<5; j++)
{
cin>>mark;
sum = sum+mark;
}
a = sum/5;
//display grade
cout<<"\nGrade = ";
if(a>=91 && a<=100)
//display a1
cout<<"a1";
else if(a>=81 && a<91)
//display a2
cout<<"a2";
else if(a>=71 && a<81)
cout<<"b1";
else if(a>=61 && a<71)
cout<<"b2";
else if(a>=51 && a<61)
//display c1
cout<<"c1";
else if(a>=41 && a<51)
//display c2
cout<<"c2";
else if(a>=33 && a<41)
//display d
cout<<"d";
else if(a>=21 && a<33)
//display e1
cout<<"e1";
else if(a>=0 && a<21)
//display e2
cout<<"e2";
else
//display invalid
cout<<"Invalid!";
cout<<endl;
//return the value
return 0;
}
Learn more grading system
brainly.com/question/24298916
Answer:
When exposed to the powerful magnetic field of a degausser, the magnetic data on a tape or hard disk is neutralized, or erased. Degaussing is the guaranteed form of hard drive erasure, as such; it serves as the standard method of data destruction.
Explanation:
A already assigned variable cannot be assigned twice You can make the variable change over to a new one or call a whole new one to assign one without a value or It might be possible to do v=n (v is variable and n is number / value)
Answer:
Each time you insert a new node, call the function to adjust the sum.
This method has to be called each time we insert new node to the tree since the sum at all the
parent nodes from the newly inserted node changes when we insert the node.
// toSumTree method will convert the tree into sum tree.
int toSumTree(struct node *node)
{
if(node == NULL)
return 0;
// Store the old value
int old_val = node->data;
// Recursively call for left and right subtrees and store the sum as new value of this node
node->data = toSumTree(node->left) + toSumTree(node->right);
// Return the sum of values of nodes in left and right subtrees and
// old_value of this node
return node->data + old_val;
}
This has the complexity of O(n).
Explanation:
False- python is an example of a high level language. Other high levels are c++, PHP, and Java
