DHIRAJLAL GANDHI COLLEGE OF

TECHNOLOGY, SALEM Course File

Document 1. File Content

Document ID: 2022-23/ DGCT/CSE
Name: (Index)

Name of the Programme:

Academic Year/ Sem: 2022-2023/ IV
Batch of the student: 2020-2025
Name of the Course Code/Name: CS3492/DBMS
Name of the Faculty: R.MAKENDRAN,AP/CSE

1. File Content (Index)

2. Vision, Mission of the Department
3. Activity Planner
4. Time- Table
5. Student Name List with Register No.
6. Syllabus Copy
7. Course Objectives, Course Outcomes(CO), CO-PO Mapping & CO-PSO Mapping
8. Course Plan
9. Lesson Plan
10. Content Beyond Syllabus
11. Assignment, Student Seminar Topics & Self Study Topics
12. Question Papers
a. Question Bank(Unit Wise)
b. University Question Papers(Previous & Current)
c. Internal Tests & Model Exam Question Papers
d. Internal Assessment/ Objective type Question Papers(if any)
13. Student Academic Performance
a. Internal Test Mark List with Result Analysis,
b. Model Exam Mark List with Result Analysis
c. Any other Assessment Marks (Seminar, Add on course, Project, activities etc)
14. Remedial Class
a. Remedial Class Schedule (Time Table)
b. Remedial Class Student Attendance
c. Remedial Test/Assignment/Activity-QP & Marks
15. Consolidated Mark List
16. Course Attainment
17. Sample Answer Sheets
a. Internal Test, Model Exam Answer Sheets
b. Assessment Test Answer Sheets
c. Remedial Test Answer Sheets
18. Lecture Notes/ Hand Outs/ Net Down/OHP/PPT(Hard/Soft Copy)(Sample )
19. Log Book
 - DHIRAJLAL GANDHI COLLEGE OF

Course File
TECHNOLOGY, SALEM

Document
Document ID: 2022-23/ DGCT/CSE 2. Vision & Mission
Name:

Vision of the Department

To cultivate creative, globally competent, employable and disciplined computing professionals

with the spirit of benchmarking educational system that promotes academic excellence,
scientific pursuits, entrepreneurship and professionalism

Mission of the Department

 To develop the creators of tomorrow’s technology to meet the social needs of our nation.
 To promote and encourage the strength of research in engineering, science and
technology.
 To channel the gap between academia, industry and society.

FACULTY IN-CHARGE HOD

- DHIRAJLAL GANDHI COLLEGE OF

TECHNOLOGY, SALEM
Course File

Document
Document ID: 2021-22/ DGCT/AI&DS 3. Activity Planner
Name:

FACULTY IN-CHARGE HOD

 - DHIRAJLAL GANDHI COLLEGE OF
Course File
TECHNOLOGY, SALEM
Document
Document ID: 2021-22/ DGCT/CSE 4. Time-table
Name:

REVISION : 0 30.01.23

Day I II III IV V VI VII VII

9.00 - 9.50-10.40 10.45-11.45 11.45- 1.25-2.15 2.15-3.00 3.15-4.00 4.00-4.45
9.50 12.35

Lunch break
Mon
Tue DBMS
Wed
Thu DBMS DBMS
Fri DBMS
Sat DBMS DBMS

Day I II III IV V VI VII VII

9.00 - 9.50-10.40 10.45-11.45 11.45- 1.25-2.15 2.15-3.00 3.15-4.00 4.00-4.45
9.50 12.35
Mon
Tue
Lunch break

Wed
Thu DBMS DBMS
Fri DBMS
Sat DBMS DBMS

Day I II III IV V VI VII VII

9.00 - 9.50-10.40 10.45-11.45 11.45- 1.25-2.15 2.15-3.00 3.15-4.00 4.00-4.45
9.50 12.35
Lunch break

Mon
Tue DBMS
Wed
Thu DBMS DBMS
 FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF

Course File
TECHNOLOGY, SALEM
Document 5. Student Name List
Document ID: 2022-23/ DGCT/CSE
Name:

S.No Register Number Student Name

1. 610521104001 Aarthi S
2. 610521104002 Abishek M
3. 610521104003 Abu Bakker Siddik M
4. 610521104004 Agilan S
5. 610521104005 Ajay Roshan A
6. 610521104006 Almas R
7. 610521104007 Aravinth K
8. 610521104008 Archana S
9. 610521104009 Baala Suriyaa T R S
10. 610521104010 Balambigai S
11. 610521104011 Bavatharani M
12. 610521104012 Bettina Livia S
13. 610521104013 Bimal Surjith S A
14. 610521104014 Devi Balambigai V
15. 610521104015 Devika G
16. 610521104016 Dhanush M
17. 610521104017 Dhanushkumar R
18. 610521104018 Dhanushya M
19. 610521104020 Dhinesh V
20. 610521104021 Dinesh Vikas A
21. 610521104022 Durga R
22. 610521104023 Gokul K
23. 610521104024 Gokul R
24. 610521104025 Gokul S
25. 610521104026 Govarthini M
26. 610521104027 GowriKumar S
27. 610521104028 Gowtham C
28. 610521104029 Gowtham K
29. 610521104030 Gowtham R
30. 610521104031 Gunaseelan R
31. 610521104032 Hari Bala K
32. 610521104033 Illayabharathi K S
33. 610521104034 Jagathkishore
34. 610521104035 Jana U
35. 610521104036 Jeevanantham A
36. 610521104037 Kamalesh E
37. 610521104038 Kanimozhi B
38. 610521104040 Kavibharathi P
39. 610521104042 Keerthana V
40. 610521104043 Kiruthika B
41. 610521104044 Kowsalya N
42. 610521104045 Krishnapriya D
43. 610521104046 Lakshmi Kannan V
44. 610521104047 Logeshwari R
45. 610521104048 Madhan Babu N
46. 610521104049 Mano Karthick M
47. 610521104050 Megala B
48. 610521104051 Menaga M
49. 610521104052 Mohamed Roshan Ashraf S
50. 610521104053 Mohammed Javith S
51. 610521104054 Mohanapriya B
52. 610521104055 Monika S
53. 610521104056 Murugan M
54. 610521104057 Nandhini E
55. 610521104058 Nanjundeswari M
56. 610521104059 Nandhini V
57. 610521104060 Naveena S
58. 610521104061 Naveenkumar K
59. 610521104063 Nithyasree S V
60. 610521104064 Obli Raju
61. 610521104065 Panneer Selvam S
62. 610521104066 Pasumathi M
63. 610521104067 Pradeep C
64. 610521104068 Pradeepa S S
65. 610521104070 Prakash T
66. 610521104071 Praveenkumar
67. 610521104072 Preethi M P
68. 610521104073 Preethi Aiswarya S
69. 610521104074 Priyanka S
70. 610521104075 Rajnishkumar
71. 610521104076 Rithika B
72. 610521104077 Ruthselina E
73. 610521104078 Sadik Basha S
74. 610521104079 Sanjay Kumar M
75. 610521104080 Saranraj A
 76. 610521104081 Sasitharan M
