Showing posts with label Anna University DBMS Questions. Show all posts
Showing posts with label Anna University DBMS Questions. Show all posts

Friday, 19 January 2018

CS6302 Anna University Database Management Systems April May 2017

Anna University Questions with Answers - CS6302 Database Management Systems April May 2017, Computer Science and Engineering, Information Technology Questions, Third semester, fifth, and eighth semester, Regulation 2013

CS6302 Database Management Systems for B.E. Computer Science and Engineering

CS6302 Database Management Systems for B.Tech. Information Technology

CS6302 Database Management Systems for B.E. Mechanical and Automation Engineering

Exam
B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year
April May 2017
Subject Code
CS6302
Subject Name
Database Management Systems
Branch
Computer Science and Engineering
Semester
Third/Fifth/Eighth Semester
Regulation
2013

Question Paper Code : 71674
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2017.
Third/Fifth/Eighth Semester
Computer Science and Engineering
CS 6302 — DATABASE MANAGEMENT SYSTEMS
(Common to Mechanical and Automation Engineering, Mechatronics Engineering, Information Technology)
(Regulation 2013)


Time : Three hours                                                             Maximum : 100 marks

Answer ALL questions.
PART A — (10 × 2 = 20 marks)

1. What are desirable properties of decomposition?
2. Distinguish between key and super key.
3. What is query execution plan?
4. Which cost components are used most often as the basis for cost functions?
5. What is serializable schedule?
6. What type of locking needed for insert and delete operations?
7. Define replication transparency.
8. State the functions of data marts.
9. Define support and confidence.
10. Distinguish between threats and risks.

PART B — (5 × 13 = 65 marks)

11. (a) Discuss the correspondence between the ER model construct and the relational model constructs. Show how each ER model construct can be mapped to the relational model. Discuss the option for mapping EER model construct.
Or
(b) (i) Explain the overall architecture of the database system in detail. (8)
(ii) List the operations of relational algebra and the purpose of each with example. (5)

12. (a) What is meant by semantic query optimization? How does it differ from other query optimization technique? Give example.                   (13)
Or
(b) Justify the need of embedded SQL. Consider the relation student (reg no, name, mark, grade). Write embedded dynamic SQL program in C language to retrieve all the students’ records whose mark is more than 90.  (2+11)

13. (a) Discuss the violations caused by each of the following; dirty read, non-repeatable read and phantoms with suitable example.
Or
(b) Explain why timestamp based concurrency control allows schedules that are not recoverable. Describe how it can be modified through buffering to disallow such schedules.

14. (a) (i) Compare and contrast the distributed database and the centralized database systems. (8)
(ii) Describe the mobile database recovery schemes. (5)
Or
(b) Explain what a RAID system is. How does it improve performance and reliability? Discuss the level 3 and level 4 of RAID.

15. (a) (i) What are basic crawling operations? Explain the processing steps in crawling procedure with example.  (8)
(ii) Explain the process of querying XML data with an example. (5)
Or
(b) Discuss the various components of data warehouse and explain the different data models used to store data with example.

PART C — (1 × 15 = 15 marks)

16. (a) Consider the relation schema given in Figure 1. Design and draw an ER diagram that capture the information of this schema.  (5)
Employee (empno, name, office, age)
Books (isbn, title, authors, publisher)
Loan (empno, isbn, date)
Figure 1.
Write the following queries in relational algebra and SQL.
(i) Find the names of employees who have borrowed a book published by McGraw-Hill. (5)
(ii) Find the names of employees who have borrowed all books published by McGraw-Hill. (5)
Or
(b) Trace the results of using the Apriori algorithm on the grocery store example with support threshold s=33.34% and confidence threshold c=60%. Show the candidate and frequent item sets for each database scan. Enumerate all the final frequent itemsets. Also indicate the association rules that are generated and highlight the strong ones, sort them by confidence.
Transaction ID
T1
T2
T3
T4
T5
T6
Items
HotDogs, Buns, Ketchup
HotDogs, Buns
HotDogs, Coke, Chips
Chips, Coke
Chips, Ketchup
HotDogs, Coke, Chips

***********










Wednesday, 21 September 2016

CS6302 Database Management Systems November December 2015

Anna University Questions with Answers - CS6302 Database Management Systems November December 2015, Computer Science and Engineering, Information Technology Questions, Third semester and fifth semester, Regulation 2013

