CS502 Quiz 1 Set 2

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

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

Correct answer: Locality

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

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

Correct answer: Line

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

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

Correct answer: Pseudo

Q4. Merge sort is based on___________.

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

Correct answer: Divide and Conquer

Q5. The Omega-notation allows us to state only the asymptotic _______bounds.

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

Correct answer: Lower

Q6. Which of the following is calculated with Big Omega notation?

1. Upper bounds
2. Medium bounds
3. Both upper and lower bounds
4. Lower bounds

Correct answer: Lower bounds

Q7. To check whether a function grows faster or slower than the other function, we use some asymptotic notations, which is __________.

1. Big-oh notation
2. Omega notation
3. Theta notation
4. All of the given

Correct answer: All of the given

Q8. ________________ is not a characteristic of Random Access Machine.

1. Assigning a value to a variable
2. Single-Processor
3. Executing an arithmetic instruction
4. Locality of reference

Correct answer: Locality of reference

Q9. The brute-force algorithm for 2D-Maxima runs in order O(___) time.

1. n
2. n(log n)
3. n3
4. n*n

Correct answer: n*n

Q10. In 2d-maxima problem, a point is said to be ________if it is not dominated by any other point in that space.

1. Member
2. Minimal
3. Maximal
4. Joint

Correct answer: Maximal