Skip to main content

Direct Method of Mean (C++ Program)

 Q). Write the C++ Program for direct method of Mean


=> Prog :


#include<iostream>

#include <iomanip>

using namespace std;


int main(){


int n;

double sumF=0,sumFX=0;


cout<<"Enter the number input  : ";

cin>>n;


double number[n];

double freq[n];


for(int i=0; i<n; i++){


    cout<<"Number["<<i+1<<"] : ";

    cin>>number[i];


    cout<<"frequency["<<i+1<<"] : ";

    cin>>freq[i];


}


cout<<"\n\n"<<setw(20)<<"Number"<<setw(10)<<"|"<<setw(20)<<"Frequency"<<endl<<endl;


for(int i=0; i<n; i++){


    cout<<setw(20)<<number[i]<<setw(10)<<"|"<<setw(20)<<freq[i]<<endl;;

    sumF=sumF+freq[i];


}


cout<<"\n****************      After Calculation      ********************\n";


cout<<"\n\n"<<setw(20)<<"Number(x)"<<setw(10)<<"|"<<setw(20)<<"Frequency(f)"<<setw(10)<<"|"<<setw(30)<<"fx"<<endl<<endl;


for(int i=0; i<n; i++){


    cout<<setw(20)<<number[i]<<setw(10)<<"|"<<setw(20)<<freq[i]<<setw(10)<<"|"<<setw(30)<<number[i]<<" x "<<freq[i]<<" = "<<number[i]*freq[i]<<endl;

    sumFX=sumFX+number[i]*freq[i];

}


cout<<endl;

 cout<<setw(30)<<"|"<<setw(20)<<"Summation F = "<<sumF<<setw(7)<<"|"<<setw(30)<<"fx = "<<sumFX<<endl;


 double mean= sumFX/sumF;


 cout<<"\n\n    =>    MEAN : "<<mean<<endl;


}



=> Output :




Comments

Popular posts from this blog

Sum of Digit is Pallindrome or not

  Sum of Digit is Pallindrome or not Given a number N.Find if the digit sum(or sum of digits) of N is a Palindrome number or not. Note:A Palindrome number is a number which stays the same when reversed.Example- 121,131,7 etc. Example 1: Input: N=56 Output: 1 Explanation: The digit sum of 56 is 5+6=11. Since, 11 is a palindrome number.Thus, answer is 1. Example 2: Input: N=98 Output: 0 Explanation: The digit sum of 98 is 9+8=17. Since 17 is not a palindrome,thus, answer is 0. Your Task: You don't need to read input or print aything.Your Task is to complete the function isDigitSumPalindrome() which takes a number N as input parameter and returns 1 if the Digit sum of N is a palindrome.Otherwise it returns 0. Expected Time Complexi...

Menu with 5 option & selected option should appear in text box

Q6. Create a menu with 5 options and selected option should appear in text box. Android Program : Activity_main.xml <?xml version="1.0" encoding="utf-8"?> <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     android:id="@+id/activity_main"     android:layout_width="match_parent"     android:layout_height="match_parent"     android:paddingBottom="@dimen/activity_vertical_margin"     android:paddingLeft="@dimen/activity_horizontal_margin"     android:paddingRight="@dimen/activity_horizontal_margin"     android:paddingTop="@dimen/activity_vertical_margin"     tools:context="com.kishanhaldar.program6.MainActivity">                 ...

Closest Number

Closest Number Basic Accuracy: 11.21% Submissions: 1615 Points: 1 Given non-zero two integers N and M . The problem is to find the number closest to N and divisible by M . If there are more than one such number, then output the one having maximum absolute value .   Example 1: Input: N = 13 , M = 4 Output: 12 Explanation: 12 is the Closest Number to 13 which is divisible by 4. Example 2: Input: N = -15 , M = 6 Output: -18 Explanation: -12 and -18 are both similarly close to -15 and divisible by 6. but -18 has the maximum absolute value. So, Output is -18   Your Task: You don't need to read input or print anyth...