Our current policy is to not publish answers along with the questions, to limit the damage done if any part of the material gets accidentally published on the Web by anybody. This may be revised based on feedback from instructors. We have not provided any questions for Chapter 1 Introduction and Chapter 2 Relational Model currently. Exercises 3. Find the name and price of the most expensive item if more than one item is the most expensive, print them all.
Print the total sales in terms of units and total price of every item category in every customer-city. Find items with no sales at all to customers in Mumbai. Find customers who bought the same quantity of the same item on subsequent dates.
Write an SQL query to compute the top 5 distinct marks. That is, all students with the top mark get a rank of 1, those with the next highest mark get a rank of 2, and so on. Hint: split the task into parts, using the with clause. Define a view totalmarks course, rollno, marks to get total marks for students of each course, given a table: weights course, exam, weightage.
Here weightage is a factor by which you multiply the marks for the corresponding exam. Define a view grades course, rollno, grade to get the grades for students, given a relation cutoff course, grade, cutoff-mark. Assume that marks below the lowest cutoff mark get an FF grade. Note: formal coverage of schema design is in Chapter 8, but this question can still be asked of smart students a. Design a relational schema for this task.
You should record group members for groups. Enforce the following constraints: every student is in at most one group, each slot has at most one group, each group has at most one slot.
Write SQL queries to list students who are not in any group, and groups that have not yet signed up for a slot. Write an SQL query to find all slots for which there is no group signed up. The query should only output these 10 tuples; assume for simplicity that the income values of different people are guaranteed to be different.
It presents the fundamental concepts of database management in an intuitive manner geared toward allowing students to begin working with databases as quickly as possible. It also contains additional material that can be used as supplements or as introductory material for an advanced course. Because the authors present concepts as intuitive descriptions, a familiarity with basic data structures, computer organization, and a high-level programming language are the only prerequisites.
Important theoretical results are covered, but formal proofs are omitted. In place of proofs, figures and examples are used to suggest why a result is true. Your email address will not be published.
0コメント