AR14

-
QUESTION DESCRIPTION 

Manikandan prepares for GATE Exam.

One question contains the question related to array. the question contains an array of integers, now manikandan needs to calculate sum of array elements using recursion.

Recursive function name should be as follows "int findSum(int A[], int N)"

TEST CASE 1 

INPUT
5
1 2 3 4 5
OUTPUT
15

TEST CASE 2 

INPUT
6
4 5 7 9 5 2
OUTPUT
32



#include <stdio.h> 
int findSum(int A[], int N) 
{ 
    if (N <= 0) 
        return 0; 
    return (findSum(A, N - 1) + A[N - 1]); 
} 
  
// Driver code 
int main() 
{ int N;
 scanf("%d",&N);
    int A[N],i;
  for(i=0;i<N;i++)
    scanf("%d",&A[i]); 
    printf("%d", findSum(A, N)); 
    return 0; 
}

Comments

Post a Comment

Popular posts from this blog

AR1

-
QUESTION DESCRIPTION  Ramu and somu played a number game . Ramu asked somu to generate a Program to find the largest two numbers from n elements in an array and then calculate and display their average. Mandatory to declare the variable names are "int array[MAX], i" TEST CASE 1  INPUT 5 2 5 6 4 7 OUTPUT 6.5 TEST CASE 2  INPUT 7 2 5 6 4 7 10 4 OUTPUT 8.5 #include <stdio.h> int main() { int MAX =50; int array[MAX], i, largest1, largest2; int n,j,temp; float mean,sum; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&array[i]); for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(array[i]<array[j]) { temp=array[i]; array[i]=array[j]; array[j]=temp; } } } largest1=array[0]; largest2=array[1]; sum=largest1+largest2; mean=(sum)/2; printf("%.1f",mean); return 0; }
Read more

SER12

-
QUESTION DESCRIPTION  There is a classroom which has M M rows of benches in it. Also, N N students will arrive one-by-one and take a seat. Every student has a preferred row number(rows are numbered 1 1 to M M and all rows have a maximum capacity K K. Now, the students come one by one starting from 1 1 to N N and follow these rules for seating arrangements: Every student will sit in his/her preferred row(if the row is not full). If the preferred row is fully occupied, the student will sit in the next vacant row. (Next row for N will be 1) If all the seats are occupied, the student will not be able to sit anywhere. Monk wants to know the total number of students who didn't get to sit in their preferred row. (This includes the students that did not get a seat at all) Mandatory to use loop condition as "while(x!=y)" Input First line contains 3 integers N N, M M and K K. N N - Number of students and M M - Number of rows and K K - maximum capacity of a row. Next line contains
Read more

AR15

-
QUESTION DESCRIPTION  Ramar has set of numbers and somu has set of numbers. Now the class instructor is asking to add to sorted arrays. The task is to merge them in a sorted manner. Mandatory method should be "void mergeArrays(int arr1[], int arr2[], int n1,int n2, int arr3[])" TEST CASE 1  INPUT 5 4 1 2 4 9 15 2 3 7 8 OUTPUT 1 2 2 3 4 7 8 9 15 TEST CASE 2  INPUT 5 6 1 2 4 9 15 2 3 7 8 18 20 OUTPUT 1 2 2 3 4 7 8 9 15 18 20 #include <stdio.h> void mergeArrays(int arr1[], int arr2[], int n1,int n2, int arr3[]) { int i,j; for(i=0;i<(n1+n2);i++) { if(i<n1) arr3[i]=arr1[i]; else arr3[i]=arr2[i-n1]; } for(i=0;i<n1+n2-1;i++) { for(j=0;j<n1+n2-1-i;j++) { if(arr3[j]>arr3[j+1]) { int temp=arr3[j]; arr3[j]=arr3[j+1]; arr3[j+1]=temp; } } }//sorting completed for(i=0;i<n1+n2;i++) printf("%d ",arr3[i]); } int main() { int n1, n2,i,j; sc
Read more