DBMS-Relational Algebra and Calculus Questions and Answers
Relational Algebra and Relational Calculus form the theoretical foundation of DBMS programming questions and answers frequently asked in technical interviews and campus placement exams such as TCS, Infosys, and Accenture. These topics explain how queries are represented and optimized in databases. By understanding operations like selection, projection, join, and division, you can effectively translate queries into SQL. Practicing DBMS MCQs and programming interview questions with answers improves your understanding of database logic, query design, and relational schema concepts essential for technical placements.
DBMS-Relational Algebra and Calculus
Showing 10 of
81 questions
31. A table can have only one:
- primary key
- alternate key
- candidate key
- all of these
32. What are all candidate keys, other than the primary keys called?
- secondary keys
- alternate keys
- eligible keys
- none of these
33. What is the name of the attribute or attribute combination of one relation whose values are required to match those of the primary key of some other relation?
- candidate key
- primary key
- foreign key
- matching key
34. what is the name of the attribute or attribute combination of one relation whose values are required to match those of the primary key of some other relation?
- candidate key
- primary key
- foreign key
- matching key.
37. What is the RDBMS terminology for a set of legal values that an attribute can have
- tuple
- relation
- attribute
- domain
38. What is the RDBMS terminology for a set of legal values that an attribute can have ?
- degree
- relation
- attribute
- cardinality
40. What is the RDBMS terminology for the number of attributes in a relation?
- degree
- relation
- attribute
- cardinality