Difference between revisions of "Computer science"
Hunterbender (talk | contribs) (→Computer programming) |
m |
||
Line 4: | Line 4: | ||
===Computer programming=== | ===Computer programming=== | ||
{{main|Computer programming}} | {{main|Computer programming}} | ||
− | '''Computer programming''' is the study of how algorithms can be applied through the use of various programming languages to create software utilities for the computer. Common programming languages include [[C++]], [[Java]], [[Visual Basic]], [[C#]], [[C]], and [[Pascal]]. Other languages differing slightly in usage from these are known as scripting languages. Examples are Perl, Python, Ruby and PHP. | + | '''Computer programming''' is the study of how algorithms can be applied through the use of various programming languages to create software utilities for the computer. Common programming languages include [[C++]], [[Java]], [[Visual Basic]], [[C#]], [[C]], and [[Pascal (language) | Pascal]]. Other languages differing slightly in usage from these are known as scripting languages. Examples are Perl, Python, Ruby and PHP. |
===Computability and complexity=== | ===Computability and complexity=== |
Revision as of 06:57, 14 October 2009
Computer science is the study of computers and computation, or more specifically, the algorithms used to obtain results with these tools.
Contents
[hide]Topics in computer science
Computer programming
- Main article: Computer programming
Computer programming is the study of how algorithms can be applied through the use of various programming languages to create software utilities for the computer. Common programming languages include C++, Java, Visual Basic, C#, C, and Pascal. Other languages differing slightly in usage from these are known as scripting languages. Examples are Perl, Python, Ruby and PHP.
Computability and complexity
- Main article: Computability and complexity
Computability and computational complexity are problems which concern the limits of algorithms to solve certain types of problems under certain constraints. For example, the P versus NP problem is such a problem.