edited by
2,099 views
1 votes
1 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 
edited by

1 Answer

1 votes
1 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:

Related questions

3 votes
3 votes
3 answers
2
Arjun asked Apr 22, 2018
3,589 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...
5 votes
5 votes
3 answers
4
Arjun asked Apr 22, 2018
10,039 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$...