In tuple relational calculus P1 → P2 is equivalent to
A. | ¬ P1 ∨ P2 |
B. | P1 ∨ P2 |
C. | P1 ∧ P2 |
D. | P1 ∧ ¬P2 |
Option: A Explanation : Click on Discuss to view users comments. |
A logical schema
A. | Is the entire database. |
B. | describe data in terms of relational tables and columns, object-oriented classes, and XML tags. |
C. | Describes how data is actually stored on disk. |
D. | Both (A) and (C) |
Option: A Explanation : Click on Discuss to view users comments. Balaram Jena said: (1:39pm on Monday 6th January 2014)
answer must be B
kamesh saini said: (3:36pm on Thursday 16th July 2015)
logical schema is entire data base how
Shikha said: (6:52am on Thursday 12th April 2018)
I think it should be B
|
Related fields in a database are grouped to form a
A. | Data file |
B. | Data record. |
C. | Menu. |
D. | Bank. |
Option: B Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Data Warehousing Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various Search Terms used for this section are