Skip to main content

INTELLIGENCE BUREAU I Intelligence Bureau I The Intelligence Bureau (IB) is India's internal intelligence agency. It was recast as the Central Intelligence Bureau in 1947 under the Ministry of Home Affairs. In 1909, the Indian Political Intelligence Office was established in England in response to the development of Indian revolutionary activities, which came to be called the Indian Political Intelligence (IPI) from 1921. This was a state-run surveillance and monitoring agency. The IPI was run jointly by the India Office and the Government of India and reported jointly to the Secretary of the Public and Judicial Department of the India Office, and the Director of Intelligence Bureau (DIB) in India, and maintained close contact with Scotland Yard and MI5. The Assistant Central Intelligence Officer(ACIO) exam is conducted every year in which the exam fees differ for men,women and sc/st. Let A denote the exam fees for women. Let B denote the exam fees for sc/st. Let C denote the exam fees for men. The exam fees of a candidate is said to be valid, only when it satisfies any one of the conditions given below : 1. The exam fees of women should differ from the exam fees of sc/st by at most 100 and the exam fees of men should differ from both other values by more than 1000. 2. The exam fees of women should differ from the exam fees of men by at most 100 and the exam fees of sc/st should differ from both other values by more than 1000. [Differ --- it may either be less than or more than] Function Specification: Given 3 ints, A, B, C, write a function named “findValidity” that accepts 3 integer arguments (A, B, C),. This function returns 1, if B or C is "close" (differing from A by at most 100), while the other is "far", differing from both other values by more than 1000. Input Format : Input consists of 3 integers that correspond to A, B and C. Output Format : Output consists of a string that is either “Valid” or “Invalid”. Sample Input 1: 200 120 2000 Sample Output 1: Valid Sample Input 2: 120 1000 200 Sample Output 2: Invalid #include #include int findValidity(int A,int B,int C); int main() { int a,b,c,ans; scanf("%d%d%d",&a,&b,&c); ans=findValidity(a,b,c); if (ans==1) { printf("Valid\n"); } else printf("Invalid\n"); return 0; } int findValidity(int A,int B,int C) { if(((A-B<=100)&&(B-A<=100)&&(C-A>1000)&&(C-B>1000))||((A-C<=100)&&(C-A<=100)&&(B-A>1000)&&(B-C>1000))) return 1; else return 0; }

Comments

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; }
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...
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) ...