ANNA UNIVERSITY – TIRUNELVELI
QUESTION PAPER CODE: E 094
B.R/B.Tech DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2009
FIFTH SEMESTER
COMPUTER SCIENCE AND ENGINEERING
CS1301 – DATABASE MANAGEMENT SYSTEMS
(COMMON TO IT)
(REGULATIONS 2007)
PART – A (10 * 2 = 20 marks)
1. Explain the different views of data.
2. Differentiate a weak entity set from a strong entity set.
3. Define functional dependency.
4. State the various pitfalls in relational database
5. Write notes on Magnetic disks.
6. What is Multi level Indexing?
7. Explain the phases of the protocol which ensure serializability.
8. Classify the various types of system failure.
9. Define Object Persistence
10. List the importance of Data Mining.
PART – B (5 * 16 = 80 marks)
11.(a) (i) Explain DBMS architecture. (8)
(ii) How data models are categorized? (8)
Or
(b) (i) Let R= (A,B,C) and let r1and r2 both be relations on the schema R. Give an expression in the domain relational calculus that is equivalent to each of the following:
(1) ?A (r)
(2) sB = 17 (r)
(3) r1 n r2
(4) r1 U r2
(5) r1 – r2
(ii) Explain the various keys involved in relational database with a suitable example. (6)
12. (a) Explain the different levels of Normalization with a suitable example. (16)
Or
(b) Consider an employee database. Give an expression in SQL for each of the following queries attributes. (16)
(i) Find the names of all employees who work for First Bank Corporation.
(ii) Find the names and cities of residence of all employees who work for First Bank Corporation.
(iii) Find the names and cities of residence of all employees who work for First Bank Corporation and earn more than $ 10,000.
(iv) Find all the employees in the database who do not work for First Bank Corporation.
(v) Find all the employees in the database who earn more than every employee of Small Bank Corporation.
(vi) Assume that companies may be located in several cities. Find all companies located in every city in which small bank corporation is located.
(vii) Find the company that has the most employees.
(viii) Find the companies whose employees earn a higher salary, on average, than the average salary at the First Bank Corporation.
13. (a) Explain the various Hashing Techniques in detail with suitable examples. (16)
Or
(b) (i) Differentiate primary index and secondary index. (6)
(ii) Write about Hash functions. (6)
(iii) Write an assertion for the bank database to ensure that the assets value for the Perry ridge branch is equal to the sum of all the amounts lent by the Perry ridge branch. (4)
14. (a) (i) List the ACID properties, Explain each property in detail. (8)
(ii) Write notes on Conflict and View Serializability. (8)
Or
(b) (i) How deadlocks can be detected and recovered? (8)
(ii) Compare the differed and immediate-modification versions of the log based recovery schemes. (8)
15. (a) (i) Describe Object Oriented Data model. (8)
(ii) Discuss the various approaches in which the data can be fragmented in distributed database. Explain them with an example. (8)
Or
(b) (i) Compare OODBMS with ORDBMS. (8)
(ii) Explain the architecture of data mining in detail. (8)
KEYWORDS:DATABASE MANAGEMENT SYSTEMS,CS1301 – DATABASE MANAGEMENT SYSTEMS,2009 ANNA UNIVERSITY CHENNAI B.TECH INFORMATION TECHNOLOGY CS1301 DATABASE MANAGEMENT SYSTEMS QUESTION PAPER,ANNA UNIVERSITY DATABASE MANAGEMENT SYSTEMS QUESTION PAPER,ANNA UNIVERSITY,ANNA UNIVERSITY CHENNAI,ANNA UNIVERSITY COIMBATORE,ANNA UNIVERSITY TRICHY,ANNA UNIVERSITY TIRUNELVELI,ANNA UNIVERSITY MADURAI,ANNA UNIVERSITY SYLLABUS,ANNA-UNIVERSITY RESULTS,ANNA UNIVERSITY DISTANCE EDUCATION,ANNA UNIVERSITY MBA-CENTRE FOR DISTANCE EDUCATION,ANNA UNIVERSITY SCHEDULE OF EXAMINATIONS,ANNA UNIVERSITY ADMISSION,ANNA UNIVERSITY COURSES,ANNA UNIVERSITY ACADEMIC,ANNA UNIVERSITY DEPARTMENTS,ANNA UNIVERSITY RESEARCH,ANNA UNIVERSITY MAIL,ANNA UNIVERSITY QUESTION PAPERS,ANNA UNIVERSITY COUNSELLING DATES,ANNA UNIVERSITY RE-EVALUATION RESULTS
QUESTION PAPER CODE: E 094
B.R/B.Tech DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2009
FIFTH SEMESTER
COMPUTER SCIENCE AND ENGINEERING
CS1301 – DATABASE MANAGEMENT SYSTEMS
(COMMON TO IT)
(REGULATIONS 2007)
PART – A (10 * 2 = 20 marks)
1. Explain the different views of data.
2. Differentiate a weak entity set from a strong entity set.
3. Define functional dependency.
4. State the various pitfalls in relational database
5. Write notes on Magnetic disks.
6. What is Multi level Indexing?
7. Explain the phases of the protocol which ensure serializability.
8. Classify the various types of system failure.
9. Define Object Persistence
10. List the importance of Data Mining.
PART – B (5 * 16 = 80 marks)
11.(a) (i) Explain DBMS architecture. (8)
(ii) How data models are categorized? (8)
Or
(b) (i) Let R= (A,B,C) and let r1and r2 both be relations on the schema R. Give an expression in the domain relational calculus that is equivalent to each of the following:
(1) ?A (r)
(2) sB = 17 (r)
(3) r1 n r2
(4) r1 U r2
(5) r1 – r2
(ii) Explain the various keys involved in relational database with a suitable example. (6)
12. (a) Explain the different levels of Normalization with a suitable example. (16)
Or
(b) Consider an employee database. Give an expression in SQL for each of the following queries attributes. (16)
(i) Find the names of all employees who work for First Bank Corporation.
(ii) Find the names and cities of residence of all employees who work for First Bank Corporation.
(iii) Find the names and cities of residence of all employees who work for First Bank Corporation and earn more than $ 10,000.
(iv) Find all the employees in the database who do not work for First Bank Corporation.
(v) Find all the employees in the database who earn more than every employee of Small Bank Corporation.
(vi) Assume that companies may be located in several cities. Find all companies located in every city in which small bank corporation is located.
(vii) Find the company that has the most employees.
(viii) Find the companies whose employees earn a higher salary, on average, than the average salary at the First Bank Corporation.
13. (a) Explain the various Hashing Techniques in detail with suitable examples. (16)
Or
(b) (i) Differentiate primary index and secondary index. (6)
(ii) Write about Hash functions. (6)
(iii) Write an assertion for the bank database to ensure that the assets value for the Perry ridge branch is equal to the sum of all the amounts lent by the Perry ridge branch. (4)
14. (a) (i) List the ACID properties, Explain each property in detail. (8)
(ii) Write notes on Conflict and View Serializability. (8)
Or
(b) (i) How deadlocks can be detected and recovered? (8)
(ii) Compare the differed and immediate-modification versions of the log based recovery schemes. (8)
15. (a) (i) Describe Object Oriented Data model. (8)
(ii) Discuss the various approaches in which the data can be fragmented in distributed database. Explain them with an example. (8)
Or
(b) (i) Compare OODBMS with ORDBMS. (8)
(ii) Explain the architecture of data mining in detail. (8)
KEYWORDS:DATABASE MANAGEMENT SYSTEMS,CS1301 – DATABASE MANAGEMENT SYSTEMS,2009 ANNA UNIVERSITY CHENNAI B.TECH INFORMATION TECHNOLOGY CS1301 DATABASE MANAGEMENT SYSTEMS QUESTION PAPER,ANNA UNIVERSITY DATABASE MANAGEMENT SYSTEMS QUESTION PAPER,ANNA UNIVERSITY,ANNA UNIVERSITY CHENNAI,ANNA UNIVERSITY COIMBATORE,ANNA UNIVERSITY TRICHY,ANNA UNIVERSITY TIRUNELVELI,ANNA UNIVERSITY MADURAI,ANNA UNIVERSITY SYLLABUS,ANNA-UNIVERSITY RESULTS,ANNA UNIVERSITY DISTANCE EDUCATION,ANNA UNIVERSITY MBA-CENTRE FOR DISTANCE EDUCATION,ANNA UNIVERSITY SCHEDULE OF EXAMINATIONS,ANNA UNIVERSITY ADMISSION,ANNA UNIVERSITY COURSES,ANNA UNIVERSITY ACADEMIC,ANNA UNIVERSITY DEPARTMENTS,ANNA UNIVERSITY RESEARCH,ANNA UNIVERSITY MAIL,ANNA UNIVERSITY QUESTION PAPERS,ANNA UNIVERSITY COUNSELLING DATES,ANNA UNIVERSITY RE-EVALUATION RESULTS