Programming 2012/13 Flashcards
What is computation?
Computation is a general term for any type of information processing that can be represented mathematically (e.g. simple calculations, human thinking(?)).
In a more narrow meaning:
Computation is a process following a well defined model that is understood and can be expressed in an algorithm.
What is CompSci?
Applied Mathematics.
Research into what is computable.
Solving problems and optimization of solutions in time and space.
CompSci Subdisciplines:
- Technical (Digital Circuits, Robots, Networks) - embodied approach
- Practical (Algorithms, Data Structures, Programming)
- Theoretical (Math, Formal Languages, Complexity)
- Applied (Operating Systems, Applications, Web)
Name of the first programmer?
Ada Lovelace
Name some parts of a von Neumann architecture!
Bus, CPU, RAM, ROM, HD, Monitor, Keyboard
Levels of abstraction in a computer:
Internet Apps Operating System High-Level Language (compiled, interpreted) Assembly Machine Language Logic Gates and Binary FET (Field Effect Transistor)
HW/SW
The distinction is irrelevant. Computer is build to transform one level of abstraction into another -> moving up and down on the levels of abstraction
Classes of computation:
- digital vs. analog
- sequential vs. parallel
- batch vs. interactive
Name to interpreted programming languages!
C and C++
Name one interpreted language and a special case!
Python Java (both compiled and interpreted)
Who is Boolean Logic named after?
George Boole
What does identity, tautology, contradiction and negation mean?
id taut contr neg
11 1 0 0
00 1 0 1
How can mathematics be defined?
It is the building of interesting systems. (our number system seems to be very interesting)
What does an axiom do?
It postulates what we require of a formal system (rules).
5 Axioms for natural numbers:
- 0 is a natural number.
- For every natural number n, S(n) is a natural number.
- For every natural number n, S(n) = 0 is false.
- For all natural numbers n and m, if S(n) = S(m), then m = n.
- If U is a set such that: 0 is in U, and for every natural number n, if n is in U, then S(n) is in U, then U contains every natural number.