C Programming

Yes.

Implement this method in Java:

public static int[] countNums(int n) {

int x = n;

int[] nums = new int[10];

while(x != 0) {

nums[x % 10]++;

x /= 10;

}

return nums;

}

That will return an array of the counts of the digits from 0 to 9.

The conversion of octal number to binary can be obtained by using two methods. First, it can be converted into decimal and then obtained decimal is converted into binary. In the second method

5.625

A modulo function finds the remainder term when you divide one number by another number.

For example, if you divide 20 by 3 you're left with a remainder term of 2.

So 20 mod 3 = 2.

If you divide 21 by 3 you're left with no remainder term.

So 21 mod 3 = 0.

int main() { for(int i = 1; i <= 10; i++)
printf("%d ", i);


return 0;
}

15z = 15 x 6 = 90

To find the largest of three numbers you must first find the largest of two numbers:

int max (int a, int b) { return a>b?a:b; // or, equivalently: if (a>b) return a; else return b;

}

Now we can use this function to find the maximum of three:

int max3 (int a, int b, int c) {

return max (max (a,b), c);

}

Circles do not have volume because they are 2 dimensional. The area of a circle is PI*r2 . A sphere has volume and the volume of a sphere is 4/3*pi*r3 where r is the radius.

we use variable to store the value

Hexadecimal B = Decimal 11. Otherwise, the question is too ambiguous.

Writing answers used to be enough.

Now we have to fix the questions too.

I think it's supposed to be 76, but who can really know.

ahhh, proofreading, it's such a lost art . . .

#include <stdio.h> #include <stdlib.h> typedef struct node { int column; int value; int row; struct node *next; } element; /* MENU */ void Menu() { printf("\n***\tADDING SPARSE MATRICES\t***\n"); printf("\n 1.) Insert in A"); printf("\n 2.) Insert in B"); printf("\n 3.) Printout both"); printf("\n 4.) A + B = "); printf("\n 0.) EXIT"); printf("\nChoose ---------> "); } /* Initialize*/ void Init (element *x[]) { int i; for (i=0; i<3; i++) x[i] = NULL; } /* Printout */ void Printout (element *x[]) { int i, test = 0; element *temp; for (i=0; i<3; i++) { temp = x[i]; while (temp != NULL) { printf("Element position (%d,%d) = %d\n", i, temp->column, temp->value); test = 1; temp = temp->next; } } if (test == 0) printf("This matrix is empty!!\n"); } /* INSERT */ void Insert(element *x[], int row, int column, int value) { int r = row; element *p; element *new = malloc(sizeof(element)); new->row = row; new->column = column; new->value = value; if (x[r] == NULL) { x[r] = new; new->next = NULL; } else { p = x[r]; if (new->column < p->column) { new->next = p; x[r] = new; } else if (new->column > p->column) { while (p->next != NULL && p->next->column < new->column) { p = p->next; } new->next = p->next; p->next = new; } else printf("An element already exists there!!\n"); } } /* A + B */ void Add (element *x[],element *y[],element *z[]) { int i; element *p, *q; for (i=0; i<3; i++) { /*row of x empty, row of y not*/ if (x[i] == NULL && y[i] != NULL) { q = y[i]; while (q != NULL) { Insert(z, i, q->column, q->value); q = q->next; } } /*row of y empty, row of x not*/ if (x[i] != NULL && y[i] == NULL) { q = x[i]; while (q != NULL) { Insert(z, i, q->column, q->value); q = q->next; } } /*row of x and y not empty*/ if (x[i] != NULL && y[i] != NULL) { p = x[i]; q = y[i]; /*stay in while loop until one row runs out*/ while (p != NULL q != NULL) { /*columns match*/ if (p->column == q->column && p != NULL && q != NULL) { Insert(z, i, p->column , p->value + q->value); p = p->next; q = q->next; } /*column of x is smaller than column of y*/ else if (p->column < q->column) { Insert(z, i, p->column , p->value); p = p->next; } /*column of x is bigger than column of y*/ else { Insert(z, i, q->column , q->value); q = q->next; } } /*if row of x had more elements and didn't run out*/ if (p != NULL) { while (p != NULL) { Insert(z, i, p->column , p->value); p = p->next; } } /*if row of x had more elements and didn't run out*/ if (q != NULL) { while (q != NULL) { Insert(z, i, q->column , q->value); q = q->next; } } } } Printout(z); } /* FREE MEMORY*/ void Freedom (element *x[]) { int i; element *p; for (i=0; i<3; i++) { if (x[i] != NULL) { p = x[i]; x[i] = x[i]->next; free(p); } } } /* MAIN */ int main (int argc, const char * argv[]) { int choice, column, row, value, number; element *a[3], *b[3], *sum[3]; Init(a); Init(b); Init(sum); do { Menu(); scanf("%d",&choice); switch (choice) { case 1: /*Insert in A */ do { printf("Enter row -> "); scanf("%d",&row); } while (row < 0 row > 3); do { printf("Enter column -> "); scanf("%d",&column); } while (column < 0); printf("Enter value -> "); scanf("%d",&value); Insert(a,row,column,value); break; case 2: /*Insert in B */ do { printf("Enter row -> "); scanf("%d",&row); } while (row < 0 row > 2); do { printf("Enter column -> "); scanf("%d",&column); } while (column < 0); printf("Enter value -> "); scanf("%d",&value); Insert(b,row,column,value); break; case 3: /* Printout A & B */ printf("\n::::::: MATRIX A :> \n\n"); Printout(a); printf("\n::::::: MATRIX B :> \n\n"); Printout(b); break; case 4: /* A + B */ Init(sum); printf("\n::::::: MATRIX A + B :> \n\n"); Add(a,b,sum); break; default: printf("\nWRONG CHOICE"); } } while (choice != 0); Freedom(a); Freedom(b); Freedom(sum); return 0;

}