77. 610521104082 Sathesh P C
78. 610521104083 Sathiya Priya R
79. 610521104084 Sreehari P
80. 610521104085 Suriyanand G
81. 610521104086 Surya P
82. 610521104087 Swathi P
83. 610521104088 Swathi S
84. 610521104089 Swathi Sri S
85. 610521104090 Thamaraiselvan V
86. 610521104091 Thirupraveen S
87. 610521104092 Trisha S
88. 610521104093 Velavan S
89. 610521104094 Venkatesh R
90. 610521104095 Venuaravinth M
91. 610521104096 Vignesh C
92. 610521104097 Vijayashree G
93. 610521104098 Vishnu Shree S
94. 610521104099 Vishruta S P
95. 610521104100 Yasika S
96. 610521104101 Yokesh V S
97. 610521104102 Yuvaraj M
98. 610521104301 Gokul B
99. 610521104302 Gowtham G
100. 610521104304 Kaviya K
101. 610521104305 Kishore M S
102. 610521104306 Rahul Ganesh B
103. 610521104307 Sambath K
104. 610521104308 Suwaytha R
105. 610521104309 Vallarasu J
106. 610521104310 Yathava Kannan M

FACULTY IN-CHARGE HOD

 DHIRAJLAL GANDHI COLLEGE OF
TECHNOLOGY, SALEM Course File
Document
Document ID: 2022-23/ DGCT/CSE 6. Syllabus Copy
Name:

CS3492-Database Management Systems - 2021 Regulation Anna University

COURSE OBJECTIVES:

• To learn the fundamentals of data models, relational algebra and SQL

• To represent a database system using ER diagrams and to learn normalization techniques
• To understand the fundamental concepts of transaction, concurrency and recovery processing
• To understand the internal storage structures using different file and indexing techniques which
will help in physical DB design
• To have an introductory knowledge about the Distributed databases, NOSQL and database
security

UNIT I RELATIONAL DATABASES 10

Purpose of Database System – Views of data – Data Models – Database System Architecture –
Introduction to relational databases – Relational Model – Keys – Relational Algebra – SQL
fundamentals – Advanced SQL features – Embedded SQL– Dynamic SQL

UNIT II DATABASE DESIGN 8

Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping –

Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms,
Dependency Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth
Normal Form – Join Dependencies and Fifth Normal Form

UNIT III TRANSACTIONS 9

Transaction Concepts – ACID Properties – Schedules – Serializability – Transaction support in SQL –

Need for Concurrency – Concurrency control –Two Phase Locking- Timestamp – Multiversion –
Validation and Snapshot isolation– Multiple Granularity locking – Deadlock Handling – Recovery
Concepts – Recovery based on deferred and immediate update – Shadow paging – ARIES
Algorithm

UNIT IV IMPLEMENTATION TECHNIQUES 9

RAID – File Organization – Organization of Records in Files – Data dictionary Storage – Column
Oriented Storage– Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index
Files – Static Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for Selection,
Sorting and join operations – Query optimization using Heuristics - Cost Estimation.

UNIT V ADVANCED TOPICS 9

Distributed Databases: Architecture, Data Storage, Transaction Processing, Query processing and
optimization – NOSQL Databases: Introduction – CAP Theorem – Document Based systems – Key
value Stores – Column Based Systems – Graph Databases. Database Security: Security issues –
Access control based on privileges – Role Based access control – SQL Injection – Statistical
Database security – Flow control – Encryption and Public Key infrastructures – Challenges

COURSE OUTCOMES: Upon completion of this course, the students will be able to
CO1:Construct SQL Queries using relational algebra
CO2:Design database using ER model and normalize the database
CO3: Construct queries to handle transaction processing and maintain consistency of the
database
CO4: Compare and contrast various indexing strategies and apply the knowledge to tune the
performance of the database
CO5: Appraise how advanced databases differ from Relational Databases and find a suitable
database for the given requirement.

TOTAL:45 PERIODS

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Seventh
Edition, McGraw Hill, 2020.
2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Seventh Edition,
Pearson Education, 2017

REFERENCES:
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition,
Pearson Education, 2006.

FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF

TECHNOLOGY, SALEM Course File
 7. Course Objectives,
Document Course Outcomes (CO),
Document ID: 2021-23/ DGCT/CSE
Name: CO-PO Mapping & CO-
PSO Mapping

CS 3492 DATABASE MANAGEMENT SYSTEMSCOURSE

OBJECTIVES

To learn the fundamentals of data models and to represent a database system using ER diagrams.

To study SQL and relational database design.

To understand the internal storage structures using different file and indexing techniques which will
help in physical DB design.

To understand the fundamental concepts of transaction processing- concurrency control techniques
and recovery procedures.

