Q. Repeat
sequence of statements;
__________________
end repeat

Fill in the correct option :

View solution

Q. Which of the following is the correct format for if statement ?

View solution

Q. A stored procedure in SQL is a___________

View solution

Q. Temporary stored procedures are stored in _________ database.

View solution

Q. Declare out of classroom seats condition

DECLARE exit handler FOR OUT OF classroom seats
BEGIN
SEQUENCE OF statements
END

The above statements are used for

View solution

Q. Trigger are supported in

View solution

Q. Which of the following is NOT an Oracle-supported trigger?

View solution

Q. What are the different in triggers ?

View solution

Q. Triggers ________ enabled or disabled

View solution

Q. Which prefixes are available to Oracle triggers?

View solution

Q. Any recursive view must be defined as the union of two subqueries: a _______ query that is nonrecursive and a __________ query.

View solution

Q. Ranking of queries is done by which of the following ?

View solution

Q. In rank() function if one value is shared by two tuples then

View solution

Q. The __________ function that does not create gaps in the ordering.

View solution

Q. SELECT ID, GPA
FROM student grades
ORDER BY GPA
____________;

Inorder to give only 10 rank on the whole we should use

View solution

Q. If there are n tuples in the partition and the rank of the tuple is r , then its ________ is defined as (r −1)/(n−1) .

View solution

Q. Inorder to simplify the null value confusion in the rank function we can specify

View solution

Q. Suppose we are given a view tot credits (year, num credits) giving the total number of credits taken by students in each year.The query that computes averages over the 3 preceding tuples in the specified sort order is

View solution

Q. The functions which construct histograms and use buckets for ranking is

View solution

Q. The command ________________ such tables are available only within the transaction executing the query, and are dropped when the transaction finishes.

View solution