Quiz: Querying Knowledge Graphs with SPARQL

Quiz Summary

0 of 3 Questions completed

Questions:

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 3 Questions answered correctly

Your time:

You have reached 0 of 0 point(s), (0)

Question 1 of 3

1. Question

Consider: ?product a ex:Product . OPTIONAL { ?product ex:price ?price . } FILTER(?price < 40). What is returned?

Products with no price are kept with ?price unbound, and only products priced 40 or above are removed.
Correct Incorrect Correct answer

The query is rejected, because a FILTER may not reference a variable that is bound inside an OPTIONAL block.
Correct Incorrect Correct answer

Products with no price are dropped too, because comparing an unbound variable raises an error that SPARQL treats as false; keeping them requires !BOUND(?price) or COALESCE.
Correct Incorrect Correct answer

The engine pushes the FILTER inside the OPTIONAL, so the result is identical to writing it there.
Correct Incorrect Correct answer

Correct / 1 Points

Incorrect / 1 Points
Question 2 of 3

2. Question

Which statement about SPARQL 1.1 property paths is correct?

Variables are permitted only at the ends of a path, so ?s ?p* ?o is invalid; ex:partOf* is a zero-or-more path that also matches the starting node itself, while ex:partOf+ requires at least one step.
Correct Incorrect Correct answer

?s ?p* ?o is valid and returns every predicate that can be repeated between the two nodes.
Correct Incorrect Correct answer

The * operator matches exactly one step and the + operator matches two or more.
Correct Incorrect Correct answer

Property paths cost no more than a single triple pattern, so materialising a transitive closure as direct shortcut triples is never worth the storage.
Correct Incorrect Correct answer

Correct / 1 Points

Incorrect / 1 Points
Question 3 of 3

3. Question

Which statement about SPARQL 1.1 Update is accurate?

A blank node written into a DELETE template matches the corresponding blank node held in the store, which is the normal way to delete reified statements.
Correct Incorrect Correct answer

INSERT DATA and DELETE DATA take concrete triples and permit no variables, so pattern-based changes need DELETE/INSERT WHERE; and if a variable in the DELETE template is left unbound by the WHERE clause, the engine skips that delete pattern entirely.
Correct Incorrect Correct answer

A WITH clause overrides any USING clause for the read portion of the operation.
Correct Incorrect Correct answer

CLEAR GRAPH and DROP GRAPH are synonyms with identical effects on the graph store.
Correct Incorrect Correct answer

Correct / 1 Points

Incorrect / 1 Points

Quiz: Querying Knowledge Graphs with SPARQL

Quiz Summary

Information

Results

Results

Categories

1. Question

2. Question

3. Question