Computer Programming: "Programming" Redirects Here. For Other Uses, See
Computer Programming: "Programming" Redirects Here. For Other Uses, See
Computer programming
From Wikipedia, the free encyclopedia
"Programming" redirects here. For other uses, see Programming (disambiguation).
• 1 Overview
• 2 History of programming
• 3 Modern programming
○ 3.1 Quality
requirements
○ 3.2 Algorithmic
complexity
○ 3.3 Methodologies
○ 3.4 Measuring
language usage
○ 3.5 Debugging
• 4 Programming languages
• 5 Programmers
• 6 References
• 7 Further reading
• 8 See also
• 9 External links
[edit]Overview
[edit]History of programming
See also: History of programming languages
Wired plug board for an IBM 402 Accounting Machine.
The concept of devices that operate following a pre-defined set of instructions traces
back to Greek Mythology, notably Hephaestus and his mechanical servants[3].
The Antikythera mechanism was a calculator utilizing gears of various sizes and
configuration to determine its operation. The earliest known
programmable machines (machines whose behavior can be controlled and predicted
with a set of instructions) were Al-Jazari's programmable Automata in 1206.[4] One of
Al-Jazari's robots was originally a boat with four automatic musicians that floated on
a lake to entertain guests at royal drinking parties. Programming this mechanism's
behavior meant placing pegs and cams into a wooden drum at specific locations.
These would then bump into little levers that operate a percussion instrument. The
output of this device was a small drummer playing various rhythms and drum
patterns.[5][6] Another sophisticated programmable machine by Al-Jazari was
the castle clock, notable for its concept of variables which the operator could
manipulate as necessary (i.e. the length of day and night). The Jacquard Loom,
which Joseph Marie Jacquard developed in 1801, uses a series of pasteboard cards
with holes punched in them. The hole pattern represented the pattern that the loom
had to follow in weaving cloth. The loom could produce entirely different weaves
using different sets of cards. Charles Babbage adopted the use of punched
cards around 1830 to control his Analytical Engine. The synthesis of numerical
calculation, predetermined operation and output, along with a way to organize and
input instructions in a manner relatively easy for humans to conceive and produce,
led to the modern development of computer programming. Development of
computer programming accelerated through the Industrial Revolution.
In the late 1880s Herman Hollerith invented the recording of data on a medium that
could then be read by a machine. Prior uses of machine readable media, above, had
been for control, not data. "After some initial trials with paper tape, he settled
on punched cards..."[7] To process these punched cards, first known as "Hollerith
cards" he invented the tabulator, and the key punch machines. These three
inventions were the foundation of the modern information processing industry. In
1896 he founded the Tabulating Machine Company (which later became the core
ofIBM). The addition of a control panel to his 1906 Type I Tabulator allowed it to do
different jobs without having to be physically rebuilt. By the late 1940s there were a
variety of plug-board programmable machines, called unit record equipment, to
perform data processing tasks (card reading). Early computer programmers used
plug-boards for the variety of complex calculations requested of the newly invented
machines.
Data and instructions could be stored on external punch cards, which were kept in order
and arranged in program decks.
[edit]Modern programming
[edit]Quality requirements
Whatever the approach to software development may be, the final program must
satisfy some fundamental properties. The following five properties are among the
most relevant:
Efficiency/performance: the amount of system
resources a program consumes (processor time,
memory space, slow devices such as disks, network
bandwidth and to some extent even user interaction):
the less, the better. This also includes correct disposal
of some resources, such as cleaning up temporary
files and lack of memory leaks.
Reliability: how often the results of a program are
correct. This depends on conceptual correctness of
algorithms, and minimization of programming
mistakes, such as mistakes in resource management
(e.g. buffer overflows and race conditions) and logic
errors (such as division by zero).
Robustness: how well a program anticipates
problems not due to programmer error. This includes
situations such as incorrect, inappropriate or corrupt
data, unavailability of needed resources such as
memory, operating system services and network
connections, and user error.
Usability: the ergonomics of a program: the ease with
which a person can use the program for its intended
purpose, or in some cases even unanticipated
purposes. Such issues can make or break its success
even regardless of other issues. This involves a wide
range of textual, graphical and sometimes hardware
elements that improve the clarity, intuitiveness,
cohesiveness and completeness of a program's user
interface.
Portability: the range of computer
hardware and operating system platforms on which
the source code of a program can
becompiled/interpreted and run. This depends on
differences in the programming facilities provided by
the different platforms, including hardware and
operating system resources, expected behaviour of
the hardware and operating system, and availability of
platform specific compilers (and sometimes libraries)
for the language of the source code.
[edit]Algorithmic complexity
The academic field and the engineering practice of computer programming are both
largely concerned with discovering and implementing the most
efficient algorithms for a given class of problem. For this purpose, algorithms are
classified into orders using so-called Big O notation,O(n), which expresses resource
use, such as execution time or memory consumption, in terms of the size of an
input. Expert programmers are familiar with a variety of well-established algorithms
and their respective complexities and use this knowledge to choose algorithms that
are best suited to the circumstances.
[edit]Methodologies
The first step in most formal software development projects is requirements
analysis, followed by testing to determine value modeling, implementation, and
failure elimination (debugging). There exist a lot of differing approaches for each of
those tasks. One approach popular forrequirements analysis is Use Case analysis.
Popular modeling techniques include Object-Oriented Analysis and Design (OOAD)
and Model-Driven Architecture (MDA). The Unified Modeling Language (UML) is a
notation used for both OOAD and MDA.
A similar technique used for database design is Entity-Relationship Modeling (ER
Modeling).
Implementation techniques include imperative languages (object-
oriented or procedural), functional languages, and logic languages.
[edit]Measuring language usage
It is very difficult to determine what are the most popular of modern programming
languages. Some languages are very popular for particular kinds of applications
(e.g., COBOL is still strong in the corporate data center, often on
large mainframes, FORTRAN in engineering applications, and C in embedded
applications), while some languages are regularly used to write many different kinds
of applications.
Methods of measuring language popularity include: counting the number of job
advertisements that mention the language[8], the number of books teaching the
language that are sold (this overestimates the importance of newer languages), and
estimates of the number of existing lines of code written in the language (this
underestimates the number of users of business languages such as COBOL).
[edit]Debugging
A bug which was debugged in 1947.
[edit]Programming languages
Main articles: Programming language and List of programming languages
Different programming languages support different styles of programming
(called programming paradigms). The choice of language used is subject to many
considerations, such as company policy, suitability to task, availability of third-party
packages, or individual preference. Ideally, the programming language best suited
for the task at hand will be selected. Trade-offs from this ideal involve finding enough
programmers who know the language to build a team, the availability
of compilers for that language, and the efficiency with which programs written in a
given language execute.
Allen Downey, in his book How To Think Like A Computer Scientist, writes:
The details look different in different languages, but
a few basic instructions appear in just about every
language:
input: Get data from the keyboard, a file, or
some other device.
output: Display data on the screen or send data
to a file or other device.
math: Perform basic mathematical operations
like addition and multiplication.
conditional execution: Check for certain
conditions and execute the appropriate
sequence of statements.
repetition: Perform some action repeatedly,
usually with some variation.
Many computer languages provide a mechanism to
call functions provided by libraries. Provided the
functions in a library follow the appropriate runtime
conventions (eg, method of passing arguments), then
these functions may be written in any other language.
[edit]Programmers