1. In tuple relational calculus P1 → P2 is equivalent to
¬ P1 ∨ P2
P1 ∨ P2
P1 ∧ P2
P1 ∧ ¬P2
Your email address will not be published. Required fields are marked *
Save my name, email, and website in this browser for the next time I comment.
2. A logical schema
Is the entire database.
describe data in terms of relational tables and columns, object-oriented classes, and XML tags.
Describes how data is actually stored on disk.
Both (A) and (C)
3. Related fields in a database are grouped to form a
4. The database environment has all of the following components except:
5. The way a particular application views the data from the database that the application uses is a
CFA Level 1
GATE COMPUTER SCIENCE
UGC NET COMMERCE
UGC NET COMPUTER SCIENCE
UGC NET Management
UGC NET PAPER 1
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login