Crowdly
Add to Chrome
INTRO. TO DATABASE MGMT. SYST.
Looking for INTRO. TO DATABASE MGMT. SYST. test answers and solutions? Browse our comprehensive collection of verified answers for INTRO. TO DATABASE MGMT. SYST. at moodlenew.iitd.ac.in.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
State true or false for the following statement:
, holds for both sets and bags
Consider the following university database schema:
Student (SID, Name, Age, Major, GPA)
Course (CID, Title, Department, Credits)
Enrollment (SID, CID, Semester, Grade)
Professor (PID, Name, Department, Salary)
Teaches (PID, CID, Semester)
Which of the following relational algebra expression(s) will Retrieve the names of students who are enrolled in Course C1 but not in Course C2. (Note: there can be more than expressions)
Schema :
Consider the following university database schema:
Student (SID, Name, Age, Major, GPA)
Course (CID, Title, Department, Credits)
Enrollment (SID, CID, Semester, Grade)
Professor (PID, Name, Department, Salary)
Teaches (PID, CID, Semester)
Which of the following relational algebra expression(s) will Retrieve the names of all students enrolled in at least one course? (Note: there can be more than expressions)
Consider the following university database schema:
Student (SID, Name, Age, Major, GPA)
Course (CID, Title, Department, Credits)
Enrollment (SID, CID, Semester, Grade)
Professor (PID, Name, Department, Salary)
Teaches (PID, CID, Semester)
Which of the following relational algebra expression(s) will Retrieve the names of all students majoring in 'Computer Science'. (Note: there can be more than expressions)
State true or false for the following statement:
, holds for both sets and bags.
Consider the following university database schema:
Student (SID, Name, Age, Major, GPA)
Course (CID, Title, Department, Credits)
Enrollment (SID, CID, Semester, Grade)
Professor (PID, Name, Department, Salary)
Teaches (PID, CID, Semester)
Which of the following relational algebra expression(s) will Retrieve the names of students who have taken at least one of the courses C1 or C2. (Note: there can be more than expressions)
Consider the following ER model for a university system:
There is a called that connects these entities. This relationship models that:
- A Professor teaches a Course to a Student.
- A Course can be taught by multiple Professors, but each Professor only teaches a specific Course.
- A Student can enroll in multiple Courses but must have exactly one assigned Professor per Course.
Which of the following is the best way to simplify this three-way relationship while preserving all constraints?
What symbol is used to represent a relationship in an ER diagram?
Consider a relation R(A, B, C, D, E, F) with the following functional dependencies:
1. A → B 2. B → C 3. CD → E 4. E → F
The candidate key is AD.
What is the highest normal form this relation satisfies?
Consider a relation R(A, B, C, D, E) with the following functional dependencies: 1. A → B 2. B → C 3. CD → E
R is decomposed into R1(A, B, C) and R2(B, C, D, E).
Is this decomposition lossless?