What table space characteristic can affect how your compiler operates?

Given the following table definition: CREATE TABLE smarterer_list (empid INTEGER, points INTEGER CONSTRAINT chk CHECK (points <= 100) NOT ENFORCED ) and the statement: INSERT INTO smarterer_list VALUES (98, 100), (123,123), (101, 98) How many records will be retrieved by the following statement? SELECT * FROM smarterer_list

Given that there are two containers in table space Smart1 and the following statement: ALTER TABLESPACE Smart1 REDUCE (ALL 100 M) Which of the following will happen?

If you have a poorly clustered index with random synchronous I/Ss, what clause would you use to prevent an impending delay?

An audit trace shows that TSO user TSOID1 with DBADM authority, is continually attempting to update a table in DB2 subsystem DSN1 that is not supposed to be updated. Which of the following will prevent access to the DB2 subsystem?

Which explicit system privileges allows the user to create new plans and packages without being able to also execute them?

Which can be done by a user who is granted the CONTROL privilege on an INDEX?

What is a technique to access non-contiguous data pages more efficiently?

What is intra-partition parallelism?

Which table space allows LOBs to use the filesystem cache?

Which is correct about the EXPLAIN statement