C Answers

Take input of your registration number(19120856) in the University. Write a program to print all the prime numbers digits in your registration number. 

Pass your marks of CA-1(27), CA-2(28), and CA-3(0) of the course INT102 to the function with header high (float *, float *, float*). Write a function that should return the highest CA marks.

Write a menu-driven program that asks the user to select a favorite color from the given colors. Keep asking the user three times for selecting the color from the list of the available colors. Do this with the help of a suitable loop and switch statement. Finally, you have to display the three favorite colors of the user.

Write a c program to pass an entire array to a user defined function and multiply each element by 3 inside the function and print the elements of the array in main

Sorting is a process of arranging numbers according to a certain

sequence. Write a C functions to read n integer values, sorting

process and display the arranged numbers.

Create a program like simsimi program with at least 10-20 questions, the program would interact with the user some important details about the user.

Let A[nl][ml] and B[n2][m2] be an n x m matrix. Then, find product of C[n] [m], is a A and B is defined as C(i,k) = A(ij) x B(j,k). where j is multipied over for all possible values of i and k.

Input:

2 3

3 2

3 -2 5

3 0 4

2 3

-9 0

0 4

Output:

24 29

6 25

monica has cooked n dishes and collected the data on the level of satisfaction for all the dishes from a guest. the guest returns an array, where the ith element of the array is the liking level of the ith dish. also, the time taken to cook the ith dish is i. like-to-time coefficient of a dish is calculated by multiplying the time taken to cook food with its liking level, i.e., input 2[i]. totally like-to-time coefficient is calculated by summing up all individual coefficients of dishes. you want the total like-to-time coefficient to be maximum. you can also remove some dishes, in which case, a new coefficient is calculated using the left dishes. find the maximum sum of all possible like-to-time coefficients.​

Given an array A of N integers and two integers X and Y, find the number of integers in the array that are both less than or equal to X and divisible by Y.