Skip to main content

EXAMINATION SCAM 1 Examination Scam 1 Now a days in online examination there has been many fraudulent activities.Since online examination takes place virtualy its easy for the corrupts to gain money from it. One such fraudulent activity is providing fake registration links to the participants and collecting the fee from them.Due to this activity the legitimate online examination boards are hindered.As they are the once held responsible for the fees collected.There is also the case of an applicant registering using fake credentials.Applying more then once for a particular examination. To curb such bogus registration activity,the online examination board has decided to allot a random number to each applicants. This random number is valid only if it contains a specific number of 5’s. (digit 5). Can you help them by writing a program to count the occurrences of 5 as a digit in the random number ‘n’ that is generated? Note : Formulate a RECURSIVE Algorithm Function name: int findDigit(int n); Input Format: Input consists of a single integer that corresponds to n. Output Format: Output consists of a single integer that corresponds to the number of times the digit 5 appears in ‘n’. Sample Input : 52 Sample Output : 1 Sample Input : 555 Sample Output : 3 #include int findDigit(int n); int ctr=0,r; int main() { int n; scanf("%d",&n); printf("%d",findDigit(n)); return 0; } int findDigit(int n) { if(n>0) { r=n%10; n=n/10; if(r==5) { ctr++; return (findDigit(n)); } else return (findDigit(n)); } return ctr; }

Comments

Post a Comment

Popular posts from this blog

C Program To Calculate The Revenue The demand for organic food increases every year by 8.9%. Write a program to find the increase in revenue after 3 years. Given the revenue in the first year is ‘x’ crores. Input Format: The first line of the input is an integer that corresponds to the ‘x’ value. Output Format: Output is a float value that corresponds to the revenue after 3 years, rounded off to 2 decimal places. Sample Input: 4 Sample Output: 5.17 //PROGRAM #include<stdio.h> int main() {     int x,i;     float rev;     scanf("%d",&x);     rev=x;     for(i=0;i<3;i++)     {         rev=rev*(1.089);     } printf("%.2f",rev); return 0; }
Post a Comment
Read more
CROP DETAILS Crop Details A small farmer, Mr.John, use to grow different crops every year in his field. All the crops are being grown using goat manure, farmyard manure, groundnut and neem cake. All the crops are grown organically. He got high yield by using sufficient water and fertilizers at in this year. He will sell his crops in the market. In the market, he wants to maintain the details of each crop that are purchased by customers. Details like crop name, the weight of the crop, cost of the crop Display the details of crops in ascending order of crop names. Create a structure called crop. struct crop{ char cropName[30]; float weight; int cost; }; Input and Output Format: Refer sample input and output for formatting specification. All float values are displayed correctly to 2 decimal places. All text in bold corresponds to the input and the rest corresponds to output. Sample Input and Output: Enter the number of Crops 2 Enter the details of Crop 1 Enter name...
Post a Comment
Read more
FRUIT YIELDING TREE Fruit yielding tree Jack owned a farm which had ‘n’ fruit trees. He sold a tree from the farm which yielded the maximum number of fruits. Now, he wanted to find the tree that yielded the second maximum number of fruits. Write a program to help Jack in finding the second largest fruit yielding tree without sorting. Function Specification: int secondLargest(int *, int); Input format: The first line of the input corresponds to the n. The next n inputs correspond to the number of fruits yielded by each tree.(Assume number of fruits yielded by each tree is unique) Output format: The output is an integer which corresponds to the second largest fruit yielding tree from the farm. Sample Input: 7 7 5 8 6 9 4 3 Sample Output: 8 #include #include int secondLargest(int*a,int n); int main() { int i,n; int *p; scanf("%d",&n); p=(int*)malloc(n*sizeof(int)); for(i=0;i f) ...
1 comment
Read more