Computer Programming

You don't need a flow chart for that; just use the quadratic formula directly; most programming languages have a square root function or method. You would only need to do this in many small steps if you use Assembly programming. The formulae would be something like this:

x1 = (-b + sqrt(b^2 - 4*a*c)) / (2 * a)

and

x2 = (-b - sqrt(b^2 - 4*a*c)) / (2 * a)

where a, b, and c are the coefficients of the quadratic equation in standard form, and x1 and x2 are the solutions you want.

hai guy, you see the word art in ms word application?? the typed word art text is the object. when you double click on it it will display the wordart text editor . so the object links the editor. that y called ole. regards s.s.senthil kumar Tamilnadu, India hai guy, you see the word art in ms word application?? the typed word art text is the object. when you double click on it it will display the wordart text editor . so the object links the editor. that y called ole. regards s.s.senthil kumar Tamilnadu, India ssmailid@yahoo.com

Depends on what they're doing and who they work for. Look at a site such as Monster or go through the classifieds in your newspaper to get an idea. Very roughly, it could range from as low as $30K a year (very low) to over $100K a year.

== ==

It depends what language you are using and how the function is implemented. However, generally, you need to pass 4 arguments to the function:

1. A reference to the array.

2. The lower bound of the sub-array to be sorted (usually 0).

3. The upper bound of the sub-array to be sorted (usually n-1 for an array of n elements).

4. A binary predicate to perform comparisons between the elements (usually a less-than predicate).

Firstly, thanks for trying solve this algorithm.

I will rewrite the wrong way and debug it in the next line, and the causes in th last line , O right?


wrong:void delete(int n).
debug:void delete_node(node* list, int n).
causes:
-You have to include the name of the list from which you want to delete a node. -you used delete as a name of the function, and that is impossible because delete is a predefined function, use delete_node for example.




wrong:you didn't affect the address of the list to the temporary pointer named here P.
debug:p=list.
causes:
-one of the disadvantages of the chained list -unlike contiguous list-is: to arrive to the the required node, we have to traverse all previous nodes to get the required one, therefor we use that temporary pointer, and this latter mast have to start from the first node names here list.


the rest is right, try this code, I think it works::


void delete_node(node *list, int n)
{
node *p;
p=list;
int i=1;
while(i
{
p=p->next;
++i;
}
node *q;
q=p->next;
p->next=q->next;
free(q);
}



Best regards of InfoMan.

You first determine the algebraic numerical equilibrium ( algorythm ) and divide it by the sum of the true algebraic expression (X)-(X=?>y^Zy<~=X)Answer. Basic Pythagoras Theorem co-tangent w/equilibrium.

KB is kilobyte 1 thousand bytes
MB is megabyte 1 million bytes

BASIC , FORTRAN ,COBOL , PASCAL are high level lanhuages which are simply understood by us used in the computers.

A watt is a unit of power referring to rate of energy conversion. It is equal to one Joule per second. A kilowatt is equal to 1,000 watts - a unit of energy equal to approximately 1.34 Horsepower.

Basically it's all of your networks and supporting systems and in some cases the entire IT department as well.

Programming languages are categorized into generations based on their level of abstraction and ease of use.

1. First Generation (1GL): These are low-level languages, primarily machine code, which are specific to a computer's architecture and require extensive knowledge of hardware.

2. Second Generation (2GL): Assembly languages fall into this category, providing a slightly higher abstraction with mnemonic codes representing machine instructions, making it easier for programmers to write code.

3. Third Generation (3GL): High-level languages like C, Java, and Python focus on human readability and abstraction from hardware, allowing for more complex programming without detailed knowledge of the machine.

4. Fourth Generation (4GL): These languages are even more abstract, often domain-specific, and designed for specific tasks like database management, enabling rapid application development with less code.

5. Fifth Generation (5GL): This generation involves languages used for artificial intelligence and incorporates constraints and logic programming, focusing on solving problems rather than writing code.

computer hacking :)

Well in C++:

#include <iostream>

int main()

{

char x;

for(int i = 0; i < 255; i++)

{

x = i;

std::cout << i << "\t" << x << std::endl;

}

char wait;

std::cin >> wait;

return 0;

}

Many modern websites use XHTML now; although some are still left in the dark, pondering with HTML. Thus, many corporations, businesses, organizations, freelancers, entertainers, general website developers, and others use XHTML.

Yes.EasyTreve Plus has both an interpreted and a compiled version available.

in c program the smallest individual unit is called c-token

#include <stdio.h>

int main() {

int TimesTable[12][12] = { {1,2,3,4,5,6,7,8,9,10,11,12}, {1,2,3,4,5,6,7,8,9,10,11,12} };

int a, b;

for (a = 1; a <= 12; ++a) {

for (b = 1; b <= 12; ++b) {

TimesTable[a][b] = a*b;

printf("%5d", a*b);

}

printf("\n\n");

}

return 0;

}

It converts machine level language to high level language simultaneously...and vice versa..

An Assembler converts assembly language instructions into machine language.