Search & Filtering
Create a structure called time. Its three members, all of type int, should be called hours, minutes, and seconds. Write a program that prompts the user to enter a time value in hours, minutes, and seconds. This can be in 12:30:50 format. The program then stores the time in a variable of type time, and finally prints out the total number of seconds.
Create a structure a type date that contains three members: the day, the month, the year, all of type int. Here the user enter a date in the format 10/9/2007, store it in a variable of type date, then retrieve the value from the variable and print the mouth in the same format.
Create a structure called volume that uses three variables of type Distance (structure) to model the volume of a room. Initialize a variable of type volume to specific dimensions, and then calculate the volume it represents and print out the result.
Given a word W as input, write a program to print the unique character in the word, in the order of their occurrence
Note: consider lower and upper case letters as different
Input
The input is a single line containing as word W
Output:
The out should be a single line containing space- separated character
sample input: MATHEMATICS
sample Output: M A T H E I C S
Create a recursive function dec to bin to find the binary representation of a non-negative integer.
Write a recursive algorithm to multiply two positive integers m and n using repeated addition. Specify the base case and the recursive case.
Write a recursive function to generate a pattern of stars, such as the following: * * * * * * * * * * * * * * * * * * * *
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: * * * * * * * * * * * * * * * * * * * *
Problem Statement 2 The Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, 21, … Begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. Write a recursive function that generates N series numbers. Where N is the integer inputted by the user at runtime.
Problem Statement 1 Write a recursive function power (base, exponent) that, when invoked, returns base exponent For example, power (3, 4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship. base exponent = base . base exponent - 1 And the terminating condition occurs when exponent is equal to 1, because base 1 = base
