NPTEL Problem Solving Trough Programming In C | NPTEL Week 9 Programming Assignment | NPTEL Assignment Solutions

NPTEL Problem Solving Trough Programming In C Week 9 Programming Assignment | NPTEL Swayam Assignment Answers

Join Us On Telegram

👇👇👇👇👇👇

Join Us On Youtube

👇👇👇👇👇👇

Nptel Week 9 Programming Assignment Answers:

Q.1: 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

5

6

5

7

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.

Code:

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.\n",search); } else{ printf("%d is present %d times in the array.\n",search,count); } return 0; }

Q.2: 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.

Code:

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

Q.3: 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.

Code:

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

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

Code:

int j=n-1,i=0,temp; while(i<j){ temp=array[i]; array[i]=array[j]; array[j]=temp; i++; j--; }

If you are facing any queries regarding this assignment solutions, then please drop comment in comment section.