CS502 Quiz 1 Set 6

Q1. In 2-D maxima problem, A point p is said to be dominated by point q if ________________.

1. p.x = q.x and p.y = q.y
2. p.x ≠ q.x and p.y ≠ q.y
3. p.x ≤ q.x and p.y ≤ q.y
4. p.x ≥ q.x and p.y ≥ q.y

Correct answer: p.x ≤ q.x and p.y ≤ q.y

Q2. Algorithm is a sequence of computational steps that __________ the input into output.

1. transform
2. integrate
3. merge
4. assign

Correct answer: transform

Q3. ___________ of reference is an important fact of current processor technology.

1. Assigning
2. Locality
3. Defining
4. Formality

Correct answer: Locality

Q4. if A dominates B, and B dominates C, then it is necessary that

1. C dominates B
2. B dominates A
3. C dominates A
4. A dominates C

Correct answer: A dominates C

Q5. In merge sort algorithm, to merge two lists of size n/2 to a list of size n, takes ___________ time.

1. Theta log(n)
2. Theta nlog(n)
3. Theta (n)
4. Theta log2(n)

Correct answer: Theta (n)

Q6. To predict the cost of an algorithm in terms of resources is called ______________.

1. Key
2. Design
3. Analysis
4. Output

Correct answer: Analysis

Q7. If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.

1. Fast
2. Cheap
3. Slow
4. Expensive

Correct answer: Cheap

Q8. The main purpose of our mathematical analysis will be measuring the _______________ time.

1. Debugging
2. Building
3. Compilation
4. Execution

Correct answer: Execution

Q9. If the time complexity of an algorithm is O(n), then it is called ____________ time complexity.

1. Average
2. Linear
3. Constant
4. Exponential

Correct answer: Linear

Q10. In Random Access Machine, Instructions are executed

1. one by one
2. in the form of bytes
3. in parallel
4. in the form of bits

Correct answer: one by one