edited by
3,901 views
3 3 votes

Consider the set of relations given below and the SQL query that follows:

Students: (Roll_number, Name, Date_of_birth)
Coursed: (Course_number, Course_name, Instructor)
Grades: (Roll_number, Course_number, Grade)
SELECT DISTINCT Name
FROM Students, Courses, Grades
WHERE Students.Roll_number = Grades.Roll_number
                            AND   Courses.Intructor =Sriram
                            AND   Courses.Course_number = Grades.Course_number
                            AND   Grades.Grade = A

Which of the following sets is computed by the above query?

  1. Names of Students who have got an $\textsf{A}$ grade in all courses taught by Sriram
  2. Names of Students who have got an $\textsf{A}$ grade in all courses
  3. Names of Students who have got an $\textsf{A}$ grade in at least one of the courses taught by Sriram
  4. None of the above 

1 Answer

4 4 votes
course.intsructor = sriram specify the course taught by sriram and other two predicate specify that students can get A grade atleast.
so by these three predicate option C is correct.
Answer:
Position:
Show:

Related questions

7 7 votes
2 2 answers
4.3k
4.3k views
Arjun asked Apr 22, 2018
4,269 views
Given relations $\textsf{R(w,x)}$ and $\textsf{S(y,z)},$ the result ofSELECT DISTINCT w, x FROM R, Sls guaranteed to be same as $\text{R},$ if$\textsf{R}$ has no duplicat...
9 9 votes
3 answers 3 answers
5.6k
5.6k views
Arjun asked Apr 22, 2018
5,626 views
Considering the following table in a relational database : $$\begin{array}{|c|c|c|c|} \hline \textbf{Last Name} & \textbf{Rank} & \textbf{Room} & \textbf{shift} \\ \hline...
8 8 votes
6 6 answers
4.0k
4.0k views
Arjun asked Apr 22, 2018
3,970 views
For a database relation $R(a,b,c,d)$ where the domain of $a,b,c$ and $d$ include only atomic value, only the following functions dependencies and those that can be inferr...
7 7 votes
3 answers 3 answers
17.1k
17.1k views
Arjun asked Apr 22, 2018
17,075 views
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used?$5$$4$...