Rdbms Archives - Page 2 of 37

Sign Up

Sign In

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

You must login to ask a question.

You must login to add post.

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Ask A Question

Vaishali Bhola Kala

Asked: 3 years agoIn: Rdbms

What is the function of inner join?

(a) It preserves tuples only in the relation named before the operation

(b) It preserves tuples only in the relation named after the operation

(c) It preserved tuples in the relations named on both the sides of the operation

(d) It does not preserve any tuples on either side of the relation

Mitesh Lal Modi

Asked: 3 years agoIn: Rdbms

The operation of moving from coarser granular data to finer granular data is called _______

(a) Reduction

(b) Increment

(c) Roll back

(d) Drill down

Sukriti Rajagopalan

Asked: 3 years agoIn: Rdbms

The scheme that controls the interaction between executing transactions is called as _____

(a) Concurrency control scheme

(b) Multiprogramming scheme

(c) Serialization scheme

(d) Schedule scheme

Padama Sen

Asked: 3 years agoIn: Rdbms

A sequence of primitive operations that can be used to evaluate a query are called as __________

(a) Query evaluation algebra

(b) Query evaluation plan

(c) Query evaluation primitive

(d) Query evaluation engine

Bhola Chaudhuri

Asked: 3 years agoIn: Rdbms

Which of the following is not a method in deadlock handling

(a) Deadlock prevention

(b) Deadlock detection

(c) Deadlock recovery

(d) Deadlock distribution

Aslam Chakrabarti

Asked: 3 years agoIn: Rdbms

Which of the following is not a condition for X→ Y in Boyce codd normal form?

(a) X → Y is trivial

(b) X is the superkey for the relational schema R

(c) Y is the superkey for the relational schema R

(d) All of the mentioned

Sushmita Kabra

Asked: 3 years agoIn: Rdbms

Which of the following are not a part of PL/SQL

(a) Triggers

(b) Packages

(c) Functions

(d) None of the mentioned

Tulsi Suresh

Asked: 3 years agoIn: Rdbms

Which of the following correctly describes the between predicate in the where clause?

(a) It is used to check whether a value is in between two specified values

(b) It is used to check whether a value is exactly in the center of the relation alphabetically

(c) It is used to check whether a value is in between any two other values in the database

(d) None of the mentioned

Ritika Taneja

Asked: 3 years agoIn: Rdbms

Dynamic hashing allows us to?

(a) Accommodate the growth of the database

(b) Accommodate the shrinkage of the database

(c) Allows modification of hash function

(d) All of the mentioned

Arvind Kar

Asked: 3 years agoIn: Rdbms

The space overhead in dynamic hashing is ________ than that of static hashing

(a) More

(b) Less

(c) Equal

(d) None of the mentioned

Load More Questions

Rdbms

The operation of moving from coarser granular data to finer granular data is called _______

(a) Reduction

(b) Increment

(c) Roll back

(d) Drill down

The scheme that controls the interaction between executing transactions is called as _____

(a) Concurrency control scheme

(b) Multiprogramming scheme

(c) Serialization scheme

(d) Schedule scheme

A sequence of primitive operations that can be used to evaluate a query are called as __________

(a) Query evaluation algebra

(b) Query evaluation plan

(c) Query evaluation primitive

(d) Query evaluation engine

Which of the following is not a method in deadlock handling

(a) Deadlock prevention

(b) Deadlock detection

(c) Deadlock recovery

(d) Deadlock distribution

Which of the following is not a condition for X→ Y in Boyce codd normal form?

(a) X → Y is trivial

(b) X is the superkey for the relational schema R

(c) Y is the superkey for the relational schema R

(d) All of the mentioned

Which of the following are not a part of PL/SQL

(a) Triggers

(b) Packages

(c) Functions

(d) None of the mentioned

Dynamic hashing allows us to?

(a) Accommodate the growth of the database

(b) Accommodate the shrinkage of the database

(c) Allows modification of hash function

(d) All of the mentioned

The space overhead in dynamic hashing is ________ than that of static hashing

(a) More

(b) Less

(c) Equal

(d) None of the mentioned

How to approach applying for a job at a company ...

How to handle personal stress caused by utterly incompetent and ...

What is a programmer’s life like?

Sign Up

Sign In

Forgot Password

Rdbms

mcqoptions.com Latest Questions