Write separate C program to find the following solutions:

1.Insert 5 values from user and print all vlues in descending order(sorted).

2. Search a number from the array and print it's position.

3. Find the second maximum number in a given array.

4. Find the highest and lowest number from array (with their position)

5. Delete lowest element from the array.

1.Insert 5 values from user and print all vlues in descending order(sorted).

2. Search a number from the array and print it's position.

3. Find the second maximum number in a given array.

4. Find the highest and lowest number from array (with their position)

5. Delete lowest element from the array.

write a c program to print the following tringle.

# #

# # # #

# # # # # #

# #

# # # #

# # # # # #

write a c program to print the following tringle.

#

# #

# # # #

# # # # # #

#

# #

# # # #

# # # # # #

There are N coding questions and the score for Ith question must be in the range of 1 to N(inclusive). All the coding questions follow one rule that higher the score higher is difficulty level. Now Tom is trying to assign the score to each question in a sorted difficulty order such that 1st question is of least difficulty level and Nth question is of most difficulty level. And it is also possible that more than one question can have equal score.

wants the sum of the sum of any

As a responsible student of class Tom wants that any student who will get more ACCEPTED answers should rank higher. This means that for any value of M, Tom scores of any M questions should be strictly less in comparison to

M + 1 questions.

Now Tom is thinking of how many possible ways are there which holds above mentioned condition, so that he can assign score.

wants the sum of the sum of any

As a responsible student of class Tom wants that any student who will get more ACCEPTED answers should rank higher. This means that for any value of M, Tom scores of any M questions should be strictly less in comparison to

M + 1 questions.

Now Tom is thinking of how many possible ways are there which holds above mentioned condition, so that he can assign score.

There are N coding questions and the score for Ith question must be in the range of 1 to N(inclusive). All the coding questions follow one rule that higher the score higher is difficulty level. Now Tom is trying to assign the score to each question in a sorted difficulty order such that 1st question is of least difficulty level and Nth question is of most difficulty level. And it is also possible that more than one question can have equal score.

wants the sum of the sum of any

As a responsible student of class Tom wants that any student who will get more ACCEPTED answers should rank higher. This means that for any value of M, Tom scores of any M questions should be strictly less in comparison to

M + 1 questions.

Now Tom is thinking of how many possible ways are there which holds above mentioned condition, so that he can assign score.

reldbeien, lavintit madla

wants the sum of the sum of any

As a responsible student of class Tom wants that any student who will get more ACCEPTED answers should rank higher. This means that for any value of M, Tom scores of any M questions should be strictly less in comparison to

M + 1 questions.

Now Tom is thinking of how many possible ways are there which holds above mentioned condition, so that he can assign score.

reldbeien, lavintit madla

Write a program in C programming language, that will open a bitmap image file in read mode, reads its contents, and display it on the screen

Write a function num_indep_days() which computes the number of days

since 14th August 1947 to the date provided as input to the function.

since 14th August 1947 to the date provided as input to the function.

write C program to read numbers from user until -1 is encountered. Count the number of prime numbers and composite numbers entered by the user and display the result.

For example, if the user gives the input as :

Enter numbers up to -1 :

Enter numbers up to -1: 11 17 19 21 -1

total prime = 3

total composite = 1

For example, if the user gives the input as :

Enter numbers up to -1 :

Enter numbers up to -1: 11 17 19 21 -1

total prime = 3

total composite = 1

Cyber Security is a key issue to protect our daily documents and applications stored

and submitted in various platforms. Having a robust encryption system to our

generated password is very essential in this perspective. Your task is to create a nice

and smooth encrypted password generator. Follow the instructions carefully to build

the password generator.

a. Take a 5 digit integer number from user. If the number is not exactly

of 5 digits, give a warning message to user and exit/abort the program.

b. In case of a 5 digit number, convert the number to a corresponding

character.

c. Finally, generate a 5 length password and show it on screen.

and submitted in various platforms. Having a robust encryption system to our

generated password is very essential in this perspective. Your task is to create a nice

and smooth encrypted password generator. Follow the instructions carefully to build

the password generator.

a. Take a 5 digit integer number from user. If the number is not exactly

of 5 digits, give a warning message to user and exit/abort the program.

b. In case of a 5 digit number, convert the number to a corresponding

character.

c. Finally, generate a 5 length password and show it on screen.

Suppose you have some words and you want to right justify them, that is, align them to

the right. Create a program that reads a word and print it all right justified, in the same

order as they appear in the input.

Input:

The first line of the input will contain an integer N (1 ≤ N ≤ 50) indicating the number

of following words. Each word is composed of up to 50 letters (‘A’-‘Z’ or 'a'-'z') and

will contain at least one letter.

Output:

Print the words padded on the left with space characters so that they are all the same

length as the longest word found in that text.

Sample Input Sample Output

3

Bob

Tommy

Jim

Bob

Tommy

Jim

the right. Create a program that reads a word and print it all right justified, in the same

order as they appear in the input.

Input:

The first line of the input will contain an integer N (1 ≤ N ≤ 50) indicating the number

of following words. Each word is composed of up to 50 letters (‘A’-‘Z’ or 'a'-'z') and

will contain at least one letter.

Output:

Print the words padded on the left with space characters so that they are all the same

length as the longest word found in that text.

Sample Input Sample Output

3

Bob

Tommy

Jim

Bob

Tommy

Jim