To have an introductory knowledge about the Storage and Query processing Techniques

CO. No/
Course Objective statement
C301
CO.1 Construct SQL Queries using relational algebra
CO.2 Design database using ER model and normalize the database

CO.3 Construct queries to handle transaction processing and maintain

consistency of the database

CO.4 Compare and contrast various indexing strategies and apply the
knowledge to tune the performance of the database
CO.5 Appraise how advanced databases differ from Relational Databases
and find a suitable database for the given requirement.

CO-PO-PSO Mapping

CO PO PSO

PO PO PO PO PO PO PO PO PO P P P PSO PSO PSO

1 2 3 4 5 6 7 8 9 O O O 1 2 3

10 11 12

CO 3 2 - - - - - - - - - - 2 - -
 1

CO - - 3 3 - - - - - - - - 3 - -
2

CO - - - 3 2 - - - - - - - - 2 -
3

CO - - - - 3 - - - - - - - - - 2
4

Correlation Levels:

3-strong/ High/substantial 2-medium/moderate 1-low “-“– No Correlation.

Justification for CO-PO Mapping

Mapping Low/Medium/ Justification

High

CO1-PO1 High Apply Electronics engineering concepts to solve engineering

Problems.

CO1-PO2 Medium Identify the mathematical, engineering and other relevant

knowledge that applies to a given problem

CO1-PSO1 Medium To analyze, design and develop computing solutions by applying

foundational concepts of Computer Science and Engineering

CO2-PO3 High Refine a conceptual design into a detailed design within the

existing constraints (of the resources)

CO2-PO4 High Represent data (in tabular and/or graphical forms) so as to

facilitate analysis and explanation of the data, and drawing of

conclusions

CO2-PSO1 High To analyze, design and develop computing solutions by applying

foundational concepts of Computer Science and Engineering
CO3-PO4 High Design and develop experimental approach, specify appropriate

equipment and procedures

CO3-PO5 Medium Create/adapt/modify/extend tools and techniques to solve

engineering problems

CO3-PSO2 Medium To apply software engineering principles and practices for developing
quality software for scientific and business applications.

CO4-PO5 High Identify modern engineering tools such as computer aided

drafting, modeling and analysis; techniques and resources for

engineering activities

CO4-PSO3 Medium To adapt to emerging Information and Communication Technologies

(ICT) to innovate ideas and solutions to existing/novel problems.

FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF

TECHNOLOGY, SALEM Course File
Document 8. Course Plan
Document ID: 2021-22/DGCT /AI&DS
Name:
 Course Plan

Name of the Programme: B.E (CSE)

Academic Year/ Sem: 2022-2023/IV
Batch of the student: 2021-2025
Name of the Course Code/Name: CS3492 /DBMS
Name of the Faculty: Mr.R.MAKENDRAN
Total No. of Periods Allotted for the 45
Course:

Unit No. Title of the Unit No. of Periods No. of periods

Allotted Taken
1 RELATIONAL DATABASES 9 9
2 DATABASE DESIGN 9 10
3 TRANSACTIONS 9 10
4 IMPLEMENTATION TECHNIQUES 9 10
5 ADVANCED TOPICS 9 10
Time Allotted for Tests & Feedback 5 5
Time Allotted for Revision 5 5

FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF Course File

TECHNOLOGY, SALEM
Document 9. Lesson Plan
Document ID: 2021-22/ DGCT/AI&DS
Name:
 Lesson Plan

Name of the Programme: B.E (CSE)

Academic Year/ Sem: 2022-2023/IV
Batch of the student: 2021-2025
Name of the Course Code/Name: CS3492 /DBMS
Name of the Faculty: Mr.R.MAKENDRAN

Unit No. and Title: 1.

S.No Topic to be covered Plann Planned Relevant Teachin Reference Blooms Date of
ed Date CO’s No g Aids Materials Level Completi
Hour on
1. CO1
CO1
2.

CO1
3.

CO1
4.
CO1
5.
CO1
6.
CO1
7.

8. CO1
CO1
9.
CO1
10

Unit No. and Title:2

1.
CO2
2. CO2

3. CO2

4. CO2
5. CO2

6. CO2

7. CO2

8. CO2

10

1. CO3

2. CO3

3. CO3
4. CO3
5. CO3
6. CO3
7. CO3
8. CO3

9. CO3

10. CO3

1. 1

2. 2

3. 1

4. 1

5. 1
 6. 1

7. 1

8.

9.

10

1. 1

2. 1

3. 1

4. 2

5. 1

6. 1

7. 1

8. 1

9.

10

FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF Course File

TECHNOLOGY, SALEM
 Document 10. Content Beyond
Document ID: 2022-23/ DGCT/CSE
Name: Syllabus

Content Beyond Syllabus

Action Taken by Relevant POs &

S.No. Gap Date Topics
Taken PSOs

Multimedia Database PO – 2,3

1 I GL
PSO- 1,2
Content Beyond syllabus

1.Multimedia Database
Multimedia database is the collection of interrelated multimedia data that includes text,
graphics (sketches, drawings), images, animations, video, audio etc and have vast amounts of
multisource multimedia data. The framework that manages different types of multimedia data
which can be stored, delivered and utilized in different ways is known as multimedia database
management system. There are three classes of the multimedia database which includes static
media, dynamic media and dimensional media.

Content of Multimedia Database management system :

1. Media data – The actual data representing an object.

2. Media format data – Information such as sampling rate, resolution, encoding scheme etc.
about the format of the media data after it goes through the acquisition, processing and
encoding phase.
3. Media keyword data – Keywords description relating to the generation of data. It is also
known as content descriptive data. Example: date, time and place of recording.
4. Media feature data – Content dependent data such as the distribution of colors, kinds of
texture and different shapes present in data.
Types of multimedia applications based on data management characteristic are :

