Sequence

Infinite sequences of digits (or characters) drawn from a finite alphabet are of particular interest in theoretical computer science. They are often referred to simply as sequences or streams, as opposed to finite strings. Infinite binary sequences, for instance, are infinite sequences of bits (characters drawn from the alphabet {0,1}). The set C = {0, 1}^∞ of all infinite, binary sequences is sometimes called the Cantor space.

An infinite binary sequence can represent a formal language (a set of strings) by setting the n th bit of the sequence to 1 if and only if the n th string (in shortlex order) is in the language. Therefore, the study of complexity classes, which are sets of languages, may be regarded as studying sets of infinite sequences.

Flowchart

A flow iagram is often synonymous with Data Flow Diagram – a graphical representation of the information flow in a computer program.

High Level Computer Language

An advanced computer programming language that isn't limited by the computer or for one specific job and is more easily understood. Today, there are dozens of high-level languages; some commonly used high-level languages are BASIC, C, FORTAN, Java, and Pascal.

Machine Language

Machine code or machine language is a system of atomic instructions executed directly by a computer's central processing unit.

Pseudocode

Also called a symbolic code, it is a program code unrelated to the hardware of a particular computer and requiring conversion to the code used by the computer before the program can be used.

 

Computer algorithms

Algorithms: These are essential to the way computers process information, because a computer program is essentially an algorithm that tells the computer what specific steps to perform (in what specific order) in order to carry out a specified task, such as calculating employees' paychecks or printing students' report cards. Thus, an algorithm can be considered to be any sequence of operations which can be performed by a Turing-complete system.