Exercise 04

Page 1 of 1

1. Write a program that will sort some given value in ascending and descending order. 2. Write a program that will calculate the average of the data that has been given by the user. Use array to do this. 3. Write a program that will take the scores of m numbers of quizzes of n numbers students; prints the quizzes numbers corresponding to each student and gives the average marks of best (m-1) number of quizzes for each student. 4. Write and test the following function that returns the minimum value among the first n float min( float a[], int n) elements: 5. Write and test the following function that returns the index of the first minimum value among the first n elements: float minindex( float a[], int n) 6. Write and test the following function that returns both the minimum and maximum values among the first n elements: float extreme( float& min, float& max, float a[], int n)

7. Write and test the following function that returns both the largest and second largest (possibly equal) values among the first n elements: float max( float& max_1, float& max_2, float a[], int n)

8. Write and test the following function that returns the Standard Deviation of a data set of n numbers a0, a1, a2, a3, … , a(n-1). double stdev( double a[], int n) n −1

Standard Deviation is defined by the equation, S =

∑ (a i =0

_

i

− a)

n −1

__

; where

a

is the mean

value of the data. 8. Write a program that will create Pascal’s Triangle in the square matrix. 1 0 0 0 0 1 1 0 0 0 1 2 1 0 0 1 3 3 1 0 1 4 6 4 1 9. Write a program that will multiply two matrix of any columns and row if it passes the test for the conditions of matrix multiplication.

1. Write a program that will sort some given value in ...

Write a program that will sort some given value in ascending and descending order. 2. Write a program that will calculate the average of the data that has been ...

60KB Sizes 0 Downloads 193 Views

Recommend Documents

1. Write a program with a function that takes two int ...
Write and test the a function SQUARE(int n) that determines whether the given integer is a square number. The output will be as follows: 0 is square. 1 is square. 2 is not square. ... void Circle (float& a, float& p, float s1, float s2, float s3). 11

VALUE OF SHARING DATA 1. Introduction In some online advertising ...
Feb 12, 2018 - The advertiser will not obtain any net profit if the advertiser does not share its data, but if the advertiser shares its data, there is a chance that the advertiser will reveal information that enables the advertiser to win the auctio

How Do You Write a Song That Will Knock Over a Cow?
What is the total cost? 3. Betty takes out a ... How much must she pay per month? 4. ... If she wants to pay off the loan in 4 years, how much can Sarah borrow? 9.

Page 1 Comparing Quadratic Functions Given in Different Forms 1 ...
above the surface of the ocean as a function of the seagull's horizontal distance from a certain buoy. Determine which bird descends deeper into the ocean. 2.

expert-carpenters-in-brunswick-will-create-some-superb-results.pdf ...
expert-carpenters-in-brunswick-will-create-some-superb-results.pdf. expert-carpenters-in-brunswick-will-create-some-superb-results.pdf. Open. Extract.

Finding the Value of Tangent Given a Point on a Circle
Finding the Value of Tangent Given a Point on a Circle. Find the Value of Tangent for Each Circle. 1. 2. 3. 4. Page 2. Finding the Value of Tangent Given a Point ...

Chrome Plating In Melbourne Will Work Best For Any Sort Of Machine ...
Page 1 of 1. Chrome Plating In Melbourne Will Work Best For Any Sort Of Machine.pdf. Chrome Plating In Melbourne Will Work Best For Any Sort Of Machine.pdf.

On the existence of a limit value in some non expansive ...
Jul 4, 2009 - Proof : We first prove supt>0 infm≤m0 Vm,t(y0) ≥ V +(y0). Suppose by contra- diction that it is false. So there exists ε > 0 such that for any t > 0 ...

Insertion Sort
What's the worst case runtime of insertion sort? What's the best case runtime of insertion sort? ○. Lin. Page 11. Page 12. Bubble. Sort. O. Ω. Θ. Selection. Sort.