Please visit, subscribe and share 10 Minutes Lectures in Computer Science
Showing posts with label CS2255 DBMS Questions. Show all posts
Showing posts with label CS2255 DBMS Questions. Show all posts

Saturday, May 17, 2014

Anna University CS2255/CS46/CS1254/CS2029/CS606 Question Papers


Anna University CS6302/CS2255 - Database Management Systems Previous Year Question Papers / Anna University B.E/B.Tech. Computer Science and Engineering And Information Technology DBMS Question Papers / Anna University B.E/B.Tech. Fourth Semester Computer Science and Engineering And Information Technology Programs Previous Years Question Papers

Database Management Systems










Anna University CS2029 / CS606 - Advanced Database Technology Previous Year Question Papers / Anna University B.E/B.Tech. Computer Science and Engineering And Information Technology ADT Question Papers / Anna University B.E/B.Tech. Fourth Semster Computer Science and Engineering And Information Technology Programs Previous Years Question Papers

Advanced Database Technology








CS9024 Advanced Database Technology question paper - April/May 2014


CS2029 / CS606 Advanced Database Technology question paper - Nov/Dec 2014



By -
Labels: , ,

CS2255 Database Management Systems question paper - Nov/Dec 2012


CS2255 Database Management Systems question paper - Nov/Dec 2012 / Anna University Previous Year 2012 Exam Questions / Anna University Previous Year 2012 Computer Science and Information Technology Question Papers


Question Paper Code : 11275
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012
Fourth Semester
Computer Science and Engineering
CS 2255/141405/CS 46/CS 1254/10144 CS 406/080250009 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
(Regulation 2008)
(Common to PTCS 2255 – Database Management Systems for B.E. (Part-Time) for Third Semester – Computer Science and Engineering (Regulation 2009))
Time : Three Hours                                                          Maximum : 100 marks
Answer ALL Questions
PART A – (10 X 2 = 20 marks)

1. Distinguish the terms primary key and super key.
2. Specify the difference between physical and logical data independence.
3. Mention the six fundamental operations of relational algebra and their symbols.
4. List two reasons why null values might be introduced into the database.
5. Define Multivalued dependency.
6. Show that, if a relational database is in BCNF, then it is also in 3NF.
7. Write down the SQL facilities for recovery.
8. State the write-ahead log rule. Why is the rule necessary?
9. What can be done to reduce the occurrence of bucket overflows in a hash file organization?
10. How might the type of index available influence the choice of a query processing strategy?

PART B – (5 X 16 = 80 marks)

11. (a) (i) Discuss in detail about the major disadvantages of file-processing system.(6)
(ii) Explain in detail about different data models with neat diagram.(10)
Or
(b) Draw an E-R diagram for a Life insurance company with almost all components and explain.(16)
12. (a) Give an introduction to Distributed Database and Client/Server database.(16)
Or
(b) Illustrate the uses of Embedded SQL and Dynamic SQL with suitable examples.(16)
13. (a) Explain in detail about all functional dependencies based normal forms with suitable examples.(16)
Or
(b) Describe about the Join Dependencies and Fifth normal form with suitable example.(16)
14. (a) Discuss in detail about transaction concepts and two phase commit protocol.(16)
Or
(b) Write down in detail about intent locking and isolation levels.(16)
15. (a) Jot down detailed notes on ordered indices and B-Tree index files.(16)
Or
(b) Describe in detail about RAID and Tertiary storage.(16)

________________________

 
By -
Labels: , ,

Friday, May 16, 2014

CS2255 Database Management Systems question paper - May/June 2013


CS2255 Database Management Systems question paper - May/June 2013 / Anna University Previous Year 2013 Exam Questions / Anna University Previous Year 2013 Computer Science and Information Technology Question Papers



Question Paper Code : 21305
B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2013
Fourth Semester
Computer Science and Engineering
CS 2255/CS 46/CS 1254/10144 CS 406/08025009 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)

(Regulation 2008/2010)

(Common to PTCS 2255 – Database Management Systems for B.E. (Part-Time) Third Semester – Computer Science and Engineering (Regulation 2009))

Time: Three hours                                                       Maximum: 100 Marks
Answer ALL Questions

PART A — (10 × 2 = 20 Marks)
1. Define Atomicity in Transaction management.
2. Give example for one to one and one to many relationship.
3. What are primary key constraints?
4. Write the purpose of Trigger.
5. Define Boyce Codd Normal Form.
6. What is the need for Normalization?
7. List ACID properties.
8. Define two phase locking.
9. What is the need for RAID?
10. What is the basic difference between static hashing and dynamic hashing?