1. Repository applications – A Large amount of multimedia data as well as meta-data(Media

format date, Media keyword data, Media feature data) that is stored for retrieval purpose,
e.g., Repository of satellite images, engineering drawings, radiology scanned pictures.
2. Presentation applications – They involve delivery of multimedia data subject to temporal
constraint. Optimal viewing or listening requires DBMS to deliver data at certain rate offering
the quality of service above a certain threshold. Here data is processed as it is delivered.
Example: Annotating of video and audio data, real-time editing analysis.
3. Collaborative work using multimedia information – It involves executing a complex
task by merging drawings, changing notifications. Example: Intelligent healthcare network.
There are still many challenges to multimedia databases, some of which are :

1. Modelling – Working in this area can improve database versus information retrieval
techniques thus, documents constitute a specialized area and deserve special consideration.
2. Design – The conceptual, logical and physical design of multimedia databases has not yet
been addressed fully as performance and tuning issues at each level are far more complex
as they consist of a variety of formats like JPEG, GIF, PNG, MPEG which is not easy to convert
from one form to another.
3. Storage – Storage of multimedia database on any standard disk presents the problem of
representation, compression, mapping to device hierarchies, archiving and buffering during
 input-output operation. In DBMS, a ”BLOB”(Binary Large Object) facility allows untyped
bitmaps to be stored and retrieved.
4. Performance – For an application involving video playback or audio-video synchronization,
physical limitations dominate. The use of parallel processing may alleviate some problems
but such techniques are not yet fully developed. Apart from this multimedia database
consume a lot of processing time as well as bandwidth.
5. Queries and retrieval –For multimedia data like images, video, audio accessing data
through query opens up many issues like efficient query formulation, query execution and
optimization which need to be worked upon.
Areas where multimedia database is applied are :

 Documents and record management : Industries and businesses that keep detailed
records and variety of documents. Example: Insurance claim record.
 Knowledge dissemination : Multimedia database is a very effective tool for knowledge
dissemination in terms of providing several resources. Example: Electronic books.
 Education and training : Computer-aided learning materials can be designed using
multimedia sources which are nowadays very popular sources of learning. Example: Digital
libraries.
 Marketing, advertising, retailing, entertainment and travel. Example: a virtual tour of cities.
 Real-time control and monitoring : Coupled with active database technology,
multimedia presentation of information can be very effective means for monitoring and
controlling complex tasks Example: Manufacturing operation control.

2.MongoDB

MongoDB, the most popular NoSQL database, is an open-source document-oriented database.

The term ‘NoSQL’ means ‘non-relational’. It means that MongoDB isn’t based on the table-like
relational database structure but provides an altogether different mechanism for storage and
retrieval of data. This format of storage is called BSON ( similar to JSON format).

A simple MongoDB document Structure:

title: 'Geeksforgeeks',

by: 'Harshit Gupta',

url: 'https://www.geeksforgeeks.org',

type: 'NoSQL'

SQL databases store data in tabular format. This data is stored in a predefined data model
which is not very much flexible for today’s real-world highly growing applications. Modern
applications are more networked, social and interactive than ever. Applications are
storing more and more data and are accessing it at higher rates.

Relational Database Management System(RDBMS) is not the correct choice when it comes
to handling big data by the virtue of their design since they are not horizontally
scalable. If the database runs on a single server, then it will reach a scaling limit. NoSQL
databases are more scalable and provide superior performance. MongoDB is such a NoSQL
database that scales by adding more and more servers and increases productivity with its
flexible document model.

RDBMS vs MongoDB:
 RDBMS has a typical schema design that shows number of tables and the relationship
between these tables whereas MongoDB is document-oriented. There is no concept of
schema or relationship.
 Complex transactions are not supported in MongoDB because complex join operations are
not available.
 MongoDB allows a highly flexible and scalable document structure. For example, one data
document of a collection in MongoDB can have two fields whereas the other document in the
same collection can have four.
 MongoDB is faster as compared to RDBMS due to efficient indexing and storage techniques.
 There are a few terms which are related in both the databases. What’s called Table in
RDBMS is called a Collection in MongoDB. Similarly, a Tuple is called a Document and A
Column is called a Field. MongoDB provides a default ‘_id’ (if not provided explicitly) which is
a 12 byte hexadecimal number which assures the uniqueness of every document. It is
similar to the Primary key in RDBMS.
Features of MongoDB:

 Document Oriented: MongoDB stores the main subject in the minimal number of
documents and not by breaking it up into multiple relational structures like RDBMS. For
example, it stores all the information of a computer in a single document called Computer
and not in distinct relational structures like CPU, RAM, Hard disk, etc.
 Indexing: Without indexing, a database would have to scan every document of a collection
to select those that match the query which would be inefficient. So, for efficient searching
Indexing is a must and MongoDB uses it to process huge volumes of data in very less time.
 Scalability: MongoDB scales horizontally using sharding (partitioning data across various
servers). Data is partitioned into data chunks using the shard key, and these data chunks
are evenly distributed across shards that resides across many physical servers. Also, new
machines can be added to a running database.
 Replication and High Availability: MongoDB increases the data availability with multiple
copies of data on different servers. By providing redundancy, it protects the database from
hardware failures. If one server goes down, the data can be retrieved easily from other
active servers which also had the data stored on them.

FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF Course File

TECHNOLOGY, SALEM
11. Assignment, Student
Document
Document ID: 2021-22/ DGCT/CSE Seminar Topics & Self
Name:
Study topic
DHIRAJLAL GANDHI COLLEGE OF TECHNOLOGY,Salem636309
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
INTERNAL ASSESSMENT

SUBJECT CODE & NAME: CS3492 & DATABASE MANAGEMENT SYSTEM

FACULY NAME:MR.R.MAKENDRAN AP/CSE YEAR/SEM/DEPT:II/IV/CSE A
ACADEMIC YEAR:2023-20242024(EVEN SEM)
 Assignment
Submission
S. Bloom's Given Date
Topic CO Date
No Taxonomy (Tentative)
(Tentative)
Database Schema diagram for our
1 university organization L6 1 11.03.2024 15.03.2023

