Flow Chart to find Sum of Individual Digits of a Positive Integer

Flow Chart to find Sum of Individual Digits of a Positive Integer

here is flow chart for sum of digits 

flow chat for sum of square program

flow chat cprogram to accept a number from user and print the sum of square

flow chat for sum of square c program

C

heck out http://www.ElitheComputerGuy.com for all videos and more.

Windows 10 Technical Preview Review

Today's Topic:
We demonstrate the new Windows 10 Technical Preview. We show off the "new" Start menu, Live Tiles and other basic usage of Windows 10.

Overall Windows 10 is easy to understand for anyone used to using Windows and will be a welcome relief for anyone who hates Windows 8 or 8.1.

You can download the Windows 10 Technical Preview here: http://windows.microsoft.com/en-us/wi...

Today's Review:
Inateck Bluetooth Audio Receiver for Speakers: http://www.inateck.com/inateck-br1001...

Today's Questions:
"How should Aspies and Neurotypicals talk to each other?"

Windows 10 Technical Preview Review

""What do you mean when you say someone's brain has to be wired in a certain way to be successful in IT?"

Today's Final Thoughts:
Am I excited about Windows 10?

Flowchart for prime number

Flowchart for prime number

Q. Draw the flowchart diagram for check a number is prime number or not.

Ans.

Flowchart for check a number is prime or not as following:

Figure: Flowchart for check given number is
prime number or not

Generate first n Prime number

Generate first n Prime number

Q. Write a C program to generate first n prime number C program.

Ans.

/*c program for generate first n prime number*/
#include<stdio.h>
#include<conio.h>
int main()
{
 int n,num,t,div,count;
 printf("How many prime number you want to print: ");
 scanf("%d", &n);
 printf("\n%d\t",2); /*2 is first prime number*/
 count=1;
 num=3;
 while(count<n)
 {
  t=sqrt(num);
  div=2;
  while(div<=t)
  {
    if(num%div==0)
       break;
    div++;
  }
  if(div>t)
  {
     printf("%d\t",num);
     count++;
  }
  num=num+2;
 }
 getch();
 return 0;
}

search prime number

search prime number

Q. Write a C program to find whether a number is prime or not.

Definition of prime number:A prime number is one,which is divisible only by one or itself. And its must greater than 1.

And if number is not prime, it is called composite number and vice versa.

Ans.

#include<stdio.h>

#include<stdio.h>

int main()

{

 int x,num;

 printf("Enter number : ");

 scanf("%d",&num);

 x=2;

 while(x<=num-1)

 {

   if(num%x==0)

   {

      printf("Number is not prime!!");

      break;

   }

   x++;

 }

 if(x==num)

    printf("Number is prime!!");
 getch();

 return 0;

}

Flowchart for finding Armstrong number C program

Flowchart for finding Armstrong number C program:

Figure: Flowchart for finding number is 
Armstrong or not C program