answersLogoWhite

0


Best Answer

An algorithm is a set of instructions that a computer follows, generally to accomplish one specific task. These tasks can range from sorting a set of numbers to finding the greatest common denominator of two numbers.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

14y ago

While there is no generally accepted formal definition of "algorithm", an informal definition could be "a process that performs some sequence of operations." For some people, a program is only an algorithm if it stops eventually. For others, a program is only an algorithm if it stops before a given number of calculation steps (http://en.wikipedia.org/wiki/Algorithm).

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is algorithm in basic computer science?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering
Related questions

How many basic constructs are in computer science?

Computer Scientists have defined three constructs for a structured program or algorithm. Sequence, decision (selection), and repetition.


In term of computer science what is deterministic algorithm?

In computer science, deterministic algorithm is an algorithm which, given a particular input, always produces the same result. This is used to increase the efficiency of machines.


How do you use the word algorithm in a sentence?

Algorithm is a kind of programming very used on computer science,


What are importance of algorithm?

Algorithms are the foundation of computer Science, it is telling the computer to do the task in the most efficient matter. An algorithm is particularly important in optimizing a computer program, the efficiency of the algorithm usually determines the efficiency of the program as a whole.


What is the algorithm for stony brook algorithm?

The Stony Brook Algorithm Repository is a collection of implementations for fundamental algorithms in computer science, hosted by Stony Brook University. There is no "Stony Brook Algorithm."


What is Vector generation algorithm?

It is a basic algorithm for generating lines on computer screen. line is generated between given 2 endpoints


Divide and conquer what does it mean?

Divide and conquer is computer science. It is an important algorithm design.


What is the meaning of algol in terms of computer?

ALGOL is a family of programming languages, developed in the 1950s, that was intensely influential on the development of algorithm description computer science.


What are the applications of Eigenvalue and Eigen vector in computer science?

Eigenvectors and eigenvalues are important for understanding the properties of expander graphs, which I understand to have several applications in computer science (such as derandomizing random algorithms). They also give rise to a graph partitioning algorithm. Perhaps the most famous application, however, is to Google's PageRank algorithm.


What math and computer science concentrations are geared towards algorithm development for software systems?

Generally computer sciences and engineering will require you to take either/or calculus and physics.


Is it mandatory to have computer science knowledge to learn c?

In order to learn 'c' language you've the basic knowledge about Computer.


What is parallism in computer science?

Parallelism is running processes simultaneously to maximize resources for faster processing.Actually, that's incorrect. Parallelism in computer science is a property of an algorithm used to solve a problem. The Parallelism of an algorithm is its ability to be broken into discrete, independent parts which can be operated on separately, then recombined to obtain the answer the algorithm was supposed to provide. The greater the number of discrete parts that the algorithm can be broken into, the higher the Parallelism."Parallelism" can, however, be used to characterize the ability of a processor to work on different tasks at once, in a manner analogous to that of describing the ability of an algorithm to work on different portions of a problem simultaneously.