0% found this document useful (0 votes)
37 views2 pages

BCA 2nd Sem Database Management Exam

This document is a question paper for a Database Management Systems exam covering topics like data modeling, SQL, indexing, and normalization. It contains 3 parts with multiple choice, short answer, and long answer questions. Part A has 10 multiple choice questions worth 2 marks each. Part B has 6 short answer questions worth 5 marks each. Part C has 2 long answer questions worth 15 marks each. The paper tests students' understanding of fundamental database concepts, the relational model, SQL, indexing, and more.

Uploaded by

Hello
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views2 pages

BCA 2nd Sem Database Management Exam

This document is a question paper for a Database Management Systems exam covering topics like data modeling, SQL, indexing, and normalization. It contains 3 parts with multiple choice, short answer, and long answer questions. Part A has 10 multiple choice questions worth 2 marks each. Part B has 6 short answer questions worth 5 marks each. Part C has 2 long answer questions worth 15 marks each. The paper tests students' understanding of fundamental database concepts, the relational model, SQL, indexing, and more.

Uploaded by

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

21103127

QP CODE: 21103127   Reg No : .....................

    Name : .....................

[Link] / BCA DEGREE (CBCS) REGULAR / REAPPEARANCE EXAMINATIONS,


DECEMBER 2021
Second Semester
Core Course - CS2CRT04 - DATA BASE MANAGEMENT SYSTEMS
(Common for [Link] Computer Applications Model III Triple Main, Bachelor of Computer
Applications)
2017 ADMISSION ONWARDS
47B7FDD4

Time: 3 Hours Max. Marks : 80

Part A
Answer any ten questions.
Each question carries 2 marks.
 

1.   Who is a Data base Designer?

2.   What do you mean by procedural DML language? Give an example.

3.   What is the use of buffer manager?

4.   What is a derived attribute? Give example.

5.   Define Domains and Tuples.

6.   What is the basic SQL DDL commands?

7.   Write the syntax of select command with an example.

8.   How can we order rows in SQL?

9.   What is modification anomaly?

10.   Define BCNF.

11.   What is permanency?

12.   What are the different types of privileges?


(10×2=20)
Part B
Answer any six questions.
Each question carries 5 marks.
 

Page 1/2 Turn Over


13.   Explain different data models.

14.   Discuss different levels of abstraction in database system

15.   Discuss the concept of entity relationship model. How it helps in designing relational
databases?

16.   Explain cardinality and participation in detail.

17.   Explain UNION and INTERSECT commands with syntax and example.

18.   Explain UNIQUE and EXIST.

19.   Explain Secondary Indexing.

20.   Explain the following a) 1 NF b) 2 NF c) 3 NF

21.   Explain the types of failures?


(6×5=30)
Part C
Answer any two questions.
Each question carries 15 marks.
 

22.   Why data base system is superior than file-based System.

23.   Compare relation, relationship type, relationship set and structural constraints.

24.   (a) Explain the use of GROUP BY and HAVING clause with syntax and examples

(b) How will you create and manage views?

25.   Explain types of single-level ordered indexes.


(2×15=30)

Page 2/2

Common questions

Powered by AI

Third Normal Form (3NF) is crucial in reducing modification anomalies because it ensures that each non-primary key attribute is not only fully functionally dependent on the primary key but also free of transitive dependencies. This eliminates redundancy; each piece of information is stored in only one place in the database, thus preventing anomalies during insert, update, or delete tasks. Without 3NF, a database can suffer from issues like inconsistent updates and increased storage requirements, as changes in one place might necessitate updates in another, leading to errors and inefficiencies.

The buffer manager in a database management system is responsible for managing the transfer of data between the disk storage and main memory. Its primary purpose is to minimize costly disk input-output operations by caching frequently accessed data in memory. This improves system performance by reducing the time needed to read and write data from the database, as accessing data from memory is significantly faster than from disk. The buffer manager optimizes resource usage and enhances the overall response time of database queries and updates.

A database management system (DBMS) offers several benefits over traditional file-based systems. It provides a centralized approach to storing and managing data, enabling improved data consistency and integrity. DBMS allows concurrent access by multiple users and has robust mechanisms to prevent data corruption during simultaneous transactions. The system supports complex queries and indexing to optimize data retrieval, whereas a file-based system often requires custom programming for similar tasks. Additionally, DBMS provides better security and recovery options, protecting data from unauthorized access and system failures. These features collectively enhance operational efficiency and data reliability.

Domains and tuples form foundational aspects of a relational database's structure and functionality. Domains define the permissible set of values for a given attribute, ensuring data consistency and integrity by enforcing type constraints and validating data entries. Tuples, representing rows in a table, are unique sets of attribute values from their respective domains. Together, domains and tuples facilitate organized data storage, support data integrity through constraints and validation, and enhance database queries by maintaining a structured, predictable data environment. This structured approach underlies the power and flexibility of relational databases.

Structural constraints in a relational database define rules about how data can enter and relate within tables, ensuring data accuracy and integrity. These constraints include cardinality, which specifies the number of relationship instances in which an entity can participate, and participation constraints that dictate whether all or only some entity instances must participate in a relationship. In comparison, relationship types define the nature of associations between entities, while relationship sets are actual instances of these associations at any given time. Structural constraints ensure that relationships follow specified rules, while relationship types and sets describe and instantiate these links within the database.

The GROUP BY and HAVING clauses in SQL are used to aggregate data and filter groups of data, respectively. GROUP BY divides the dataset into groups based on one or more columns, allowing aggregation functions to be applied to each group, providing insights into data patterns. The HAVING clause, used after GROUP BY, filters these groups based on aggregate conditions. Employing these clauses can optimize queries by reducing the amount of data processed and returned, thus enhancing performance in data analysis tasks, especially on large datasets. Efficient indexing and query planning further improve the impact of these clauses on optimization.

The entity-relationship (ER) model assists in designing relational databases by providing a framework to represent real-world entities and their relationships. The main components include entities, which denote real-world objects; relationships, which describe associations between entities; and attributes, which capture specific properties of entities. This model uses diagrams to visually represent these components and their interconnections, facilitating the translation of complex business requirements into a structured database schema, thereby enhancing clarity and consistency in database design.

Normalization is the process of organizing a database to reduce data redundancy and improve data integrity. In 1NF (First Normal Form), a table's columns must contain atomic values with no repeating groups. 2NF (Second Normal Form) builds upon 1NF by ensuring that all non-key attributes are fully functionally dependent on the primary key, eliminating partial dependency. 3NF (Third Normal Form) requires that all attributes are only dependent on the primary key, removing transitive dependencies. Each step in normalization aims to streamline data structures, ensuring consistent and efficient database operations.

Procedural Data Manipulation Languages (DML) require the user to specify what data is needed and the procedure to retrieve it, whereas non-procedural DML languages only require the user to state what data is required, leaving the retrieval method to the DBMS. Examples of procedural DML include languages like PL/SQL used in Oracle, where loops and conditional logic direct the retrieval process. Non-procedural DML is typified by SQL, where commands like SELECT specify desired data without explicit procedural steps, allowing for higher-level data manipulation without detailing the retrieval process.

In a database management system, privileges are permissions granted to users to perform specific actions on database objects. Common types of privileges include SELECT, INSERT, UPDATE, and DELETE, which control data access and modification. Grant and REVOKE commands are used to assign and rescind these privileges, respectively. By defining precise user permissions, a DBMS limits unauthorized access and protects sensitive data, contributing significantly to database security. This control prevents potential data breaches and ensures that users have appropriate access levels based on their role and requirements.

You might also like