Evaluation of Expressions

1.

The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called

   A.) Materialized evaluation
   B.) Expression evaluation
   C.) Tree evaluation
   D.) Tree materialization

Answer: Option 'A'

Materialized evaluation

2.

______________ allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.

   A.) Buffering
   B.) Double buffering
   C.) Multiple buffering
   D.) Double reading

Answer: Option 'A'

Buffering

3.

In a __________, the system makes repeated requests for tuples from the operation at the top of the pipeline.

   A.) Demand-driven pipeline
   B.) Producer-driven pipeline
   C.) Demand pipeline
   D.) All of the mentioned

Answer: Option 'A'

Demand-driven pipeline

4.

Each operation in a demand-driven pipeline can be implemented as an ____ that provides the following functions: open(), next(), and close().

   A.) Demand
   B.) Pipeline
   C.) Iterator
   D.) All of the mentioned

Answer: Option 'C'

Iterator

5.

In a __________________, operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.

   A.) Demand-driven pipeline
   B.) Producer-driven pipeline
   C.) Demand pipeline
   D.) All of the mentioned

Answer: Option 'B'

Producer-driven pipeline

Evaluation of Expressions Download Pdf