Even number upto a range[c programming examples with output]

C programming examples with output

Even number upto a range

Program

#include<stdio.h>

#include<conio.h>

main()

{

int a,b;

clrscr();

printf("Enter the range: ");

scanf("%d",&a);

b=1;

while(b<=a)

{

        if(b%2==0)

          printf("%d/t",b);

          b++;

}

getch();

}

Output

Enter the range:10

2     4     4     8    10

Check others programming by click here:

Factorial of a number:

Find sum of digits of a number:

Find vowel or not:

Palindrome Number:

Find Armstrong Number:
Find Average Of Odd Numbers Below A Range:
Find perfect number or not:

Even number upto a range:

Find the biggest number out of three numbers:
Prime or Not Prime:
Find result of a student:
Swapping of two integers:
Floyd's Triangle

Find biggest number out of three numbers [c programming examples with output]

C programming examples with output

Find the biggest number out of three numbers

Program:

#include<stdio.h>

#include<conio.h>

main()

{

int a,b,c;

clrscr();

printf("Enter any three numbers : ");

scanf("%d%d%d",&a,&b,&c);

if((a>b) && (a>c))

    printf("The big number: %d",a);

else if(b>c)

          printf("The big number: %d",b);

else

          printf("The big number: %d,c);

getch();

}

Output

Enter any three numbers :1

2

3

The big number          :3

Check others programming by click here:

Factorial of a number:

Find sum of digits of a number:

Find vowel or not:

Palindrome Number:

Find Armstrong Number:
Find Average Of Odd Numbers Below A Range:
Find perfect number or not:

Even number upto a range:

Find the biggest number out of three numbers:
Prime or Not Prime:
Find result of a student:
Swapping of two integers:
Floyd's Triangle

check prime number or not [c programming examples with output]

C programming examples with output:

Prime or Not Prime

Program:

#include<stdio.h>

#include<conio.h>

main()

{

int a,b,c;

clrscr();

printf("Enter any number : ");

scanf("%d",&a);

b=1;

c=0;

while(b<=a)

{

if(a%b==0)

c=c+1;

b++;

}

if(c==2)

printf("%d is a prime number",a);

else

printf("%d is not a prime number",a);

getch();

}

Output:

Enter any number: 2

2 is a prime number

Enter any number:4

4 is not a prime number

Check others programming by click here:

Factorial of a number:

Find sum of digits of a number:

Find vowel or not:

Palindrome Number:

Find Armstrong Number:
Find Average Of Odd Numbers Below A Range:
Find perfect number or not:

Even number upto a range:

Find the biggest number out of three numbers:
Prime or Not Prime:
Find result of a student:
Swapping of two integers:
Floyd's Triangle

Magnetic Core Memory[What Is Magnetic Core Memory]

Magnetic Core Memory

Magnetic Core Memory

Magnetic core memory is a non-volatile random access memory. In 1951 at MIT magnetic core memory was developed. Almost all early computers used the magnetic core as their primary internal memory before the wide availability of semiconductor memory. The basic magnetic core memory cell is a small doughnut-shaped core which was made of a ferromagnetic material. These cores are called ferrite cores. Its diameter is almost 0.05 inch. Here in magnetic core memory, there is a small wire which threaded through the centre of the magnetic core. When a current pulse is passed through in this wire, a magnetic flux is set up in the core in a direction that depends on the direction of the current. Because of the magnetic retentivity of the core, it stays magnetized even after the current pulse is terminated. In other words, it is non-volatile. The two directions of magnetization are used to represent 1 and 0, respectively. Stored data are read from a core by magnetizing it in the 0 direction and using a second threaded wire as a sense wire. The size of the voltage induced in the sense wire will be greater if the core is initially in 1 state rather than 0 state. The reading of a magnetic core memory is said to be destructive since it always leaves in 0 state. Thus, the data can be rewritten after a read operation.

The magnetic core memory system has access times from 100ns to 500ns. It can still be found in some old minicomputers and mainframes. But for all practical purposes, their large physical size and complex interface circuitry have made them virtually obsolete.