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.
WAP to find sum of number 1 to 10 using constructor , where n is parameter passed to constructor.
When will the ‘break’ and ‘continue’ statements be used in programme? Mention the scenario
and write the programme to demonstrate this.
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.