0% found this document useful (0 votes)
11 views

Assignment-1 DBMS

Uploaded by

whtpepsi1999
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views

Assignment-1 DBMS

Uploaded by

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

INSTITUTE OF ENGINEERING & SCIENCE

DEPARTMENT OF COMPUTER SCEINCE & ENGINEERING


CSE (DATA SCIENCE)
SESSION JAN-JUNE 2024

ASSIGNMENT- I

Q-1 Explain about the three schema architecture in detail?

Q-2 What are data models? Explain with its classification?

Q-3 Explain the concept of Generalization, specialization and Aggregation with example?

Q-4 Write the comparison between the Relational model, Object-oriented and Semi-Structured
model?

Q-5 Explain about the DBA and also its roles and responsibilities?

Q-6 Explain about ER Diagram with an example?


INSTITUTE OF ENGINEERING & SCIENCE
DEPARTMENT OF COMPUTER SCEINCE & ENGINEERING
CSE (DATA SCIENCE)
SESSION JAN-JUNE 2023

ASSIGNMENT- II

Q-1 Explain about the relational data model with an example?

Q-2 Explain about the concepts of keys? Explain in detail about candidate key, super key with
example?

Q-3 Illustrate about integrity and key constraints with suitable examples?

Q-4 Write short note on :


a)DDL
b)DML
c)TCL

Q-5 Explain relational algebra operations select, project, join, union with example?

Q-6 Explain about the relational calculus and its operations?


INSTITUTE OF ENGINEERING & SCIENCE
DEPARTMENT OF COMPUTER SCEINCE & ENGINEERING
CSE (DATA SCIENCE)
SESSION JAN-JUNE 2023

ASSIGNMENT- III

Q-1 What is the need of normalization? Explain.

Q-2 What is BCNF? How does it differ from 3NF?

Q-3 What is functional dependency and also write example?

Q-4 Compute the closure of the following set F of functional dependencies for relation schema R
(ABCDE). F = {A->BC, CD->E, B->D, E->A} List the candidate keys for R.

Q-5 Write a short note on:

i)Lossless Decomposition

ii) Dangling Tuples

iii)Multi valued Dependency

Q-6 Explain the concept of Query Optimization?


INSTITUTE OF ENGINEERING & SCIENCE
DEPARTMENT OF COMPUTER SCEINCE & ENGINEERING
CSE (DATA SCIENCE)
SESSION JAN-JUNE 2023

ASSIGNMENT- IV

Q-1 Discuss the basic concepts of transaction and write ACID properties.

Q-2 Explain the concept of Serializability of schedules?

Q-3 Explain Log based recovery in brief?

Q-4 Explain Locking techniques for concurrency control?

Q-5 Discuss on strict two phase –locking protocol and time-stamp based
protocol?

Q-6 How concurrency is performed? Explain the protocol that is used to


maintain the concurrency concept?

Q-7 What is serializability ? Write an algorithm for testing conflict serializabilty


of a schedule .
INSTITUTE OF ENGINEERING & SCIENCE
DEPARTMENT OF COMPUTER SCEINCE & ENGINEERING
CSE (DATA SCIENCE)
SESSION JAN-JUNE 2023

ASSIGNMENT- V

Q-1 Write short note on following:

i) Nested and Parameterized constructor

ii) Branching and looping construct in ANSI SQL

iii)Distributed database

Q-2 Explain various types of joins with examples.

Q-3 Explain triggers and assertion and explain it with through with proper

query?

Q-4 . Explain the following feature of ORACLE:

(i) Sequence (ii) Triggers (iii) SQL loader

Q-5 How is the database organized in oracle?

Q-6 Explain the concept of dedicated and multi-threaded server?

You might also like