Accounting and Financial Management (3) Analog and Digital Communication (2) Artificial Intelligence (2) BE(Civil) (2) BE(CSE) (83) BE(ECE) (11) BE(Mech) (10) Business Processes (3) C# and .NET Framework (2) Communication Skills (1) Compiler Design (1) COMPONENT BASED TECHNOLOGY (1) COMPUTER ARCHITECTURE (1) COMPUTER GRAPHICS and MULTIMEDIA SYSTEMS (6) COMPUTER INTEGRATED MANUFACTURING (1) Computer Networks (9) Computer Organization (2) Computer Programming (1) Consumer Behaviour (1) Control Systems (1) Cryptography and Network Security (3) Datastructures and Algorithms (10) Datawarehousing and Mining (1) DBMS (5) DESIGN AND ANALYSIS OF ALGORITHMS (9) DESIGN OF MACHINE ELEMENTS (1) DIGITAL PRINCIPLES AND SYSTEMS DESIGN (3) Discrete Mathematics (1) DISTRIBUTED COMPUTING (2) DSP (8) DYNAMICS OF MACHINERY (2) Economic Foundations (1) ELECTRICAL ENGINEERING (1) ELECTRICAL ENGINEERING AND CONTROL SYSTEMS (1) Electromagnetic Fields (3) ELECTRONIC CIRCUITS (1) ELECTRONIC COMMERCE (4) ELECTRONIC DEVICES AND CIRCUITS (1) EMBEDDED SYSTEMS (1) FUNDAMENTALS OF COMPUTING (2) Graphics and Multimedia (3) HEAT AND MASS TRANSFER (1) HUMAN RESOURCE MANAGEMENT (1) Internet Programming (9) INTRODUCTION TO FINITE ELEMENT ANALYSIS (1) Legal Aspects of Business (1) MANAGEMENT INFORMATION SYSTEMS (1) Marketing Management (1) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (4) MATHEMATICS - I (1) MBA (9) MCA (83) MCA QUESTION BANK (2) MECHATRONICS (1) MicroProcessor and Controllers (4) MICROPROCESSORS AND APPLICATIONS (5) MIDDLE WARE TECHNOLOGIES (3) MOBILE COMPUTING (5) NETWORK PROGRAMMING (1) NUMERICAL METHODS (1) OBJECT ORIENTED ANALYSIS AND DESIGN (5) Object Oriented Programming (18) Operating System (2) OPERATING SYSTEMS (9) Organizational Behaviour (2) POWER ELECTRONICS (1) Principles of Management (8) PROBABILITY AND QUEUEING THEORY (2) Probability and Statistics (1) PROBLEM SOLVING AND PROGRAMMING (2) PROCESS PLANNING AND COST ESTIMATION (1) PROFESSIONAL ETHICS AND HUMAN VALUES (1) RANDOM PROCESSES (1) RESOURCE MANAGEMENT TECHNIQUES (2) ROBOTICS (1) Security analysis (1) Service Marketing (1) SIGNALS AND SYSTEMS (1) Software Engineering (8) SOFTWARE PROJECT MANAGEMENT (4) SOFTWARE QUALITY MANAGEMENT (2) System Software (2) TCP/IP PROTOCOL SUITE (3) Theory of Computation (4) Total Quality Management (2) UNIX AND NETWORK PROGRAMMING (4) Visual Programming (2) WEB GRAPHICS (2) WEB TECHNOLOGY (2) XML AND WEB SERVICES (4)

Tuesday, March 9, 2010

DATABASE MANAGEMENT SYSTEMS Apr/May 2008


B.E/B.Tech DEGREE EXAMINATION Apr/May 2008
Fifth semester

Computer Science and Engineering
(Regulation 2004)
Time: 3 hours                                                                                                                                             Maximum marks: 100

Answer ALL questions
PART A (10 x 2 =20 marks)
1. Define Data independence.
2. Distinguish between primary key and candidate key
3. With an example explain a weak entity in an ER diagram.
4. With an example explain referential integrity.
5. What is domain integrity? Give example.
6. Distinguish between dense and sparse indices.
7. List the properties that must be satisfied by a transaction,
8. Define deadlock.
9. State the advantages of distributed systems.
10. What is data warehousing?
PART B (5 x 16 = 80)
11. (a) (i) Construct an ER diagram for a car insurance company that has a set of customers, each of whom owns one/more cars. Each car has associated with it zero to any number of recorded accidents. (Cool
(ii) Construct appropriate tables for the above ER diagram. (Cool
(or)
(b) (i) Define data model. Explain the different types of data models with relevant examples. (10)
(ii) Explain the role and functions of the database administrator. (6)
12 (a) (i) with relevant examples discuss the following in SQL.
(i) Data Definition Language. (4)
(ii) Data Manipulation Language (4)
(iii) Data Control Language (4)
(iv) Views (4)
(or)
(b) What is normalization? Explain normalization techniques using functional dependencies with relevant examples. (16)
13 (a) Explain following with relevant examples:
(i) B tree (5)
(ii) B+ tree (5)
(iii) Static and dynamic hashing (6)
(or)
(b) With a relevant example discuss the steps involved in processing a query. (16)
14 (a) Explain testing for serializability with respect to concurrency control schemes. How will you determine, whether a schedule is serializable or not. (16)
(or)
(b) Explain the following concurrency control:
(i) Lock based protocol (Cool
(ii) Time stamp based protocol (Cool
15 (a) State and explain the object oriented data model. Use banking application as an example. (16)
(or)
(b) Write detail notes on following:
(i) Distributed Databases (Cool
(ii) Data Mining (Cool

No comments:

Post a Comment