Algorithmen

Question 1

Clock Cycle

Answer 1

Is the time separating one process step of CPU from the next. The clock rate is corresponding frequency. Typical values are nowadays 0.3 ns and 3 GHz, respectively

Question 2

Moore’s law

Answer 2

Is an empirical law stating that the power of CPUs increases by factor of 10 about every 6 years

Question 3

Compiling a program

Answer 3

Translation of code into machine language, thereby producing a (binary) object file. The object file is just a translation of source file, it is not yet on its own executable

Question 4

Liking a program

Answer 4

Will take all the objects files required by a program, possibly along with other object files gathered from libraries and uses these to produce a single file containing the executable program

Question 5

A greedy algorithm

Answer 5

Solves a problem by always selecting the option yielding the largest immediate progress towards the goal

Question 6

Rekursive Implementierung Struktur

Answer 6

Funktion deklarieren {
   If(n=1)
    Return 1;    Abbruchbedingung Bsp 
 Return n*funktion(n-1);        Auch Bsp 
}

Question 7

Sequential search Algorithmus

Falls kein Element gefunden wird retourniert 0

Answer 7

int sequentialSearch (int n[], int N, int goal) { 
    for (int i=0; i

Question 8

Sequential search „prigrammiertrick“

Answer 8

n[N] = goal setzen

Int SeqSearch (int n[], int N, int goal) { 
    n[N]=goal;
    int i = 0
    while (n[i] != goal) 
        i++
    Return i; 
} 

Resultat wird immer gefunden

Question 9

Was ist ein Binary search?

Answer 9

Wir nehemen das mittlere Element und vergleichen, ob der zu suchende Wert größer, kleiner oder gleich diesem ist.
Man benutzt Arrays

Question 10

Binary search Bsp. Code

Answer 10

Int BinSeach (int n[], int N, int goal) { 
   int left=0, right=N-1, middle; 
   while (left <= right) { 
      middle = (right + left) / 2;   //integer division 
      if (goal < n[middle]) 
         right = middle - 1; 
      else if (goal > n[middle]) 
         left = middle + 1;
      else 
         Return middle;
   } 
Return -1
}

Question 11

Wie wird ein sorrieralgorithmus der gleiche Elemente nucht vertauscht genannt

Answer 11

Stable

Question 12

Wie funktioniert ein Selection Sort Algorithmus (Prinzip)

Answer 12

1. Suche aus dem Array das kleinste Element
2. Lege diesen an den Anfang
3. Suche aus dem (noch nicht sortieren) Rest wiederum das kleinste Element)
4. etc.

Question 13

Selection Sort Algorithmus

Answer 13

Void selSort (int n[], int N) { 
//repeat this step as long as there are elements to sort 
   for (int i=0; i

Question 14

Was ist due anzahl vergleiche beim Selection sort argorithmus?

Answer 14

N(N-1)/2

Question 15

Was ist die Anzahl Tauschoperationen beim Selection Sort Algorithmus (worst case)

Answer 15

N-1

Question 16

Insertion Sort Code

Answer 16

Void insSort (int n[], int N) { 
//repeat as long as there are un sorted elements 
   for (int i=0; i 0 && n[j] < n[j-1]) {
//exchange the element 
         int temporary = n[j]; 
         n[j] = n[j-1]; 
         n[j-1] = temporary; 
//adapt the position of current element 
         j- - ; 
      } 
   } 
   return; 
}

Question 17

rectangular quadure integral approximation

Answer 17

double rectangular_quadure (double a, double b, int N) { 
   double sum = 0; 
   double h = (b - a)/N; 
   for (int i = 0; i

Question 18

trapetiodal_quadrature code

Answer 18

double tr_qu (double a, double b, int N){
   Double sum=0; 
   Double h=(b-a) / N 
   For (int i=0; i

Question 19

Was ist ein stable Algorithmus?

Answer 19

Ein Algorithmus der zwei Elemente mit der gleichen value in der gleichen Reihenfolge bleiben beim sortieren

Question 20

Swaping mechanismus mit a[i]

Answer 20

If (a[i] < a[i-1]) {
temp = a[i-1];
a[i-1] = a[i]
a[i] = temp