0% found this document useful (0 votes)
70 views1 page

Assignment 2a

This document outlines several SQL queries to perform on a university database schema. The queries include finding instructors who have never taught, total building capacity, maximum instructors for a course section, departments with instructors and their counts, departments with instructor counts including those with zero, total credits completed per student, number of students taught by a specific instructor, highest paid instructors by department, students who took all courses of a specific instructor, total salary spending by department, and students advised by the instructor who taught the most courses.

Uploaded by

mahesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views1 page

Assignment 2a

This document outlines several SQL queries to perform on a university database schema. The queries include finding instructors who have never taught, total building capacity, maximum instructors for a course section, departments with instructors and their counts, departments with instructor counts including those with zero, total credits completed per student, number of students taught by a specific instructor, highest paid instructors by department, students who took all courses of a specific instructor, total salary spending by department, and students advised by the instructor who taught the most courses.

Uploaded by

mahesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 2a: More SQL: Aggregates

Statement : Intermediate SQL: Aggregates and grouping and ordering


The following questions are all based on the university schema

Find the number of instructors who have never taught any course. If the result of your
query is empty, add appropriate data (and include corresponding insert statements) to
ensure the result is not empty.

Find the total capacity of every building in the university.

Find the maximum number of teachers for any single course section. Your output
should be a single number. For example if CS-101 section 1 in Spring 2012 had 3
instructors teaching the course, and no other section had more instructors teaching the
section,
your
answer
would
be
3.

Find all departments that have at least one instructor, and list the names of the
departments along with the number of instructors; order the result in descending order
of number of instructors.

As in the previous question, but this time you should include departments even if they do
not have any instructor, with the count as 0.

For each student, compute the total credits they have successfully completed, i.e. total
credits of courses they have taken, for which they have a non-null grade other than 'F'. Do
NOT use the tot_creids attribute of student.

Find the number of students who have been taught (at any time) by an instructor named
'Srinivasan'. Make sure you count a student only once even if the student has taken more
than one course from Srinivasan.

Optional

Find the name of all instructors who get the highest salary in their department.

Find all students who have taken all courses taken by instructor 'Srinivasan'. (This is the
division operation of relational algebra.) You can implement it by counting the number of
courses taught by Srinivasan, and for each student (i.e. group by student), find the
number of courses taken by that student, which were taught by Srinivasan. Make sure to
count each course ID only once.
Find the total money spent by each department for salaries of instructors of that
department.

Find the names of all students whose advisor has taught the maximum number of courses
(multiple
offerings
of
a
course
count
as
only
1).
(Note: this is a complex query, break it into parts by using the with clause.)

You might also like