Given a relation R( A, B, C, D) and

Functional Dependency set FD =
2 { AB → CD, B → C }, determine L5 2 29.03.2024
whether the given R is in 2NF? If not
convert it into 2 NF. 25.03.24

Briefly explain about MongoDB Cloud

L5 4 16.04.24
3. Manager with an own example.
02.04.24
Case Study
Submission
S. Bloom's Given Date
Topic CO Date
No Taxonomy (Tentative)
(Tentative)
Implementation of Online Retail
Application Database

1 Example: L4 4

- EMart Grocery Shop

8.04.2024 30.04.2024

Implementation of Electricity Bill

2 Management System
L5 5

Experiential Learning
Submission
S. Bloom's Given Date
Topic CO Date
No Taxonomy (Tentative)
(Tentative)

Query the database tables using

1 L3 3
different ‘where’ clause and also
implement aggregate functions
Create a database table, add
constraints (primary key, unique,
2 check, Not null), insert rows, update L4 2
20.03.2024 30.04.2024
and delete rows using SQL DDL and
DML commands
For the relations Emp(name, fname,
address, dno) Dept(deptno, dname,
3 L1 4
address) And the query P fname,
ename, address (s dname= ‘Research’
 AND d,deptno=e. dno(EMP_Dept)) (i)
Draw the initial query tree.
(ii) Optimize the query write(X)
operation and X resides on the 1
pageQuery the database tables using
different ‘where’ clause and also
implement aggregate functions

4 B, B+ tree index file hashing L4 3

techniques
4
Create Document, column and graph
5 L5
based data using NOSQL database
tools .

Course Coordinator Module Programme Coordinator/

Coordinator HOD

Seminar Topics

Taken by
S.No. Unit No. Topics Date
(Name of the Student)

Self Study Topics

S.No. Unit No. Topics References

 TB1
TB1

FACULTY IN-CHARGE HOD

DHIRAJLAL GANDHI COLLEGE OF Course File

TECHNOLOGY, SALEM
Document 12.a. Question Bank
Document ID: 2022-23/ DGCT/CSE
Name:

CS8492 - DATABASE MANAGEMENT

SYSTEMS

UNIT: 1

1. Who is a DBA? What are the responsibilities of a DBA? April/May-2011

A database administrator (short form DBA) is a person responsible for the design,
implementation, maintenance and repair of an organization's database. They are also known by
the titles Database Coordinator or Database Programmer, and is closely related to the Database
Analyst, Database Modeller, Programmer Analyst, and Systems Manager.
The role includes the development and design of database strategies, monitoring and improving
database performance and capacity, and planning for future expansion requirements. They may
also plan, co-ordinate and implement security measures to safeguard the database

2. What is a data model? List the types of data model used. April/May-2011
A database model is the theoretical foundation of a database and fundamentally determines in
which manner data can be stored, organized, and manipulated in a database system. It thereby
defines the infrastructure offered by a particular database system. The most popular example of a
database model is the relational model.
Types of data model used
 Hierarchical model
 Network model
 Relational model
 Entity-relationship
 Object-relational model
 Object model

3. Define database management system?

Database management system (DBMS) is a collection of interrelated data and a set of programs
to access those data.

4. List any eight applications of DBMS.

a) Banking
b) Airlines
c) Universities
d) Credit card transactions
e) Tele communication
f) Finance
g) Sales
h) Manufacturing
i) Human resources

5. What are the disadvantages of file processing system?

The disadvantages of file processing systems are
a) Data redundancy and inconsistency
b) Difficulty in accessing data
c) Data isolation
d) Integrity problems
e) Atomicity problems
f) Concurrent access anomalies

6. What are the advantages of using a DBMS?

The advantages of using a DBMS are
a) Controlling redundancy
b) Restricting unauthorized access
c) Providing multiple user interfaces
d) Enforcing integrity constraints.
e) Providing backup and recovery

7. Give the levels of data abstraction?

a) Physical level
b) Logical level
c) View level

8. Define instance and schema?

Instance: Collection of data stored in the data base at a particular moment is called an Instance
of the database.
Schema: The overall design of the data base is called the data base schema.

9. Define the terms

1) Physical schema
2) logical schema.
Physical schema: The physical schema describes the database design at the physical level,
which is the lowest level of abstraction describing how the data are actually stored.
Logical schema: The logical schema describes the database design at the logical level, which
describes what data are stored in the database and what relationship exists among the data.
10. Mention the actors on scene.
 Database administrator
 Database designer
 End users

11. What is conceptual schema?

The schemas at the view level are called subschema‟s that describe different views of the
database.

12. Define data model?

A data model is a collection of conceptual tools for describing data, data relationships, data
semantics and consistency constraints.

13. What is storage manager?

A storage manager is a program module that provides the interface between the low level data
stored in a database and the application programs and queries submitted to the system.

14. What are the components of storage manager?

The storage manager components include
a) Authorization and integrity manager
b) Transaction manager
c) File manager
d) Buffer manager

15. What is the purpose of storage manager?

The storage manager is responsible for the following
a) Interaction with the file manager
b) Translation of DML commands in to low level file system commands
c) Storing, retrieving and updating data in the database

16. List the data structures implemented by the storage manager .

The storage manager implements the following data structure
a) Data files
b) Data dictionary
 c) Indices

17. What is a data dictionary?

A data dictionary is a data structure which stores meta data about the structure of the database ie.
the schema of the database.

18. What is an entity relationship model?

The entity relationship model is a collection of basic objects called entities and relationship
among those objects. An entity is a thing or object in the real world that is distinguishable from
other objects.

19. What are attributes? Give examples.

An entity is represented by a set of attributes. Attributes are descriptive properties possessed by
each member of an entity set.
Example: possible attributes of customer entity are customer name, customer id, Customer
Street, customer city.

20. What is relationship? Give examples