CS6302 Database Management Systems for B.E. Computer Science and Engineering

CS6302 Database Management Systems for B.Tech. Information Technology

CS6302 Database Management Systems for B.E. Mechanical and Automation Engineering


Exam
B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year
November December 2015
Subject Code
CS6302
Subject Name
Database Management Systems
Branch
Computer Science and Engineering
Semester
Third/Fifth Semester
Regulation
2013

B.E / B.Tech. DEGREE END SEMESTER EXAMINATIONS, NOVEMBER / DECEMBER 2015
Computer Science and Engineering
Third/Fifth Semester
CS6302 – DATABASE MANAGEMENT SYSTEMS
(Common to B.Tech. Information Technology B.E. Mechanical and Automation Engineering B.E. Computer and Communication Engineering)
(Regulations 2013)
Time : 3 Hours                      Answer A L L Questions                Max. Marks 100
PART-A (10 x 2 = 20 Marks)

1. State the anomalies of 1NF.
2. Is it possible for several attributes to have same domain? Illustrate your answer with suitable examples.
3. Differentiate Static and Dynamic SQL.
4. Why does SQL allow duplicate tuples in a table or in a query result?
5. What is meant by concurrency control?
6. Give an example of Two phase commit protocol.
7. Differentiate Static and Dynamic Hashing.
8. Give an example of a join that is not simple equi-join for which partitioned parallelism can be used.
9. List the types of privileges used in database access control.
10. Can we have more than one constructor in a class? If yes, explain the need for such situation.

Part-B (5* 16 = 80 Marks)

11. (a) (i) With help of a neat block diagram explain the basic architecture of a database management system. [8]
(ii) What are the advantages of having a centralized control of data? Illustrate your answer with suitable example. [8]
Or
(b) A car-rental company maintains a vehicle database for all vehicles in its current fleet. For all vehicles, it includes the vehicle identification number, license number, manufacturer, model, date of purchase, and color. Special data are included for certain types of vehicles:
Trucks: cargo capacity
Sports cars: horsepower, renter age requirement
Vans: number of passengers
Off-road vehicles: ground clearance, drivetrain (four- or two-wheel drive)
Construct an ER model for the car rental company database. [16]

12. (a) Describe the six clauses in the syntax of an SQL query, and show what type of constructs can be specified in each of six clauses. Which of the six clauses are required and which are optional?
Or
(b) Assume the following table.
Degree (degcode, name, subject)
Candidate (seatno, degcode, name, semester, month, year, result)
Marks (seatno, degcode, semester, month, year, papcode, marks)
[degcode – degree code, name – name of the degree (Eg. MSc.), subject – subject of the course (Eg. Physis), papcode – paper code (Eg. A1)]
Solve the following queries using SQL;
Write a SELECT statement to display,
(i) all the degree codes which are there in the candidate table but not present in degree table in the order of degcode. [4]
(ii) the name of all the candidates who have got less than 40 marks in exactly 2 subjects. [4]
(iii) the name, subject and number of candidates for all degrees in which there are less than 5 candidates. [4]
(iv) the names of all the candidate who have got highest total marks in MSc. Maths. [4]

13. (a) (i) What is Concurrency control? How is implemented in DBMS? Illustrate with suitable example.  [8]
(ii) Discuss view serializability and conflict serializability. [8]
Or
(b) What is deadlock? How does it occur? How transactions can be written to
(i) Avoid deadlock.
(ii) Guarantee correct execution.
Illustrate with suitable example.

14. (a) (i) What is RAID? List the different levels in RAID technology and explain its features.
(ii) Illustrate indexing and hashing techniques with suitable examples.
Or
(b) Write short notes on
(i) Spatial and multimedia databases.
(ii) Mobile and web databases.

15. (a) (i) Describe the GRANT functions and explain how it relate to security. What types of privileges may be granted? How rights could be revoked?
(ii) Write short notes on Data Warehousing.
Or
(b) Suppose an object oriented database had an object A, which references object B, which in turn references C. Assume all objects are in disk initially. Suppose a program first dereferences A, then dereferences B by following the reference from A, and then finally dereferences C. Show the objects that are represented in memory after each dereference, along with their state.

************************











Lossless join decomposition one more example

Lossless Join Decomposition Question: Let R = {ssn, ename, pnumber, pname, plocation, hours} and R is decomposed into three re...