Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 6

 Write a program that prints a multiplication table for a given number and the number of rows in the table. For example, for a number 5 and rows = 3, the output should be:
5 x 1 = 5
5 x 2 = 10
5 x 3 = 15 ……………..


#include <stdio.h> 
void main()
{
int n, j,r=0; 
//clrscr();
printf("\n Enter a number:\n "); 
scanf("%d",&n);
printf("\n Enter number of rows:\n "); 
scanf("%d",&r);

printf("\n Multiplication table for a given= %d", n); 
printf("\n The number of rows in the table=%d", r);

for(j=1;j<=r;j++)
{
printf("\n %d * %d = %d ", n, j, n*j);
}

//getch();
}


OUTPUT:

Enter a number:
 7
 Enter number of rows:
 5
 Multiplication table for a given= 7
 The number of rows in the table=5
 7 * 1 = 7 
 7 * 2 = 14 
 7 * 3 = 21 
 7 * 4 = 28 
 7 * 5 = 35 

Comments

Popular posts from this blog

Learning and Development Interview Questions and answers for Mathematics-1.

  1). What is Mean, Mode and Median? Solution Answer: The mean is the average of a  collection of numbers or terms in a sequence. To calculate the mean use a formula is sum of total terms divided  by number of terms. The mode  is the most f requent number or term in a sequence. It means the number that occurred  highest number of times  in a sequence. To find the mode arrange the numbers in ascending or descending order and verify which number repeated most number of times in a sorted sequence. The median is the middle number/term where the sequence is arranged in ascending or descending order. If the sorted sequence have odd number of terms then  divide by 2 and round up to get the position of the median number.  If the  sorted sequence  have  even  number of terms then  divide by 2  to get the position of the median number.  2 ). What is the Difference between Fractional and Rational number? Solu...

INSERTION SORT, BUBBLE SORT, SELECTION SORT

// C program for insertion sort #include <math.h> #include <stdio.h> void insertionSort(int arr[], int n);     // A utility function to print a sorted array of size n void printArray(int arr[], int n) {     int i;     for (i = 0; i < n; i++)         printf("%d ", arr[i]);     printf("\n"); }    // Driver code int main() {     int arr[15],n,i;         printf("enter number of elements in array \n");     scanf("%d", &n);         printf("enter array values to sort\n");     for(i=0; i<n; i++)     scanf("%d", &arr[i]);         insertionSort(arr, n);     printArray(arr, n);        return 0; } /* Function to sort an array using insertion sort*/ void insertionSort(int arr[], int n) {     int i, key, j;     for (i = 1; i < n; i++) ...