Scribd
Upload
12 views1 page

Question-Database Internals II

This document outlines the structure and content of the B.Tech. Degree Continuous Assessment Examination II for the Artificial Intelligence & Data Science department, focusing on Database Design and Management. It includes course outcomes related to relational database design, concurrency techniques, and querying in various database models. The exam consists of two parts: Part A with short answer questions and Part B with detailed explanation questions.

Uploaded by

Jeffy Shiny
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views1 page

Question-Database Internals II

This document outlines the structure and content of the B.Tech. Degree Continuous Assessment Examination II for the Artificial Intelligence & Data Science department, focusing on Database Design and Management. It includes course outcomes related to relational database design, concurrency techniques, and querying in various database models. The exam consists of two parts: Part A with short answer questions and Part B with detailed explanation questions.

Uploaded by

Jeffy Shiny
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

B.Tech.

DEGREE CONTINUOUS ASSESSMENT EXAMINATION – II, NOV 2024


Semester: 05
Department Artificial Intelligence & Data Science
AD3391 – Database Design and Mangement
Time: 2 hrs. Maximum: 60 marks
(Answer All the Questions)
Course Outcomes (COs) for Assessment in this examination
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
CO5 Apply the data model and querying in Object-relational and No-SQL databases.
CL-Cognitive Level; R-Remember; Un-Understand; Ap-Apply; An-Analyze; Ev-Evaluate;
Cr-Create
PART A (10 X 2 = 20)

1. What is meant by Normalization. Un CO3


2. Define transitive rule Un CO 3
3. Define decomposition with an example Un CO 3
4. Difference 3NF and BCNF An CO 3
5. Define Concurrency control Un CO 4
6. Define Growing phase and Shrinking Phase Un CO 4
7. Differentiate Serial and Non Serial Schedule An CO 4
8. Differentiate SQL and NoSQL An CO 5
9. Define OID Un CO 5
10. What is CAP theorem Un CO 5

PART B (40-marks)

Explain about the inference rules of functional dependency in


11.a Un CO 3
detail (16)
OR
Explain about the normalization and its types with an example
11.b Un CO 3
in detail (16)
Explain Two phase locking Techniques with its types and
12.a Un CO 4
drawbacks (16)
OR
Explain about the Concurrency control and Problems of
12.b Un CO 4
Concurrency (16)
Compare Column based and Document based data model in
13.a An CO 5
nosql (8)
OR
13.b How will you map EER to ODB schema (8) Un CO 5

For Exam Cell Purpose

Remarks:

Scrutinized by

You might also like