A relationship is an association among several entities.
Example: A depositor relationship associates a customer with each account that he/she has.

21. Define the terms i) Entity set ii) Relationship set

Entity set: The set of all entities of the same type is termed as an entity set.

Relationship set : The set of all relationships of the same type is termed as a relationship set.

22. Define single valued and multivalued attributes.

Single valued attributes: attributes with a single value for a particular entity are called single
valued attributes.

Multivalued attributes : Attributes with a set of value for a particular entity are called
multivalued attributes.

23. What are stored and derived attributes?

Stored attributes: The attributes stored in a data base are called stored attributes.
Derived attributes: The attributes that are derived from the stored attributes are called derived
attributes.

24. What are composite attributes?

Composite attributes can be divided in to sub parts.

25. Define null values

In some cases a particular entity may not have an applicable value for an attribute or if we do not
know the value of an attribute for a particular entity. In these cases null value is used.
26. Define the terms i) Entity type ii) Entity set
Entity type: An entity type defines a collection of entities that have the same attributes.
Entity set: The set of all entities of the same type is termed as an entity set.
27. What is meant by the degree of relationship set?
The degree of relationship type is the number of participating entity types.

28. Define the terms

i) Key attribute
ii) Value set
Key attribute : An entity type usually has an attribute whose values are distinct from each
individual entity in the collection. Such an attribute is called a key attribute.
Value set: Each simple attribute of an entity type is associated with a value set that specifies the
set of values that may be assigned to that attribute for each individual entity.

29. Define weak and strong entity sets?

Weak entity set: entity set that do not have key attribute of their own are called weak entity sets.
Strong entity set: Entity set that has a primary key is termed a strong entity set.

30. What does the cardinality ratio specify?

Mapping cardinalities or cardinality ratios express the number of entities to which another entity
can be associated. Mapping cardinalities must be one of the
following:
• One to one
• One to many
• Many to one
• Many to many

31. Explain the two types of participation constraint.

• Total: The participation of an entity set E in a relationship set R is said to be total if every
entity in E participates in at least one relationship in R.
• Partial: if only some entities in E participate in relationships in R, the participation of entity set
E in relationship R is said to be partial.

32. What is meant by lossless-join decomposition? APRIL/MAY-2011

We claim the above decomposition is lossless. How can we decide whether decomposition is
lossless?
1. Let R be a relation schema.
2. Let F be a set of functional dependencies on R.
3. Let R1and R2 form a decomposition of R.
4. The decomposition is a lossless-join decomposition of R if at least one of the following
functional dependencies are in :
a. R1∩ R2→ R1
b. R1∩ R2→ R2

33. List the disadvantages of relational database system

Repetition of data
Inability to represent certain information.

34. What is first normal form?

The domain of attribute must include only atomic (simple, indivisible) values.
35. What is meant by functional dependencies?
Consider a relation schema R and a C R and ß C R. The functional dependency a ß holds on
relational schema R if in any legal relation r(R), for all pairs of tuples t1 and t2 in r such that
t1 [a] =t1 [a], and also t1 [ß] =t2 [ß].

36. What are the uses of functional dependencies?

To test relations to see whether they are legal under a given set of functional dependencies.
To specify constraints on the set of legal relations.

37. Explain trivial dependency?

Functional dependency of the form a ß is trivial if ß C a. Trivial functional dependencies are
satisfied by all the relations.

38. What are axioms?

Axioms or rules of inference provide a simpler technique for reasoning about functional
dependencies.

39. What is meant by computing the closure of a set of functional

dependency?
+ The closure of F denoted b y F is the set of functional dependencies logically implied by F.

40. What is meant by normalization of data?

It is a process of analyzing the given relation schemas based on their Functional Dependencies
(FDs) and primary key to achieve the properties
 Minimizing redundancy
 Minimizing insertion, deletion and updating anomalies

UNIT:2

1. Define the terms i) DDL ii) DML

DDL: Data base schema is specified by a set of definitions expressed by a special language
called a data definition language.

DML:
A data manipulation language is a language that enables users to access or manipulate data as
organized by the appropriate data model
2. What is embedded SQL? What are its advantages? April/May-2011
Embedded SQL is a method of combining the computing power of a programming language and
the database manipulation capabilities of SQL. Embedded SQL statements are SQL statements
written in line with the program source code of the host language. The embedded SQL
statements are parsed by an embedded SQL preprocessor and replaced by host-language calls to a
code library. The output from the preprocessor is then compiled by the host compiler. This
allows programmers to embed SQL statements in programs written in any number of languages
such as: C/C++, COBOL and Fortran

3. Write short notes on relational model

 The relational model uses a collection of tables to represent both data and the relationships
among those data. The relational model is an example of a record based model.

4. Define tuple and attribute

• Attributes: column headers
• Tuple : Row

5. Define the term relation.

Relation is a subset of a Cartesian product of list domains.

6. Define tuple variable

Tuple variable is a variable whose domain is the set of all tuples.

7. Define the term Domain.

For each attribute there is a set of permitted values called the domain of that
attribute.

8. What is a candidate key?

Minimal super keys are called candidate keys.
9. What is a primary key?
Primary key is chosen by the database designer as the principal means of identifying an entity in
the entity set.
10. What is a super key?
A super key is a set of one or more attributes that collectively allows us to identify uniquely an
entity in the entity set.
11. List the table modification commands in SQL?
 Deletion
 Insertion
 Updates
 Update of a view

UNIT:3

1. What are the ACID properties? APRIL/MAY-2011

(atomicity, consistency, isolation, durability) is a set of properties that guarantee database
transactions are processed reliably. In the context of databases, a single logical operation on the
data is called a transaction. For example, a transfer of funds from one bank account to another,
even though that might involve multiple changes (such as debiting one account and crediting
another), is a single transaction.

2. What are two pitfalls (problem) of lock-based protocols? APRIL/MAY-2011

 Deadlock
 Starvation

