0% found this document useful (0 votes)
50 views2 pages

Database Management System Spring Mid Semester Examination 2020

Uploaded by

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

Database Management System Spring Mid Semester Examination 2020

Uploaded by

shivamjana40
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
DBMSICS-2004/B Tech (CSE, IT, CSCE, CSSE & ECS)/4™ Semester/ 2020 Mid Semester Examination ~ 2020 School of Computer Engineering Kalinga Institute of Industrial Technology (KIIT) Deemed to be University ‘Subject: Database Management System Time: 1.5 Hrs Full Marks: 20 (Answer any Four Questions including Question No. 1) 1. Answer the following questions briefly. xs) Distinguish between Disjoint and Overlapping constraints? Differentiate between Theta join and Equi join. Primary key is not same as unique key -Justify your answer. Consider the below two tables for the given question Write a SQL query to fetch employee names having a salary greater than or equal to 5000 and less than or equal 10000. Table 1: EmployeeDetails aeoe oyeeSalary Fmt | pana 7 wining) [Erol [Pros [Satay Fort Truwane | tamgeta [Ducotining | [EBPH [ Bric: [ae 12 [Soin Seow [Sat [oraaora | [391 pa — [00 321 | Walter Whe [ 986 ovsoa01s—] [aa —b rr —[ 13000 Kuldeep x ai [Rater [are © | aravanie e. Given the relations Employee (eid, name, salary, deptno) and Department (depino, deptname, address) Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x, %, 6, p)? (a) Department address of every employee (b) Employees whose name is the same as their depariment name (©) The sum of all employees salaries (@ All employees of a given department. 2. Describe the three-schema architecture. Why do we need mappings between [5] schema levels? Also, differentiate between logical data independence and physical data independence. 3.(a) What are advantages of DBMS over traditional file based systems? 3] (b) Discuss the roles of Data Analyst and Application Programmer. 2] 4. Consider the following schema to write queries in relational Algebra: [5] Sailor(sid, sname, age, rating) Boats(bid, bname, bcolor) Reserves(sid.bid.day) a, Find id of the boats reserved by sailor with id 567. . Find the names of the sailors who reserved ‘red’ boats: ©. Find the boats which have at least two reservations by different sailors. 4d. Find the sailors name who have ratings of S and their name started with ‘P? ¢. Find the name of Sailors who have reserved boat id 100 on Monday: A University wants to maintain a database to store the information about their students, courses, lecturers, cabins, and subjects. The university hired a leading consultancy firm for the project. After a detailed analysis, the development team came up with the following design: 1. For students, the database stores the details like name, roll, dob, age, hobby, and address, The address consists of door_no, street_name, city, state, and pin, A student can register for many courses where each course has a course_id, and course_name. Similarly, a course can be taken by many students. 1. Each lecturer, with a lect_id, lect_name, email, and contact_no, is assigned with a cabin, with cabin_no, floor. However, a’ cabin can be allotied to 2 lecturers on sharing basis. IIL A lecturer can teach only one subject, where the subject has a subject_id, subject_name, and duration. However, a subject can be taught by many lecturers. IV. Each lecturer has a salary history which contains amt_credited, eredit_date, and deductions. V. Each Course consists of many subjects , however one subject can belongs to multiple courses, VI. The Lecturers are managing the students. ‘A. Draw ER diagram for the above scenario. B. Convert the ER diagram into relational schema Consider a schema with two relations, R(A, B) and S(B, C), where all values [5] are integers. Make no assumptions about keys. Consider the following three relational algebra expressions: a. mac(R > oB=1S) b. wa(oga1 R) x melo B-1 S) c. wac(taR x opS) ‘Two of the three expressions are equivalent (i.e., produce the same answer on all databases), while one of them can produce a different answer. Which query can produce a different answer? Give the simplest database instance you can think of where a different answer is produced. ~~ ALL THE BEST ~~~

You might also like