#include<stdio.h>

void findfact(int num)

{

int i;

for(i=1;i<num;i++)

{

if(num%i==0)

printf("Factor for %d is %d\n",num,i);

}

}

main()

{

int a;

printf("\nEnter a number:");

scanf("%d",&a);

findfact(a);

}

patni

#include<stdio.h>

#include<conio.h>

void main()

{

int i,j,k,a[10],n;

clrscr();

scanf("%d",&n);

for(i=0;i<3;i++)

{

n=n%10;

j=0;

a[j]=n;

j++;

}

for(j=0;j>3;j++)

{

a[k]=0;

a[k]=a[k]+a[j];

avg=(a[k]/3);

printf("the average value of digit will be %d",avg);

}

getch();

}

}

Non-parametric statistical methods.

largestNum = 0;

for ( i = 0; i < 10 ; i++)

{

if ( currentNum[i] > largestNum)

largestNum = currentNum[i];

}

recu

First, review the definition of an Armstrong, or narcissistic, number:

"...is a number that is the sum of its own digits each raised to the power of the number of digits."

So, you need to count the digits (to know what power to use), and extract the individual digits. This can be done in several ways; for example, you might convert the number to a string. In Java:

String numberAsString = "" + number;

Now it should be easy to figure out the length of the String (use the .length() method), and to extract the individual digits - check the methods available for strings. Then you need to convert the digits back to numeric data.

Another way is to get one digit at a time, starting from the right, using the "%" operator.

For example, 153 % 10 is equal to 3. Divide the number, 153, by 10 (integer division), then repeat to get the remaining digits. You might store the digits to an array.

First, review the definition of an Armstrong, or narcissistic, number:

"...is a number that is the sum of its own digits each raised to the power of the number of digits."

So, you need to count the digits (to know what power to use), and extract the individual digits. This can be done in several ways; for example, you might convert the number to a string. In Java:

String numberAsString = "" + number;

Now it should be easy to figure out the length of the String (use the .length() method), and to extract the individual digits - check the methods available for strings. Then you need to convert the digits back to numeric data.

Another way is to get one digit at a time, starting from the right, using the "%" operator.

For example, 153 % 10 is equal to 3. Divide the number, 153, by 10 (integer division), then repeat to get the remaining digits. You might store the digits to an array.

First, review the definition of an Armstrong, or narcissistic, number:

"...is a number that is the sum of its own digits each raised to the power of the number of digits."

So, you need to count the digits (to know what power to use), and extract the individual digits. This can be done in several ways; for example, you might convert the number to a string. In Java:

String numberAsString = "" + number;

Now it should be easy to figure out the length of the String (use the .length() method), and to extract the individual digits - check the methods available for strings. Then you need to convert the digits back to numeric data.

Another way is to get one digit at a time, starting from the right, using the "%" operator.

For example, 153 % 10 is equal to 3. Divide the number, 153, by 10 (integer division), then repeat to get the remaining digits. You might store the digits to an array.

First, review the definition of an Armstrong, or narcissistic, number:

"...is a number that is the sum of its own digits each raised to the power of the number of digits."

So, you need to count the digits (to know what power to use), and extract the individual digits. This can be done in several ways; for example, you might convert the number to a string. In Java:

String numberAsString = "" + number;

Now it should be easy to figure out the length of the String (use the .length() method), and to extract the individual digits - check the methods available for strings. Then you need to convert the digits back to numeric data.

Another way is to get one digit at a time, starting from the right, using the "%" operator.

For example, 153 % 10 is equal to 3. Divide the number, 153, by 10 (integer division), then repeat to get the remaining digits. You might store the digits to an array.

printf ("3*19 is %d\n", sizeof (char [19][3]));

Warning: never do this in an actual program!

Mainly, we store values in them.