Develop user-friendly codes to implement the Newton-Cotes integration formulae as discussed in class. Use appropriate function names and arguments. Remember to check in which cases a certain algorithm will be applicable.
Write a program that
Deletes duplicate elements from circular queue.
Requirements :
No global decelerations
Run test in main
1. Write a list of book defining parameters. (5 at least)
o Name (String) – Topic (String) – Pages (int) – IsEnglishLanguage (bool) – Price
(float). 2.Declare and initialize the variables of book parameters. 3.Take input from user and output all parameters given by the user. 4.Create a Function to analyze book parameter taken from user.
Write a C++ recursive function that takes an array of words and returns an array
that contains all the words capitalized
Make an array based circular queue
Make a function as follows
bool search(int key)
This function searches if element exists in circular queue or not
Requirements :
Test run in main
No global decelerations
Input numbers from the user and find the sum of all those input numbers until the user
inputs zero. In other means, the loop should end when the user enters 0. Finally, display the
sum of all those numbers entered by the user.
1. Explain how enumerations work.
2. Describe the three problems that unscoped enumerations can cause.
Sample Run 1:
Enter the measurement of the sides of the triangle: 3 4 5
The triangle is an example of scalene triangle.
Sample Run 2:
Enter the measurement of the sides of the triangle: 10 10 8
The triangle is an example of isosceles triangle.
Sample Run 3:
Enter the measurement of the sides of the triangle: 10 10 10
The triangle is an example of equilateral triangle.
Sample Run 4:
Enter the measurement of the sides of the triangle: 10 1 2
The triangle is an example of notriangle triangle.
WAP to count number of Characters in a word using pointer to string.