DBMS-Relational Query Languages Questions and Answers

Practice Mode
Showing 10 of 45 questions
Q11
Codd's Formation rule states that:
  • A a relational database management system must manage the database entirely through its relational capbilities.
  • B null values are systematically supported independent of data type.
  • C all information is represented logically by values in tables
  • D None of these
Answer: Option A
Q12
Codd's View Update rule states that:
  • A the system should be able to perform all theoretically possible updates on views.
  • B the logical description of the database is represented and may be interrogated by authorised users, in the same way as for normal data
  • C the ability to treat whole tables as single objects applies to insertion, modification and deletion, as well as retrieval of data
  • D null values are systematically supported independent of data type.
Answer: Option A
Q13
Codd's system catalogue rule states that:
  • A the system should be able to perform all theoretically possible updates on views.
  • B the logical description of the database is rpresented and may be interrogated by authorised users, in the same way as for normal data.
  • C the ability to treat whole tables as single objects applies to insertion, modification and deletion, as well as retrieval of data.
  • D null values arre systematically supported independent of data type.
Answer: Option B
Q14
Who developed SEQUEL
  • A TRUE
  • B FALSE
Answer: Option A
Q15
System R was based on
  • A SEQUEL
  • B SQL
  • C QUEL
  • D All of these
Answer: Option
Q16
Which of the following is not a data definition statement ?
  • A INDEX
  • B CREATE
  • C MODIFY
  • D DELETE
Answer: Option A
Q17
Which  of the following is a data query statement in QUEL
  • A GET
  • B RETRIEVE
  • C SELECT
  • D None of these
Answer: Option B
Q18
Which of the following is supported in QUEL ?
  • A COUNT
  • B Intersection
  • C Union
  • D Subquery.
Answer: Option C
Q19
Codd's Non-subversion rule states that:
  • A entity andreferential integrity constraints should be defined in the high-level relational language referred to in Rule-5, stored in the system catalogues and enforced by the system, not by application programs.
  • B the ligical description of the database is represented and may be interrogated by authorised users in the same way as for normal data.
  • C if a low-level procedural language is supported, it must not be able to subvert integrity or security constraints expressed in the high-level relational language.
  • D the ability to treat whole tables as single objects applies to insertion, modification and deletion as well as retrieval of data
Answer: Option D
Q20
QUEL is a tuple relational calculus language of a relationall database system:
  • A INGRES
  • B DB2
  • C ORACLE
  • D None of these
Answer: Option A

📚 More from Database

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Database
Back to Database
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test