CS502 Quiz 1 Set 4

Q1. 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. Expensive
3. Cheap
4. Slow

Correct answer: Cheap

Q2. In Random Access Machine, Instructions are executed

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

Correct answer: one by one

Q3. In 3-Dimensional space, a point P has ______________ coordinate(s).

1. (X, Y, Z)
2. (0, Y)
3. (X, Y)
4. (X, 0)

Correct answer: (X, Y, Z)

Q4. Approach of solving geometric problems by sweeping a line across the plane is called ________sweep.

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

Correct answer: Line

Q5. Number of _______of the pseudo code are counted to measure the running time.

1. Steps
2. Outputs
3. Pages
4. Inputs

Correct answer: Steps

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

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

Correct answer: Maximal

Q7. An algorithm is a mathematical entity, which is independent of _______________.

1. Programming language
2. Programming language, Compiler and Machine
3. Compiler and Programming language
4. Machine and Programming language

Correct answer: Programming language, Compiler and Machine

Q8. 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. 3
2. 2
3. 4
4. 1

Correct answer: 4

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

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

Correct answer: Infinite large

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

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

Correct answer: Linear