Informatik II Quiz 1

Which of the following is a fundamental property? (0 or more true)

• 1. Concurrency

• 1. Correctness

• 1. Distribution

• 1. Efficiency

• 1. Liveness

Which of the following is true?

• Sorting if often the bottleneck of an algorithm

• Bubble sort has roughly O(n log(n)) comparisons

• Merge sort has roughly O(n log(n)) comparisons

• Merge sort is incremental

Consider the following sequence of snap-shots (steps) of an algorithm. Which of the following algorithm is the correct sorting algorithm?

• Bubble Sort

• Selection Sort

• Insertion Sort

Consider the following sequence of snap-shots (steps) of an algorithm. Which of the following algorithm is the correct sorting algorithm?

• Bubble Sort

• Selection Sort

• Insertion Sort

Consider the following sequence of snap-shots (steps) of an algorithm. Which of the following algorithm is the correct sorting algorithm?

• Bubble Sort

• Selection Sort

• Insertion Sort

Consider the following pseudocode of the bubblesort. What sign is missing to sort the array in ascending order?

• <

• >

• <=

• >=

Consider the following pseudocode of the insertionsort. What signs are missing to sort the array in ascending order?

• 1. > and 2. <=

• 1. >= and 2. <

• 1. > and 2. >=

• 1. >= and 2. >

Which of the following for-loops would run in C?

• for(int i = 0; i++; i < 10)

• for(i++; int i = 0; i < 10)

• for(i < 10; i++)

• for(int i = 0; i < 10; i++)

The bubblesort algorithm according to the pseudocode you saw in class sorts an array of length 8. How many iterations does the innermost loop go through?

• 21

• 28

• 36

• 64

• Not enough information

The insertionsort algorithm according to the pseudocode you saw in class sorts an array of length 11. How many iterations does the innermost loop go through?

• 55

• 66

• 78

• 121

• Not enough information