PART B — (5 × 16 = 80 Marks)
11. (a) Explain the purpose of database system
Or
 (b) Write about the structure of database system architecture with block diagram.
12. Consider the following relational database
          Employee (Employee-Name, Street, City)
          Works (Employee-Name, Company-Name, Salary)
          Company (Company-Name, City)
          Manager (Employee-Name, Manager-Name)
Give an SQL DDL definition of this database. Identify referential integrity constraints that should hold, and include them in the DDL definition.
Or
 (b) Consider the following relation
Employee (Employee-Name, Company-Name, Salary)
Write SQL for the following:                                                                 (4 X 4 = 16)
          (i) Find the total salary of each company
          (ii) Find the employee name who is getting lowest salary
          (iii) Find the company name which has lowest average salary
          (iv) Find the employee name whose salary is higher than average salary of TCS.
13. (a) Consider the following relation
CAR-SALE (Car#, Date-Sold, Salesman#, Commission%, Discount-amount)
Assume that a car may be sold by multiple salesmen, and hence (Car#, Salesman#) is the primary key.
Additional dependencies are,
Date-Sold --> Discount-amount
and
Salesman# --> Commission%
Based on the given primary key, is this relation in 1NF, 2NF, or 3NF? Why or why not? How would you successively normalize it completely?
Or
 (b) Explain the principles of
          (i) Loss less join decomposition                                                            (5)
          (ii) Join dependencies                                                                         (5)
          (iii) Fifth normal form                                                                         (6)
14. (a) Illustrate deadlock and conflict serializability with suitable example.
Or
(b) (i) Explain two phase commit protocol.                                                    (10)
     (ii) Write different SQL facilities for recovery                                            (6)
15. (a) Construct B+ tree to insert the following (order of the tree is 3)
26, 27, 28, 3, 4, 7, 9, 46, 48, 51, 2, 6.
Or
 (b) Let relations r1(A, B, C) and r2(C, D, E) have the following properties:
r1 has 20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block and 30 tuples of r2 fit on one block. Estimate the number of block transfers and seeks required, using each of the following Join strategies for r1⋈ r2:


          (i) Nested-loop join.                                                                           (4)
          (ii) Block nested-loop join.                                                                  (8)
          (iii) Merge join.                                                                                  (4)

_____________________________

By -
Labels: , ,

CS2255 Database Management Systems question paper - May/June 2012


CS2255 Database Management Systems question paper - May/June 2012 / Anna University Previous Year 2012 Exam Questions / Anna University Previous Year 2012 Computer Science and Information Technology Question Papers




Question Paper Code : 10267
B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2012
Fourth Semester
Computer Science and Engineering
CS 2255/141405/CS 46/CS 1254/10144 CS 406/08025009 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
(Regulation 2008)
Time: Three hours                                                       Maximum: 100 Marks
Answer ALL Questions

PART A — (10 × 2 = 20 Marks)
1. List four significant differences between a file-processing system and a DBMS.
2. What are the different types of Data Models?
3. Describe a circumstance in which you would choose to use embedded SQL rather than using SQL alone.
4. List two major problems with processing of update operations expressed in terms of views.
5. Give an example of a relation schema R and a set of dependencies such that R is in BCNF, but not in 4NF.
6. Why are certain functional dependencies called as trivial functional dependencies?
7. List down the SQL facilities for concurrency.
8. What benefit does strict two-phase locking provide? What disadvantages result?
9. Mention the different Hashing techniques.
10. When is it preferable to use a dense index rather than a sparse index? Explain your answer.

PART B — (5 × 16 = 80 Marks)
11. (a) Discuss in detail about database system architecture with neat diagram.
Or
(b) Draw an E-R diagram for a banking enterprise with almost all components and explain.
12. (a) Explain in detail about Relational Algebra, Domain Relational Calculus, and Tuple Relational Calculus with suitable examples.
Or
(b) Briefly present a survey on Integrity and Security.
13. (a) Explain in detail about 1NF, 2NF, 3NF, and BCNF with suitable examples.
Or
(b) Describe about the Multi-Valued Dependencies and Fourth normal form with suitable example.
14. (a) Discuss in detail about Transaction Recovery, System Recovery and Media Recovery.
Or
(b) Write down in detail about Deadlock and Serializability.
15. (a) Construct a B+ tree to insert the following key elements (order of the tree is 3) 5, 3, 4, 9, 7, 15, 14, 21, 22, 23.
Or
(b) Describe in detail about how records are represented in a file and how to organize them in a file.
_____________________________

By -
Labels: , ,
Subscribe to: Posts (Atom)

Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents

data recovery