3. What is transaction?
Collections of operations that form a single logical unit of work are called transactions.
4. What are the two statements regarding transaction?
The two statements regarding transaction of the form:
 Begin transaction
 End transaction

5. What are the properties of transaction?

The properties o f transactions are:
 Atomicity
 Consistency
 Isolation
 Durability

6. What is recovery management component?

Ensuring durability is the responsibility of a software component of the base system called the
recovery management component.

7. When is a transaction rolled back?

Any changes that the aborted transaction made to the database must be undone. Once the
changes caused by an aborted transaction have been undone, then the transaction has been rolled
back.

8. What are the states of transaction?

The states of transaction are
 Active
 Partially committed
 Failed
 Aborted
 Committed
 Terminated

9. List out the statements associated with a database transaction?
 Commit work
 Rollback work

10. What is a shadow copy scheme?

It is simple, but efficient, scheme called the shadow copy schemes. It is based on making copies
of the database called shadow copies that one transaction is active at a time. The scheme also
assumes that the database is simply a file on disk.

11. Give the reasons for allowing concurrency?

The reasons for allowing concurrency is if the transactions run serially, a short transaction may
have to wait for a preceding long transaction to complete, which can lead to unpredictable delays
in running a transaction. So concurrent execution reduces the unpredictable delays in running
transactions.

12. What is average response time?

The average response time is that the average time for a transaction to be completed after it has
been submitted.
13. What are the two types of serializability?
The two types of serializability is
 Conflict serializability
 View serializability

14. Define lock?

Lock is the most common used to implement the requirement is to allow a transaction to access a
data item only if it is currently holding a lock on that item.

15. What are the different modes of lock?

The modes of lock are:
 Shared

 Exclusive
16. Define deadlock?
Neither of the transaction can ever proceed with its normal execution. This situation is called
deadlock.

17. Define the phases of two phase locking protocol

Growing phase: a transaction may obtain locks but not release any lock.
Shrinking phase: a transaction may release locks but may not obtain any new locks.

18. Define upgrade and downgrade?

It provides a mechanism for conversion from shared lock to exclusive lock is known as upgrade.
It provides a mechanism for conversion from exclusive lock to shared lock is known as
downgrade.

19. What is a database graph?

The partial ordering implies that the set D may now be viewed as a directed acyclic graph, called
a database graph.

20. What are the two methods for dealing deadlock problem?
The two methods for dealing deadlock problem is deadlock detection and deadlock recovery.

21. What is a recovery scheme?

An integral part of a database system is a recovery scheme that can restore the database to the
consistent state that existed before the failure.

22. What are the two types of errors?

The two types of errors are:
 Logical error
 System error

23. What are the storage types?

The storage types are:
 Volatile storage
 Nonvolatile storage
24. Define blocks?
The database system resides permanently on nonvolatile storage, and is partitioned into fixed-
length storage units called blocks.

25. What is meant by Physical blocks?

The input and output operations are done in block units. The blocks residing on the disk are
referred to as physical blocks.

26. What is meant by buffer blocks?

The blocks residing temporarily in main memory are referred to as buffer blocks.

27. What is meant by disk buffer?

The area of memory where blocks reside temporarily is called the disk buffer.

28. What is meant by log-based recovery?

The most widely used structures for recording database modifications is the log. The log is a
sequence of log records, recording all the update activities in the database. There are several
types of log records.

29. What are uncommitted modifications?

The immediate-modification technique allows database modifications to be output to the
database while the transaction is still in the active state. Data modifications written by active
transactions are called uncommitted modifications.

30. Define shadow paging.

An alternative to log-based crash recovery technique is shadow paging. This technique needs
fewer disk accesses than do the log-based methods.

31. Define page.

The database is partitioned into some number of fixed-length blocks, which are referred to as
pages.

32. Explain current page table and shadow page table.

The key idea behind the shadow paging technique is to maintain two page tables during the life
of the transaction: the current page table and the shadow p age table. Both the page tables are
identical when the transaction starts. The current page table may b e changed when a transaction
performs a write operation.

33. What are the drawbacks of shadow-paging technique?

 Commit Overhead
 Data fragmentation
 Garbage collection

34. Define garbage collection.

Garbage may be created also as a side effect of crashes. Periodically, it is necessary to find all
the garbage pages and to add them to the list of free pages. This process is called garbage
collection.
35. Differentiate strict two phase locking protocol and rigorous two
phase locking protocol.
In strict two phase locking protocol all exclusive mode locks taken by a transaction is held
until that transaction commits.

Rigorous two phase locking protocol requires that all locks be held until the transaction
commits.

36. How the time stamps are implemented

• Use the value of the system clock as the time stamp. That is a transaction‟s time stamp is
equal to the value of the clock when the transaction enters the system.
• Use a logical counter that is incremented after a new timestamp has been assigned; that is
the time stamp is equal to the value of the counter.

37. What are the time stamps associated with each data item?
• W-timestamp (Q) denotes the largest time stamp if any transaction that executed WRITE (Q)
successfully.
• R-timestamp (Q) denotes the largest time stamp if any transaction that executed READ (Q)
successfully.

UNIT:4

1. What are the advantages and disadvantages of indexed sequential

file? APRIL/MAY- 2011
The advantage of ordering records in a sequential file according to a key is that you can then
search the file more quickly. If you know the key value that you want, you can use one of the
relatively fast searches. The disadvantage is that when you insert, you need to rewrite at least
everything after the insertion point, which makes inserts very expensive unless they are done at
the end of the file. An indexed file approach keeps a (hopefully) small part of each row, and
some kind of "pointer" to the row's location within the data file. This allows a search to use the
index, which is ordered by the index and (again hopefully) much smaller and therefore much
faster than scanning the entire data file for the indexed data.

2. What is database tuning? APRIL/MAY-2011

Database tuning describes a group of activities used to optimize and homogenize the
performance of a database. It usually overlaps with query tuning, but refers to design of the
database files, selection of the database management system (DBMS), operating system and
CPU the DBMS runs on.

