CS502 Quiz 1 Set 5

Q1. In the statement "if (P[i].x < P[j].x) & (P[i].y < P[j].y)", the number of times elements of P are accessed is

1. 2
2. 1
3. 4
4. 3

Correct answer: 4

Q2. Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.

1. Two
2. Some
3. All
4. Most

Correct answer: All

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

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

Correct answer: Locality

Q4. The O-notation is used to state only the asymptotic ________bounds.

1. Both lower & upper
2. Lower
3. Upper
4. Two

Correct answer: Upper

Q5. In plane sweep approach of solving geometric problems, a ________is swept across the plane.

1. Box
2. Plane
3. Line
4. Cube

Correct answer: Line

Q6. There are no hard formal rules to the syntax of the ________ code.

1. Basic
2. Assembly
3. Pseudo
4. Programming

Correct answer: Pseudo

Q7. A Random Access Machine (RAM)is an idealized machine with ___________ random access memory.

1. 256 MB
2. Infinite large
3. 2 GBs
4. 512 MB

Correct answer: Infinite large

Q8. The process of ___________ ends when you are left with such tiny pieces remaining that it is trivial to solve them.

1. Divide and Conquer
2. Brute-force
3. Plan-sweep
4. Axis-sweep

Correct answer: Divide and Conquer

Q9. In the following loop statement: for i ← 1 to n For loop executes _______ times.

1. n2
2. n
3. It is not correct statement
4. log n

Correct answer: n

Q10. The asymptotic growth of n(n+1)/2 is:

1. O(n²)
2. O(n+2)
3. O(n)
4. O(n log n)

Correct answer: O(n²)