Computer Programming

#include<stdio.h> #include<conio.h> #include<math.h> #include<graphics.h> void draw_line(float,float,float,float); main() { int driver,mode; float x1,y1,x2,y2; clrscr(); printf("Enter the two endpoints of the line:"); printf("\nx1 ="); scanf("%f",&x1); printf("y1 ="); scanf("%f",&y1); printf("x2 ="); scanf("%f",&x2); printf("y2 ="); scanf("%f",&y2); clrscr(); driver = DETECT; initgraph(&driver,&mode,"\\tc\\bgi"); \\path of bgi can be different in your case draw_line(x1,y1,x2,y2); getch(); closegraph(); } void draw_line(float x1,float y1,float x2,float y2) { float dy,dx; float x,y; float p,p0,dp1,dp2; dy = y2-y1; dx = x2-x1; p0 = 2 * (dy - dx); dp1 = 2 * dy; dp2 = 2 * (dy - dx); putpixel(x1,y1,EGA_WHITE); p = p0; for(x=x1+1,y=y1;x<x2;x++) { if(p < 0) { p = p+dp1; putpixel(x,y,EGA_WHITE); } else { p = p+dp2; y++; putpixel(x,y,EGA_WHITE); } }

Mail merge is a facility of Microsoft's Word program, and other wordf processing applications.

It allows the user to set up a form letter, with blank spaces in certain parts.

The user then sets up a mini-database, or uses an existing database, to send a personalised copy of the letter to people in the database, with the blank spaces being filled by their particulars... the process adjusts the text of the letter so that even if the entry is extremely long, or extremely short, the recipient thinks that the letter is unique to them.

It can also be used just to print address labels.

It can do but it is really the other way around. A 32-bit operating system can work with a 64-bit processor. However, if the processor doesn't have a "soft" switching mode, you will have to manually switch the 64-bit processor to 32-bit mode via the CMOS setup.

Ideally you should install a 64-bit operating system and leave the processor in 64-bit mode. This will then allow you to run 32-bit programs and 64-bit programs side-by-side.

Assuming you're using the C programming language (as you did not specify any other), and that you're making some sort of arithmetic tester, a simple answer would be:

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

int main()

{

time_t seconds;

time(&seconds);

srand((unsigned int)seconds);

int num1 = (rand()%100);

int num2 = (rand()%100);

int sum = num1 + num2;

int ans;

printf("What is %d + %d? ", num1, num2);

scanf("%d", &ans);

if(ans == sum) printf("Correct!");

else printf("Wrong, correct answer is %d", sum);

return 0;

}

The reason is your cmos battery is about to die. All desktop PCs use a small lithium battery, similar to those used by hand-held calculators to keep time and date info. Once this battery runs low on voltage, your date and time will be shown incorrectly.

The solution: unplug your PC, open the case and carefully extract the battery (use a small flashlight). Buy a new one of the same number (cr2032, cr2025, etc.) and install it the right way. Don't worry, it will fit only one way. Now turn your PC on and set the time and date and that's it, no problem with that for a good few years. Hope this helps.

Printf returned no. of character receive .

scanf return no of variable to be inputed according to format specifier . eg:

i=printf("thisisc") printf("%d",i); //i=7 j=scanf("dd",&a,&b,&c,&d); printf("%d",j);

IT IS MOST APPROPRIATE ANSWER FOR THIS Q .......... PLZ DO Practically............

In CQ we utilize memory efficiently. because in queue when we delete any

element only front increment by 1, but that position is not used later. so when

we perform more add and delete operation, memory wastage increase. But in CQ

memory is utilized, if we delete any element that position is used later,

because it is circular.

Queue is better than stack because jobs in a queue are processed on a first in first out order thereby reducing traffic and delay.

But jobs in a stack are processed in a last in first out order causing traffic and delay of jobs that arrived earlier

to draw-pentagon :length

pd

seth 126

repeat 5 [ fd :length rt 72 ]

end

Draws a pentagon "length" pixels on each side, with the turtle originating and terminating at the apex.

An interpreter, or a translator, is a person who translates different languages. For an example, if a Chinese person and an American person can't understand each other, an intepreter can translate for both of them.

It is a programming language with strong abstraction from the details of the computer.

#include<stdio.h>

#include<conio.h>

#include<process.h>

#include<math.h>

void main()

{

int n;

int i,j;

float ax[10];

float ay[10];

float x;

float y=0;

float h;

float p;

float diff[20][20];

float y1,y2,y3,y4;

clrscr();

printf("\t\t!! NEWTON GRAGORY FORWARD INTERPOLATION FORMULA!!\n");

printf("\t\t By KRISHAN \t\t\n");

printf("\t\t enter the no of terms ->");

scanf("%d",&n);

printf("\n\t\t enter the value in form of x->");

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

{

printf("\n\t\t enter the value of x%d->",i+1);

scanf("%f",&ax[i]);

}

printf("\n\t\tenter the value in the form of y->");

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

{

printf("\n\t\tenter the value of y %d->",i+1);

scanf("%f",&ay[i]);

}

printf("\n\t\tenter the value of x for");

printf("\n\t\t which u want the value of y->");

scanf("%f",&x);

h=ax[1]-ax[0];

for(i=0;i<n-1;i++)

diff[i][1]=ay[i+1]-ay[i];

for(j=2;j<=4;j++)

for(i=0;i<n-j;i++)

diff[i][j]=diff[i+1][j-1]-diff[i][j-1];

do

{

i++;

}

while(ax[i]<x);

i--;

p=(x-ax[i])/h;

y1=p*diff[i-1][1];

y2=p*(p+1)*diff[i-1][2]/2;

y3=p*(p+1)*(p-1)*diff[i-2][3]/6;

y4=(p+2)*(p+1)*p*(p-1)*diff[i-3][4]/24;

y=ay[i]+y1+y2+y3+y4;

printf("\n\t\t when x=%6.4f,y=%6.8f",x,y);

printf("\n\n\n\t\t\t!! PRESS ENTER TO EXIT!!");

getch();

}

We don't avoid loops in programming. Loops are a fundamental feature of many algorithms. If we need to iterate over a data sequence in order to perform the same set of operations upon each data element, we would use an iterative loop. If we need to repeatedly reduce a larger problem into one or more smaller instances of the same problem until the problem is small enough to be solved we'd use a recursive loop.

Sample code is as follows:

#include <stdio.h>

void main()

{

int i = 0;

int final_number = 0;

int array[] = {1,2,3,4,5};

for(i = 0; i < (sizeof(array)/sizeof(array[0])); i++)

{

final_number += array[i];

}

printf("Sum = %d and average = %d", final_number, (final_number / i));

}

Downloaded

translators

installing

programming

programmers

int main()

{

std::string first, last;

std::cout << "Enter your first name: ";

std::cin >> first;

std::cout << "Enter your last name: ";

std::cin >> last;

}

The queue insert operation is known is enqueue.

A queue has two ends namely REAR & FRONT. After the data has been inserted in a queue ,the new element becomes REAR.The queue deletion operation is known as dequeue.

The data at the front of the queue is removed .

We can define structure bit field members with Dot operators.

EXAMPLE:

#include <stdio.h>

int main()

{

Struct bit_field

{

Int x.4; // it allocates only 4 bits to x

Char C.6; // it allocates only 6 bits to C;

};

return 0;

}

Scalene sides are different lengthed

isosceles two of the 3 sides are the same

equilateral, the three sides are the same lenght and are all at 90degrees