DBMS-Relational Query Languages Questions and Answers

Take Exam

Relational Query Languages questions with answers test a candidate’s command over SQL and relational algebra, essential in database management system (DBMS) exams. From SELECT queries to JOIN operations and set-based functions, these concepts are heavily emphasized in placement tests by TCS, Wipro, and Infosys. This section offers detailed programming questions and answers with SQL query explanations, ensuring that learners understand both syntax and logic. Practicing these DBMS query-based MCQs strengthens problem-solving and prepares you for database-related technical interviews and coding challenges.

DBMS-Relational Query Languages

Showing 10 of 45 questions

11. Codd's Formation rule states that:

  • a relational database management system must manage the database entirely through its relational capbilities.
  • null values are systematically supported independent of data type.
  • all information is represented logically by values in tables
  • None of these
Show Answer Report

12. Codd's View Update rule states that:

  • the system should be able to perform all theoretically possible updates on views.
  • the logical description of the database is represented and may be interrogated by authorised users, in the same way as for normal data
  • the ability to treat whole tables as single objects applies to insertion, modification and deletion, as well as retrieval of data
  • null values are systematically supported independent of data type.
Show Answer Report

13. Codd's system catalogue rule states that:

  • the system should be able to perform all theoretically possible updates on views.
  • the logical description of the database is rpresented and may be interrogated by authorised users, in the same way as for normal data.
  • the ability to treat whole tables as single objects applies to insertion, modification and deletion, as well as retrieval of data.
  • null values arre systematically supported independent of data type.
Show Answer Report

14. Who developed SEQUEL

  • TRUE
  • FALSE
Show Answer Report

15. System R was based on

  • SEQUEL
  • SQL
  • QUEL
  • All of these
Show Answer Report

16. Which of the following is not a data definition statement ?

  • INDEX
  • CREATE
  • MODIFY
  • DELETE
Show Answer Report

17. Which  of the following is a data query statement in QUEL

  • GET
  • RETRIEVE
  • SELECT
  • None of these
Show Answer Report

18. Which of the following is supported in QUEL ?

  • COUNT
  • Intersection
  • Union
  • Subquery.
Show Answer Report

19. Codd's Non-subversion rule states that:

  • 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.
  • the ligical description of the database is represented and may be interrogated by authorised users in the same way as for normal data.
  • 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.
  • the ability to treat whole tables as single objects applies to insertion, modification and deletion as well as retrieval of data
Show Answer Report

20. QUEL is a tuple relational calculus language of a relationall database system:

  • INGRES
  • DB2
  • ORACLE
  • None of these
Show Answer Report
Database
Questions and Answers for Competitive Exams Various Entrance Test