Computer Science · Relational Database Management System
A university database has the following schema: EMPLOYEE (EmpID, EmpName, DeptNo) DEPARTMENT (DeptNo, DeptName, Location) where: EmpID is the primary key of relation EMPLOYEE. DeptNo is the primary key of relation DEPARTMENT. Attribute DeptName contains unique values only. Number of tuples in EMPLOYEE = 8 Number of tuples in DEPARTMENT = 4 The following relational algebra query is executed: R = EMPLOYEE × DEPARTMENT Match List I with List II in context of the above problem statement: List IList IIA. Degree of relation RI. 32B. Cardinality of relation RII. DeptNoC. Foreign key of relation EMPLOYEEIII. 6D. Foreign key of relation DEPARTMENTIV. NIL
- 1A - IV, B - I, C - II, D - III
- 2A - III, B - II, C - I, D - IV
- 3A - I, B - III, C - IV, D - II
- 4A - III, B - I, C - II, D - IV✓
Correct answer
A - III, B - I, C - II, D - IV
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Relational Database Management System?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Relational Database Management System