problem

1 point possible (graded)

1) What database operations can be performed using deterministic encryption? (choose all that apply)

 

Finding items that are equal to a particular value.

 

Grouping items by equality.

 

Sorting items at the server.

 

Obtaining all items from the database.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

2) What operations does a CryptDB implement using a homomorphic encryption scheme (such as Paillier)? (choose all that apply)

 

Adding integer values.

 

Checking equality between values.

 

Computing the sum of values.

 

Computing the average of values.

 

Sorting values.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

3) What is the advantage of CryptDB's onion construction? (choose all that apply)

 

Onions enable CryptDB to compute over encrypted data without revealing plaintext data to the server.

 

Onions enable CryptDB to avoid revealing weaker encryption schemes for some data items.

 

Onions enable CryptDB to perform computation in the trusted proxy instead of at the server.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

4) What determines the confidentiality level provided by CryptDB? (choose all that apply)

 

The schema of the database.

 

The queries issued by the application.

 

The thresholds specified for each column.

 

The size of the database.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

5) What is the average overhead of using CryptDB for the TPC-C benchmark?

 

2%

 

20%

 

200%

 

2000%

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

6) Which of the following repeating workloads can scale well on a cache-coherent multicore system? (choose all that apply)

 

One core writing a cache line that other cores read.

 

All cores reading the same cache line.

 

All cores reading and writing the same cache line.

 

Each core reading and writing its own cache line.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

7) What is the primary reason for the collapse of ticket locks?

 

The counter tracking the number of waiters overflows.

 

Cores waiting to acquire the lock slow down the execution of the core holding the lock.

 

The time taken to acquire a lock is proportional to the number of waiters.

 

Cores that do not succeed in acquiring a lock are wasting CPU time in acquire's spin loop.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

8) What could happen if you replace a ticket lock with a non-collapsing lock (such as Anderson's) in an existing program? (choose all that apply)

 

If the lock was not contended, the program may run slower.

 

If the lock was contended, the program may now scale perfectly.

 

If the lock was contended, the absolute performance of the program may improve.

Not yet answered.

 

 

Submit

Submit Your Answer

problem

1 point possible (graded)

9) Why does lock-free synchronization require a garbage collection scheme?

 

Explicitly freeing memory places a significant programming burden on the developer.

 

Garbage collection reduces cache coherence traffic compared to explicitly freeing memory.

 

Objects removed from a data structure on one core may still be in use by other cores.

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

10) Which of the following visual variables are preattentive? (choose all that apply)

 

Color

 

Shape

 

Text

 

Size

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

11) Which two of the following visual variables best convey quantitative values: (choose all that apply)

 

Color

 

Position

 

Length

 

Texture

Not yet answered.

 

Submit

Submit Your Answer

 

problem

1 point possible (graded)

12) What is deceptive about the image above describing oil prices? (choose all that apply)

 

Numeric labels

 

Decorative aspects of cylinders

 

False perspective

 

3D illusion

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

13) For which of the following tasks is interactive visualization most useful? (choose all that apply)

 

Developing a hypothesis about data

 

Formally confirming a hypothesis

 

Communicating a conclusion about data

 

All of the above

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

14) Which of the following interface elements use direct manipulation? (choose all that apply)

 

The DOS command line

 

WYSIWYG editors

 

Pan and zoom interfaces

 

SQL databases

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

15) How does linking and brushing help users understand data? (choose all that apply)

 

They can follow links like joins in a database

 

They can see connections between data in different visualizations

 

They can change the colors of data points for better clarity

 

The can move data between different visualizations

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

16) Which are advantages of faceted browsing over hierarchical search? (choose all that apply)

 

Users don't need to guess which queries to enter

 

Users can apply restrictions in arbitrary order

 

Faceted browsing generally looks more professional

 

Users can undo mistakes

Not yet answered.

 

Submit

Submit Your Answer

problem

1 point possible (graded)

17) Which of the following is often used for faceted browsing? (choose all that apply)

 

A tag cloud

 

A slider for a numeric range

 

A text search box

 

A map

Not yet answered.

 

Submit

Submit Your Ans

 

ASSESSMENT 5This section will be graded, so it will affect your final grade.•Click "Check" to submit each answer for evaluation.•Questions may be answered in any order.•problem1 point possible (graded)1) What database operations can be performed using deterministic encryption? (choose all that apply)Finding items that are equal to a particular value.Grouping items by equality.Sorting items at the server.Obtaining all items from the database.Not yet answered.SubmitSubmit Your Answerproblem1 point possible (graded)2) What operations does a CryptDB implement using a homomorphic encryption scheme (such as Paillier)? (choose all thatapply)Adding integer values.Checking equality between values.Computing the sum of values.Computing the average of values.