3. Give the measures of quality of a disk.

Capacity
Access time
Seek time
Data transfer rate
Reliability
Rotational latency time.

4. Compare sequential access devices versus random access devices

with an example sequential access devices random access devices
Must be accessed from the beginning It is possible to read data from any location
Eg:- tape storage Eg:-disk storage
Access to data is much slower Access to data is faster

Cheaper than disk Expensive when compared with disk

5. What are the types of storage devices?

 Primary storage
 Secondary storage
 Tertiary storage

6. Define average seek time.

The average seek time is the average of the seek times, measured over a sequence of random
requests.

7. Define rotational latency time.

The time spent waiting for the sector to be accessed to appear under the head is called the
rotational latency time.

8. Define average latency time.

The average latency time of the disk is one-half the time for a full rotation of the disk.

9. What is meant by data-transfer rate?

The data-transfer rate is the rate at which data can be retrieved from or stored to the disk.

10. What is meant by mean time to failure?

The mean time to failure is the amount of time that the system could run continuously without
failure.

11. What are a block and a block number?

A block is a contiguous sequence of sectors from a single track of one platter. Each request
specifies the address on
the disk to be referenced. That address is in the form of a block number.

12. What are called journaling file systems?

File systems that support log disks are called journaling file systems.

13. What is the use of RAID?

A variety of disk-organization techniques, collectively called redundant arrays of independent
disks are used to improve the performance and reliability.

14. Explain how reliability can be improved through redundancy?

The simplest approach to introducing redundancy is to duplicate every disk. This technique is
called mirroring or shadowing. A logical disk then consists of two physical disks, and write is
carried out on both the disk. If one of the disks fails the data can be read from the other. Data
will be lost if the second disk fails before the first fail ed disk is repaired.

15. What is called mirroring?

The simplest approach to introducing redundancy is to duplicate every disk. This technique is
called mirroring or shadowing.
dimensions.

17. What is meant by Spatial database?

A spatial database is a database that is optimized to store query data that represents objects
defined in geometric space. Most spatial databases allow representing simple geometric objects
such as points, lines and polygons. Some spatial databases handle more complex structures such
as 3D objects, topological coverages,etc.

18. What is meant by Mobile database?

A mobile database is a database that resides on mobile device such as a PDA, a smart phone, or a
laptop. Such devices are often limited in resources such as memory, computing power and battery
power.

UNIT:5

1. List the threats to databases.

 Loss of integrity
 Loss of availability
 Loss of confidentiality

2. List out the control measures.

 Access control
 Inference control
 Flow control
 Data encryption

3. What is meant by Data warehouse?

A data warehouse is a repository (archive) of information gathered from multiple sources, stored
under a unified schema at a single site.
 Greatly simplifies querying, permits study of historical trends
 Shifts decision support query load away from transaction
processing systems

4. Define Data mining.

Data mining - knowledge discovery in database. Data mining is the process of semi-
automatically analyzing large databases to find useful patterns.

5. List out the operations done in data warehouse.

 Roll up
 Drill down
  Pivot

S.No Information Retrieval DBMS

1 Imprecise semantics Precise semantics
2 Keyword search SQL
3 Unstructured data format Structured data
4 Reads mostly. Adds document Expects reasonable number of updates.
occasionally.
5 Displays page through top k results. Generates full answer.

7. List out the functionalities of Data warehouse.

 Data cleaning
 Data transformation
 Data integration
 Data loading &
 Periodic data refreshing

8. List the types of security mechanisms.

 Discretionary security mechanisms
 Mandatory security mechanisms

9. What are the database design issues?

 Legal and ethical issues
 Policy issues
 System related issues

10. What are the actions performed by DBA?

 Account creation
 Privilege granting
 Privilege revocation
 Security level assignment

11. What is the difference between Database and Data warehouse?

S.No Database Data warehouse
1. Online transaction & query processing is Data analysis & decision making is done in
done in database data warehouse
2. Online Transaction Processing (OLTP) is Online Analytical Processing (OLAP) is
carried out in Database. carried out in Database
 Choose the measures that will populate each fact table record

13. What are the issues in data warehouse design?

 When and how to gather data
 What schema to use
 Data cleansing
 How to propagate updates
 What data to summarize
14. What are the goals of data mining?
 Prediction
 Identification
 Classification
 Optimization

15. List out the types of Discovered knowledge.

 Association rules
 Classification Hierarchies
 Sequential patterns
 Patterns within time series
 Clustering

16. What is meant by Association rule?

An association rule is of the form X→Y, where X={x1, x2,……. xn} and Y={y1, y2,……. yn} are
set of items with xi and yi being distinct items of all i and j. It must satisfy a minimum support
and confidence.

17. What is meant by Confidence rule?

Given a rule of the form A→B, rule confidence is the conditional probability that B is true when
A is known to be true.

18. Define Apriori algorithm.

The Apriori algorithm was the first algorithm used to generate association rules. It uses the
general algorithm for creating association rules together with downward closure and anti-
monotonicity.

19. Define Sampling algorithm.

The Sampling algorithm selects samples from the database of transactions that individually fit
into memory. Frequent itemsets are then formed for each sample. If the frequent itemsets form a
superset of frequent itemsets for the entire database, then the real frequent itemsets can be
obtained by scanning the remainder of the database.
information and allows for the efficient description of frequent itemsets. The algorithm consists
of 2 steps:
1. Build FP-tree
2. Use the tree to find frequent itemsets.

21. What is meant by Classification?

Classification is the process of learning a model that is able to describe different classes of data.

22. List the applications of data mining.

 Marketing
 Finance
 Resource optimization
 Image Analysis
 Fraud detection
 DHIRAJLAL GANDHI COLLEGE OF Course File
TECHNOLOGY, SALEM
Document 12.b. University Question
Document ID: 2020-21/ DGCT/CSE
Name: Papers ( Previous)