Problem Solving Through Programming In C

Subscribe to our YouTube Channel : Swayam Solver

Please scroll down for latest Programs. 👇

Week 9 : Programming Assignment 1

Due on 2023-09-28, 23:59 IST

Write a program to print all the locations at which a particular element (taken as input) is found in a list and also print the total number of times it occurs in the list. The location starts from 1.

For example if there are 4 elements in the array

If the element to search is 5 then the output will be

5 is present at location 1

5 is present at location 3

5 is present 2 times in the array.

Select the Language for this assignment.

#include <stdio.h>
int main()
{
   int array[100], search, n, count = 0;
   //"search" is the key element to search and 'n' is the total number of element of the array
   // "count" is to store total number of elements
​
 scanf("%d", &n); //Number of elements is taken from test case
​
 int c;
   for (c = 0; c < n; c++)
      scanf("%d", &array[c]);
​
   scanf("%d", &search); // The element to search is taken from test case
​
/* Use the printf statements as below:
"%d is present at location %d.\n"  for each locations
"%d is not present in the array.\n" if the element is not found in the list
"%d is present %d times in the array.\n"
*/

for (c = 0; c < n; c++)
    {
      if (array[c] == search)
      {
         printf("%d is present at location %d.\n", search, c+1);
         count++;
      }
    }
   if (count == 0)
      printf("%d is not present in the array.", search);
   else
      printf("%d is present %d times in the array.", search, count);
​
   return 0;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

This assignment has Public Test cases. Please click on "Compile & Run" button to see the status of Public test cases. Assignment will be evaluated only after submitting using Submit button below. If you only save as or compile and run the Program , your assignment will not be graded and you will not see your score after the deadline.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	4 5 6 5 7 5	5 is present at location 1.\n 5 is present at location 3.\n 5 is present 2 times in the array.	5 is present at location 1.\n 5 is present at location 3.\n 5 is present 2 times in the array.	Passed
Test Case 2	5 67 80 45 97 100 50	50 is not present in the array.	50 is not present in the array.	Passed

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

5 is present at location 1.\n
5 is present at location 3.\n
5 is present 2 times in the array.

5 is present at location 1.\n
5 is present at location 3.\n
5 is present 2 times in the array.

Passed

Test Case 2

50 is not present in the array.

50 is not present in the array.

Passed

Week 9 : Programming Assignment 2

Due on 2023-09-28, 23:59 IST

Write a C program to search a given element from a 1D array and display the position at which it is found by using linear search function. The index location starts from 1.

Select the Language for this assignment.

#include <stdio.h>
int linear_search(int[], int, int);
int main()
{
   int array[100], search, c, n, position;
   /* search - element to search, c - counter, n - number of elements in array,
   position - The position in which the element is first found in the list. */
​
    scanf("%d", &n); // Number of elements in the array is read from the test case data
​
    for (c = 0; c < n; c++)
    scanf("%d", &array[c]); //Elements of array is read from the test data
​
    scanf("%d", &search);  //Element to search is read from the test case data
​
   /* Use the following in the printf statement to print the output
   printf("%d is not present in the array.", search);
   printf("%d is present at location %d.", search, position+1); //As array[0] has the position 1
   */

position = linear_search(array, n, search);
​
   if (position == -1)
      printf("%d is not present in the array.", search);
   else
      printf("%d is present at location %d.", search, position+1);
   return 0;
}
​
int linear_search(int a[], int n, int find) {
   int c;
   for (c = 0 ;c < n ; c++ )
    {
      if (a[c] == find)
         return c;
    }
   return -1;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	5 78 90 34 54 98 90	90 is present at location 2.	90 is present at location 2.	Passed
Test Case 2	6 30 40 50 20 90 60 90	90 is present at location 5.	90 is present at location 5.	Passed

Week 9 : Programming Assignment 3

Due on 2023-09-28, 23:59 IST

Write a C program to search a given number from a sorted 1D array and display the position at which it is found using binary search algorithm. The index location starts from 1.

Select the Language for this assignment.

#include <stdio.h>
int main()
{
 int c, n, search,
 array[100];
 scanf("%d",&n); //number of elements in the array
​
 for (c = 0; c < n; c++)
 scanf("%d",&array[c]);
​
 scanf("%d", &search); //The element to search is read from test case.
​
/* Use the printf statements as below:
 printf("%d found at location %d.", search, variable_name);
 printf("Not found! %d isn't present in the list.", search);
*/

int first, last, middle;
   first = 0;
   last = n - 1;
   middle = (first+last)/2;
​
   while (first <= last) {
      if (array[middle] < search)
         first = middle + 1;
      else if (array[middle] == search) {
         printf("%d found at location %d.", search, middle+1);
         break;
      }
      else
         last = middle - 1;
​
      middle = (first + last)/2;
      }
   if (first > last)
      printf("Not found! %d isn't present in the list.", search);
​
     return 0;
      }

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	5 10 20 30 40 50 40	40 found at location 4.	40 found at location 4.	Passed
Test Case 2	4 44 55 66 77 10	Not found! 10 isn't present in the list.	Not found! 10 isn't present in the list.	Passed

Week 9 : Programming Assignment 4

Due on 2023-09-28, 23:59 IST

Write a C program to reverse an array by swapping the elements and without using any new array.

Select the Language for this assignment.

#include <stdio.h>
int main() {
  int array[100], n, c;
  scanf("%d", &n); // n is number of elements in the array.
  for (c = 0; c < n; c++) {
    scanf("%d", &array[c]);
  }

int temp, end;
   end = n - 1;
   for (c = 0; c < n/2; c++) {
    temp = array[c];
    array[c] = array[end];
    array[end] = temp;
    end--;
  }

printf("Reversed array elements are:\n");
​
  for (c = 0; c < n; c++) {
    printf("%d\n", array[c]);
  }
  return 0;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	4 10 20 30 40	Reversed array elements are:\n 40\n 30\n 20\n 10	Reversed array elements are:\n 40\n 30\n 20\n 10\n	Passed after ignoring Presentation Error
Test Case 2	5 50 60 40 30 20	Reversed array elements are:\n 20\n 30\n 40\n 60\n 50	Reversed array elements are:\n 20\n 30\n 40\n 60\n 50\n	Passed after ignoring Presentation Error

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

Reversed array elements are:\n
40\n
30\n
20\n
10

Reversed array elements are:\n
40\n
30\n
20\n
10\n

Passed after ignoring Presentation Error

Test Case 2

Reversed array elements are:\n
20\n
30\n
40\n
60\n
50

Reversed array elements are:\n
20\n
30\n
40\n
60\n
50\n

Passed after ignoring Presentation Error

Week 10 : Programming Assignment 01

Due on 2023-10-05, 23:59 IST

Select the Language for this assignment.

#include<stdio.h>
float fun (float x); //Function fun returns the function value of f(x)
void bisection (float *x, float a, float b, int *itr); // This function computes the root of f(x) using bisection method
​
int main ()
{
    int itr = 0, maxmitr=10;
    float x, a=1.0, b=2.0, allerr, x1; // x is the value of root in each iteration, x1 is the final value of the root 
   // a and b are the initial range for calculating the root using bisection method
      
scanf("%f", &allerr);  // allerr is the allowable error taken from test case data 
    bisection (&x, a, b, &itr);
​
/* Use the printf statement as given below to print the root
printf("Root = %1.4f\n", x1); */

do
    {
        if (fun(a)*fun(x) < 0)
            b=x;
        else
            a=x;
        bisection (&x1, a, b, &itr);
        if (((x1-x)<0 && -(x1-x)< allerr) || ((x1-x)>0 && (x1-x)< allerr))
        {
            printf("Root = %1.4f", x1);
            return 0;
        }
        x=x1;
    }
    while (itr < maxmitr);
    return 1;
}
float fun (float x)
{
    return (2*x*x*x - 3*x - 5);
}
void bisection (float *x, float a, float b, int *itr)
/* this function performs and prints the result of one iteration */
{
    *x=(a+b)/2;
    ++(*itr);
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	0.001	Root = 1.7197	Root = 1.7197	Passed
Test Case 2	0.1	Root = 1.6875	Root = 1.6875	Passed

Week 10 : Programming Assignment 02

Due on 2023-10-05, 23:59 IST

Write a C code to check if a 3 x 3 matrix is invertible. A matrix is not invertible if its determinant is 0.

Select the Language for this assignment.

#include<stdio.h>
 int main()
{
  int a[3][3], i, j;
  long determinant;
 //  9 elements of matrix is taken as input from test data
  for(i = 0 ; i < 3; i++)
      for(j = 0; j < 3; j++)
           scanf("%d", &a[i][j]);
​
/*Use the printf statements as:
printf("The given matrix is not invertible");
printf("The given matrix is invertible"); 
*/

determinant = a[0][0] * ((a[1][1]*a[2][2]) - (a[2][1]*a[1][2])) -a[0][1] * (a[1][0]
   * a[2][2] - a[2][0] * a[1][2]) + a[0][2] * (a[1][0] * a[2][1] - a[2][0] * a[1][1]);
   if ( determinant == 0)
       printf("The given matrix is not invertible");
   else
       printf("The given matrix is invertible");
   return 0;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	1 2 3 4 5 6 7 8 9	The given matrix is not invertible	The given matrix is not invertible	Passed
Test Case 2	1 0 5 2 1 6 3 4 0	The given matrix is invertible	The given matrix is invertible	Passed

Week 10 : Programming Assignment 03

Due on 2023-10-05, 23:59 IST

Write a C program to sort a given 1D array using pointer in ascending order.

Select the Language for this assignment.

#include <stdio.h>
int main()
{
    int a[100],i, n;
    scanf("%d",&n);  //Number of elements of the array is taken from the test case data 
   
   for (i=0; i<n; i++)
    {
        scanf("%d",a+i); // Input the array elements
    }

int j,t;
for (i=0; i<(n-1); i++) 
    {
        for (j=i+1; j<n; j++)
        {
            if (*(a+i)>*(a+j))
            {
                t=*(a+i);
                *(a+i)=*(a+j);
                *(a+j)=t;
            }
        }
    }

//   Printing sorted array in ascending order 
    for (i=0; i<n; i++)
    {
        printf("%d\n",*(a+i));
    }
    return 0;
   }

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	5 20 40 50 30 10	10\n 20\n 30\n 40\n 50	10\n 20\n 30\n 40\n 50\n	Passed after ignoring Presentation Error

Week 10 : Programming Assignment 04

Due on 2023-10-05, 23:59 IST

Write a C program to sort a 1D array using pointer by applying Bubble sort technique.

Select the Language for this assignment.

#include<stdio.h>
void sort(int *a, int n);
int main()
{
    int a[20];
    int n,i; 
    scanf("%d",&n); // Enter number of elements to sort is taken from test case data
   
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]); // The elements of the array is taken from the test data
    }
​
sort(a, n); // Calling the sorting function
​
    //Printing the sorted array 
    for(i=0;i<n;i++)
    {
        printf("%d\n",a[i]);
    }
   return 0;
}

void sort(int *a, int n)
{
    int i,temp,j;
    for(i=1;i<n;i++)
    {
        for(j=0;j<n-i;j++)
        {
           if(*(a+j)>=*(a+j+1))
        {
            temp = *(a+j);
            *(a+j)= *(a+j+1);
            *(a+j+1)= temp;
        }
        }
    }
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	6 -10 90 30 20 -100 50	-100\n -10\n 20\n 30\n 50\n 90	-100\n -10\n 20\n 30\n 50\n 90\n	Passed after ignoring Presentation Error

Week 11 : Programming Assignment 1

Due on 2023-10-12, 23:59 IST

Select the Language for this assignment.

#include<stdio.h>
int main()
{
  float t[100]={10,15,18,22,30}, v[100]={22,26,35,48,68};
  float a; //Value of the t to find the respective value of v(t)
  scanf("%f", &a);  // This will be taken from test cases

int i,j;
float b, c, k =0;
for(i=0; i<5; i++)
   {
      b=1;
      c=1;
      for(j=0; j<5; j++)
        {
           if(j!=i)
             {
               b=b*(a-t[j]);
               c=c*(t[i]-t[j]);
              }
            }
        k=k+((b/c)*v[i]);
        }

printf("The respective value of the variable v is: %.2f", k);
  return 0;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	25	The respective value of the variable v is: 56.42	The respective value of the variable v is: 56.42	Passed
Test Case 2	16	The respective value of the variable v is: 28.74	The respective value of the variable v is: 28.74	Passed

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

The respective value of the variable v is: 56.42

The respective value of the variable v is: 56.42

Passed

Test Case 2

The respective value of the variable v is: 28.74

The respective value of the variable v is: 28.74

Passed

Week 11 : Programming Assignment 2

Due on 2023-10-12, 23:59 IST

Select the Language for this assignment.

#include<stdio.h>
float func(float x);
int main()
{
  int n=10; //Taking n=10 sub intervals
  float a,b,integral; //integral is the integration result
  scanf("%f",&a); // initial limit taken from test case 
  scanf("%f",&b); // Final limit taken from test case
​
//Use the printf statement as printf("The integral is: %0.6f\n",integral);

int i;
float h,x, sum=0;  
if(b>a)
  h=(b-a)/n;
  else
  h=-(b-a)/n;
  for(i=1;i<n;i++){
    x=a+i*h;
    sum=sum+func(x);
  }
  integral=(h/2)*(func(a)+func(b)+2*sum);
  printf("The integral is: %0.6f",integral);
  return 0;
}
float func(float x)
{
  return x*x;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	0 1	The integral is: 0.335000	The integral is: 0.335000	Passed
Test Case 2	1 3	The integral is: 8.680000	The integral is: 8.680000	Passed

Week 11 : Programming Assignment 3

Due on 2023-10-12, 23:59 IST

Select the Language for this assignment.

#include<stdio.h>
float func(float x,float y);
int main()
{
    float m1,m2,m3,m4,m,h=0.3;
    float x0 = 0.3, y0 = 5, xn;
    scanf("%f",&xn); //xn will be taken from test cases
​
​
//Use the printf statement as: printf("y=%f",y);

while(x0<xn)
    {
        m1=func(x0,y0);
        m2=func((x0+h/2.0),(y0+m1*h/2));
        m3=func((x0+h/2.0),(y0+m2*h/2));
        m4=func((x0+h),(y0+m3*h));
        m=((m1+2*m2+2*m3+m4)/6);
        y0=y0+m*h;
        x0=x0+h;
    }
    printf("y=%f",y0);  // Final output
    return 0;
}
float func(float x,float y)
{
    float m;
    m=(x*(x+1)-3*y*y*y)/10;
    return m;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	0.9	y=1.777165	y=1.777165	Passed
Test Case 2	1.2	y=1.468128	y=1.468128	Passed

Week 11 : Programming Assignment 4

Due on 2023-10-12, 23:59 IST

Write a C program to check whether the given input number is Prime number or not using recursion. So, the input is an integer and output should print whether the integer is prime or not.

Note that you have to use recursion.

Select the Language for this assignment.

#include <stdio.h>
int checkPrime(int, int); //Function to check prime or not 
​
int main()
{
    int num, check;
    scanf("%d", &num); //The number is taken from test case data
    check = checkPrime(num, num/2);
    if (check == 1)
    {
        printf("%d is a prime number\n", num);
    }
    else
    {
        printf("%d is not a prime number\n", num);
    }
    return 0;
}

int checkPrime(int num, int i)
{
    if (i == 1)
    {
        return 1;
    }
    else
    {
       if (num % i == 0)
       {
         return 0;
       }
       else
       {
         return checkPrime(num, i - 1);
       }
    }
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	13	13 is a prime number	13 is a prime number\n	Passed after ignoring Presentation Error
Test Case 2	40	40 is not a prime number	40 is not a prime number\n	Passed after ignoring Presentation Error

Week 12 : Programming Assignment 1

Due on 2023-10-19, 23:59 IST

Write a program in C to find the factorial of a given number using pointers.

Your last recorded submission was on 2023-10-09, 13:25 IST

Select the Language for this assignment.

#include <stdio.h>
void findFact(int, long int*);
int main()
{
        long int fact; //factorial of the number
        int num1; 
        scanf("%d",&num1); //The number is taken from test data
​
         findFact(num1, &fact);
         printf("The Factorial of %d is : %ld\n",num1, fact);
         return 0;
        }

void findFact(int n, long int *f)
        {
        int i;
​
       *f =1;
       for(i=1;i<=n;i++)
       *f=*f*i;
       }

You may submit any number of times before the due date. The final submission will be considered for grading.

Private Test cases used for Evaluation	Status
Test Case 1	Passed

Week 12 : Programming Assignment 2

Due on 2023-10-19, 23:59 IST

Write a C program to print the Record of the Student Merit wise. Here a structure variable is defined which contains student rollno, name and score.

Select the Language for this assignment.

#include<stdio.h>
struct student
{
int rollno;
char name[20];
int score;
};
void main()
{
struct student s[20];
int i, n;
​
scanf("%d" ,&n); //No. of Students taken from test data
// Roll no., Name and Score of n students are taken from test data
for(i=0;i<n;i++)
{
scanf("%d", &s[i].rollno);
scanf("%s", s[i].name);
scanf("%d", &s[i].score);
}
//Complete the program so that merit list is printed in descending order

struct student temp;
int j;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1;j++)
{
if(s[j].score<s[j+1].score)
{
temp=s[j];
s[j]=s[j+1];
s[j+1]=temp;
}
}
}

printf("The Merit List is :\n");
for(i=0;i<n;i++)
{
printf("%d", s[i].rollno);
printf("  %s", s[i].name);
printf("  %d\n", s[i].score);
}
​
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	3 1 Santanu 700 2 Aparna 550 3 Vivek 900	The Merit List is :\n 3 Vivek 900\n 1 Santanu 700\n 2 Aparna 550	The Merit List is :\n 3 Vivek 900\n 1 Santanu 700\n 2 Aparna 550\n	Passed after ignoring Presentation Error

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

3
1
Santanu
700
2
Aparna
550
3
Vivek
900

The Merit List is :\n
3  Vivek  900\n
1  Santanu  700\n
2  Aparna  550

The Merit List is :\n
3  Vivek  900\n
1  Santanu  700\n
2  Aparna  550\n

Passed after ignoring Presentation Error

Week 12 : Programming Assignment 3

Due on 2023-10-19, 23:59 IST

Write a C program to store n elements using Dynamic Memory Allocation - calloc() and find the Largest element

Select the Language for this assignment.

#include <stdio.h>
#include <stdlib.h>
​
int main()
{
    int n; 
    float *element;
​
    scanf("%d", &n); //Total number of elements
​
    // Allocate the memory for 'n' number of elements. 
    //Then take the elements as input from test data

element = (float*) calloc(n, sizeof(float));
​
    if(element == NULL)
    {
        printf("Error!!! memory not allocated.");
        exit(0);
    }
​
    // Stores the number entered by the user.
    int i;
    for(i = 0; i < n; ++i)
    {
        scanf("%f", element + i);
    }
​
 // find the largest
    for(i = 1; i < n; ++i)
    {
       if(*element < *(element + i))
         *element = *(element + i);
    }
​
​
    printf("Largest element = %.2f", *element);
​
    return 0;
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 1 / 1 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	5 200 300 500 100 400	Largest element = 500.00	Largest element = 500.00	Passed

Week 12 : Programming Assignment 4

Due on 2023-10-19, 23:59 IST

Write a C program to find the sum of two 1D integer arrays ‘A’ and ‘B’ of same size and store the result in another array ‘C’, where the size of the array and the elements of the array are taken as input.
In the Test case the input is given as follows

5

So the output will be displayed as

Result is

55

Write the program accordingly. Use dynamic memory allocation.

Select the Language for this assignment.

#include<stdio.h>
#include<stdlib.h>
​
void main()
{
 int i,n;
 
//The number of elements in each array is taken from test case data 
​
 scanf("%d", &n);

int *a,*b,*c;
 a = (int *) malloc(n*sizeof(int));
 b = (int *) malloc(n*sizeof(int));
 c = (int *) malloc(n*sizeof(int));
​
// Input Elements of First List;
 for(i=0;i<n;i++)
 {
  scanf("%d",a+i);
 }
​
 //Input Elements of Second List;
 for(i=0;i<n;i++)
 {
  scanf("%d",b+i);
 }
​
 for(i=0;i<n;i++)
 {
  *(c+i) = *(a+i) + *(b+i);
 }

printf("Result is\n");
​
 for(i=0; i<n; i++)
 {
  printf("%d\n",*(c+i));
 }
​
}

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	5 10 20 30 40 50 1 2 3 4 5	Result is\n 11\n 22\n 33\n 44\n 55	Result is\n 11\n 22\n 33\n 44\n 55\n	Passed after ignoring Presentation Error
Test Case 2	4 100 200 300 400 400 300 200 100	Result is\n 500\n 500\n 500\n 500	Result is\n 500\n 500\n 500\n 500\n	Passed after ignoring Presentation Error

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

Result is\n
11\n
22\n
33\n
44\n
55

Result is\n
11\n
22\n
33\n
44\n
55\n

Passed after ignoring Presentation Error

Test Case 2

Result is\n
500\n
500\n
500\n
500

Result is\n
500\n
500\n
500\n
500\n

Passed after ignoring Presentation Error

Swayam Solver

NPTEL Problem Solving Through Programming In C - Programming Assignment | July-2023 Week 9 to 12

Week 9 : Programming Assignment 1

Week 9 : Programming Assignment 2

Week 9 : Programming Assignment 3

Week 9 : Programming Assignment 4

Week 10 : Programming Assignment 01

Week 10 : Programming Assignment 02

Week 10 : Programming Assignment 03

Week 10 : Programming Assignment 04

Week 11 : Programming Assignment 1

Week 11 : Programming Assignment 2

Week 11 : Programming Assignment 3

Week 11 : Programming Assignment 4

Week 12 : Programming Assignment 1

Week 12 : Programming Assignment 2

Week 12 : Programming Assignment 3

Week 12 : Programming Assignment 4

No comments:

Post a Comment