Scribd
Upload
29 views

DDM IAT - II

ddm question paper

Uploaded by

pavithrakumarmba6109
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
29 views

DDM IAT - II

ddm question paper

Uploaded by

pavithrakumarmba6109
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Reg. No.

IAT

Jayalakshmi Institute of Technology Thoppur, Dharmapuri - 636 352.

B.E.- DEGREE INTERNAL EXAMINATION – I - Oct./Nov.-2024


Regulations - 2021

Year/Semester : III Year/V Semester Max Marks : 50


Branch : Duration : 1.5 Hrs
Subject Code & Title : CSEaaaaaaaaaaaaaaaaa
CS3501 - Compiler Design Date &Session :

Q.No. PART – A (5x 2 = 10 Marks) Answer All Questions CO BTL


1. Define Functional Dependency CO1 K4
2. Show that if a relation is in BCNF then it is also in 3NF CO1 K1
3. Explain at least two desirable properties of decomposition CO1 K3
4. What benefit does strict two-phase locking provide? What disadvantage result? CO1 K4
5. What is meant by serializability? How it is t CO1 K2

PART – B (4X 10 = 40 Marks) Answer All Questions


Q.No. Marks CO BTL

Show how each ER model construct can be mapped to the relational CO1 K4
11. (a) (i) (10)
model. Discuss the option for mapping EER construct?
(ii) Brief explain Properties of Relational Decomposition? (10) CO1 K1
(or)
Consider the following Functional Dependency R(ABCDE) for finding
(b) (i) (10)
minimal cover or canonical cover FD={A->C, AC->D, B->ADE} CO1 K2
What are normal forms? Explain the types of normal form with an CO1 K4
(ii) (10)
example?
12. (a) (i) Discuss in detail about the ACID properties of transaction? (10) CO1 K2
(ii) Explain schedule and its types? (10) CO1 K4
(or)

(b) (i) Prove that two phase locking guarantees serializability? (10)
CO1 K1
What are ACID properties? Discuss elaborately the two phase locking
(ii) (10)
protocol that ensures serializability? CO1 K2

CO3 Apply the conceptual-to-relational mapping and normalization to design relational database

CO4 Determine the serializability of any non-serial schedule using concurrency techniques

LOTS HOTS
Blooms Remembering Understanding Applying Analysing Evaluating Create Total
(K1) (K2) (K3) (K4) (K5) (K6)
Marks 22 22 2 34 0 0 90
% 22 22 2 34 0 0 90

Course Instructor Module Coordinator Program Coordinator

You might also like