GPD-Zusammenfassung

Question 1

Number Systems: What are they? Give examples

Answer 1

• Decimal system (base 10)
• Dual system (binary system, base 2)
• Oktalsystem (Basis 8)
  o The octal system can be composed of 3 binary digits
   (110111100)2 (674)8
• Hexadezimalsystem (Basis 16)
  o The hexadecimal system can be composed of 4 binary digits
   (110111100)2 (1BC)16
• To facilitate the conversion/reading can be filled in case of “missing” bits  (000110111100)2

Question 2

Information Display: Explain machine type limitations

Answer 2

• the machine types are limited by the cpu in the number of available bits

Question 3

Define and Explain: Byte, Word, Doubleword, quadword

Answer 3

o Byte  consists of 8 bits
 Value range from 0 – 255 available (28 possible values)
o word  consists of 16 bits
 Value range from 216 -1 (216 possible values)
o Doubleword consists of 32 bits
 Value range from 232 -1 (232 possible values)
o Quadword  consists of 64 bits
 Value range from 264 -1 (264 possible values)

Question 4

Integers: Explain

Answer 4

there are two types of
 unsigned and signed integers
unsigned integers use their assigned memory space to display a positive value which is (2(po)(bits))-1 as the highest value
signed integers split the available space to display both negative and positive value -> -(2(po)(bits-1))…. -1 and 0 … (2(po)(bits-1))-1

Question 5

Signed Data Types: Define and Explain

Answer 5

o Byte (8 Bit)
 -128 to +127
 Value range from -27 to +27 -1 (since a value is occupied by the 0)
o Short (16 Bit)
 -32,768 to +32,767
 Value range from -215 to +215 -1 (since a value is occupied by the 0)
o Integer (32 Bit)
 -2,147,483,648 to +2,147,483,647
 Value range from -231 to +231 -1 (since a value is occupied by the 0)
o Long (64 Bit)
 -9 * 1018 to +9 *1018
 Value range from -263 to +263 -1 (since a value is occupied by the 0)

Question 6

Overflow: Define and explain

Answer 6

An overflow means that if the memory area is exceeded, the value is set to 0.
Bespiel: (1111)2 + (0001)2 = (0000)2
This applies to unsigned as well as signed.

Question 7

Floating: Define & Explain

Answer 7

o Sizes
 Single Precision (32 Bit)
 Double Precision (64 Bit)
o Floating-point number issues
 Floating-point numbers are not compatible with integers due to different binary representations
 Some values cannot be displayed correctly (0.1)

Question 8

Booelean Algebra: Arithmetic Signs: define example

Answer 8

o „ ∙ “ bzw. „ * “ = UND / AND
o “ + “ = OR / OR
o “ ! “ or “ ̄ “ = reversal / NOT

Question 9

Logical Operations: Define explain

Answer 9

o Konjunktion (UND / AND)
 Only true if all are true
o Disjunction (OR/ OR)
 Wrong only if everyone is wrong
o Negation (Reversal / NOT / Inverse / Complement)
 Reversal  ! TRUE = FALSE or ! FALSE = TRUE
- Important:
o It always applies AND before OR (dot before dash if you take the “ ∙ “ and the “ + “ )

Question 10

Character codes (data presentation): Codes: List and explain

Answer 10

• Agreements (codes)
  o ASCII (7 Bit)
  o ISO Latin-1 (8859-1) (8 Bit)
  o UTF – 8 (ISO 10646 – R) (8 Bit)
  o Unicode (16 Bit)
  o UCS – 4 (32 Bit)
• Differences
  o The bit sizes are different
  o The character set is different

Question 11

Algorithm: What is an algorithm? What are the 3 basic actions? What are the properties?

Answer 11

• What is an algorithm?
  o An algorithm accurately and completely describes a systematic and step-by-step solution to a problem.
  o An algorithm is a detailed and explicit rule for the step-by-step solution of a problem.
  o Choose something from :D
• What are the three basic actions?
  o Statement / Sequence
  o Branching / Alternatives / Decision
  o Repetition (= decision with conditional jump)
• Properties
  o Determiniertheit
   It is clear which step comes next
  o Determinism
   Same start condition  same result
  o Terminiertheit
   The algorithm comes to an end

Question 12

PAP: Explain and give examples

Answer 12

o Graphical elements
 Instruction

 Ramification

 Control block (start and end)

 Arrows / Connections

o Example
- Struktogramm (Nassi Schneider Diagram)

Question 13

Programming Languages: Different paradigms/types? Descriptions?

Answer 13

o Hardware-related languages
 Machine Language / Assembler
o Higher level programming languages
 imperative / procedural BASIC, Pascal, C
 object-oriented C++, C#, Java
 functional Lisp, Haskell
 logical Prolog
 nebenläufig Ade, Scala
 Scripting languages PHP, JavaScript, Python
 Markup/printout languages HTML/CSS, XML, latex
- Formal descriptions of programming languages
o Syntax
 External textual form
 Symbols used (characters, words)
o Semantics
 Meaning of symbols (characters, words)
o Pragmatics
 Intention of the programmer with regard to the totality of the
Computer program

Question 14

IDE: Define and explain components.

Answer 14

• Components of a programming system
  o Quelltext (Source Code / src)
   The program in the programming language (available in text form)
  o Translator (compiler)
   Conversion Source  Code CPU Commands
  o Binder (linker)
   Merging Software Modules
  o Editor (Schreibprogramm)
   Syntax Highlighting (Syntax Checking)
   Auto Completion
   Refactoring
  o Debugger
   Diagnosing and finding errors
  o Library (Libary)
   Already finished programs
  o Laufzeitumgebung (Runtime Enviroment)
   e.g. virtual machine
   of the programming language
   of the operating system