Download DBATU B.Tech 2019 Oct-Nov CSE 5th Sem Database Question Paper

DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Mid Semester Examination – Oct 2019

Course: B. Tech in Computer Science and Engineering

--- Content provided by‍ FirstRanker.com ---

Subject Name: Database Systems

Sem: V

Subject Code: BTCOC501

Max Marks: 20

Duration: 1 Hr.

--- Content provided by⁠ FirstRanker.com ---

Date: 23-09-2019 to 05-10-2019

Instructions to the Students:

1. Attempt all questions as per the instructions.
2. Assume suitable data wherever necessary.
3. Draw necessary diagram.

--- Content provided by⁠ FirstRanker.com ---

1. The attribute name could be structured as an attribute consisting of first name, middle initial, and last name. This type of attribute is called
   a) Simple attribute b) Composite attribute c) Multivalued attribute d) Derived attribute (Level/CO) Marks 6
2. A super key is a set of one or more attributes that, taken collectively, allow us
   a) to identify uniquely an entity in the entity set b) to make the key most powerful for faster retrieval
   c) to increase effectiveness of database access d) none of the above

--- Content provided by​ FirstRanker.com ---

3. The set of all possible values of data item is called:
   a) Domain b) Attribute c) Tuples d) None
4. A relation is in 1NF if it doesn't contain any
   a) Determinants b) Repeating groups c) Null values in primary key fields d) Functional dependencies
5. The operation which only selects some of the columns from a table and neglects the remaining columns is classified as
   

   --- Content provided by⁠ FirstRanker.com ---

   a) OR operation b) AND operation c) TABLE operation d) PROJECT operation
6. Using Relational Algebra, the query that finds customers who have a balance of over 1000 is
   a) Customer_name(s balance >1000(Deposit)) b) s Customer_name(? balance >1000(Deposit))
   c) ? Customer_name(s balance >1000(Borrow)) d) s Customer_name(? balance >1000(Borrow))

Q.2 Solve Any Two of the following. (3 X)

--- Content provided by‍ FirstRanker.com ---

1. Define functional dependency? List out and explain the Armstrong's inference rules of functional dependencies with a suitable example.
2. What do you mean by a key? Explain the different types of keys in DBMS? FirstRanker.com
3. Illustrate with a suitable diagram the three-level schema architecture. Why do we need mapping between schema levels?

Q.3 Solve Any One of the following. (8)

1. Consider the following schema, write relational algebra queries for the following:
   

   --- Content provided by FirstRanker.com ---

   Suppliers (sid, sname, address)
   Parts (pid, pname, color)
   Catalog (sid, pid, cost)
   1. Find the sids of suppliers who supply red part.
   2. Find the name of suppliers who supply parts costing <150.
   3. Find the IDs of suppliers who supply red or green parts.

   --- Content provided by FirstRanker.com ---

   4. Find the sids of suppliers who supply some red part or are at 221 Park Street.
2. Consider the following attribute and normalize the table up to 3NF.
   Emp_code Dept_code Mgr_code
   Course_code Course_Title
   

   --- Content provided by⁠ FirstRanker.com ---

   FDs mentioned for the above relation are:
   Emp_code ? Dept_code
   Emp_code ? Mgr_code
   Course_code ? Course_Title

Firstranker's choice

--- Content provided by‍ FirstRanker.com ---

*** End ***