Back to the 2024 paper
Similar questions
Database Management SystemConsidering the following schema, create the appropriate tables and insert at least 5 records: AUTHOR (author-id, name, city, country) PUBLISHER (publisher-id, name, city, country) CATALOG (book-id, title, author-id, publisher-id, category-id, year, price) CATEGORY (category-id, description) ORDER-DETAILS (order-no, book-id, quantity) Write each of the following queries in SQL and relational algebra: (a) Obtain the names of authors who have 2 or more books in the catalog. (b) Find the author of the book which has maximum sales. (c) Obtain the names of author who have maximum number of publisher. (d) Obtain the name of the city, author, publisher where publisher and author belong to same city. (e) Obtain the title of books which has maximum sales. (f) Obtain the book-id, description for the author who have exactly 3 books in the catalog. (g) Obtain the author and publisher who have published books in more than or equal to 2 categories.201914mDatabase Management SystemConsider: * Student(SID, Name, Dept, Age) * Course(CID, CName, Faculty) * Enroll(SID, CID, Marks) 1. Write relational algebra expressions to find: * a) Students enrolled in DBMS * b) Students scoring >80 marks * c) Students not enrolled in any course 2. Write SQL queries: * a) Find highest marks * b) Find average marks department-wise * c) Display students enrolled in more than two courses 3. Translate the following query into tuple relational calculus: * "Find names of students from CSE department." 4. Convert the following relational algebra into SQL: * \pi_{Name}(\sigma_{Marks > 85}(Student \bowtie Enroll))202510mDatabase Management SystemConsider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price), Collection (Title, Author, Catalog_no) with in the following functional dependencies: I. Title Author → Catalog_no II. Catalog_no → Title, Author, Publisher, Year III. Publisher Title Year → Price Analyze and find the highest normal form of the relation Book and Collection.20247mDatabase Management SystemGiven the Students' relation as shown below: | StudentID | StudentName | StudentE-mail | StudentAge | CPI | |---|---|---|---|---| | 2345 | Shankar | shankar@math | X | 9.4 | | 1287 | Swati | swati@ee | 19 | 9.5 | | 7853 | Shankar | shankar@cse | 19 | 9.4 | | 9876 | Swati | swati@mech | 18 | 9.3 | | 8765 | Ganesh | ganesh@civil | 19 | 8.7 | For (StudentName, StudentAge) to be the key for this instance, the value X should not be equal to: (i) 18 (ii) 19 (iii) 15 (iv) 2020192m
PreviousConsider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price), Collection (Title, Author, Catalog_no) with in the following functional dependencies: I. Title Author → Catalog_no II. Catalog_no → Title, Author, Publisher, Year III. Publisher Title Year → Price Analyze and find the highest normal form of the relation Book and Collection.NextExplain schedule and transaction. Define the concepts of recoverable, cascade less, and strict schedules, and compare them in terms of their recoverability.