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

DMS Final Exam

The document outlines the final exam structure for the B.Tech program at Marwadi University, specifically for the DMS subject, including instructions, question types, and marks distribution. It includes multiple-choice questions, SQL queries, database concepts, and normalization topics. Additionally, it features a Bloom's Taxonomy report indicating the weightage of questions based on cognitive levels.
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)
28 views

DMS Final Exam

The document outlines the final exam structure for the B.Tech program at Marwadi University, specifically for the DMS subject, including instructions, question types, and marks distribution. It includes multiple-choice questions, SQL queries, database concepts, and normalization topics. Additionally, it features a Bloom's Taxonomy report indicating the weightage of questions based on cognitive levels.
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
You are on page 1/ 6

Enroll. No.

_________

MARWADI UNIVERSITY

Faculty of Technology
CE / IT / BIOINFO B.Tech
SEM: 3rd MU FINAL / REMEDIAL EXAM Nov:2023
__________________________________________________________________________
Subject: - DMS - 01CE2302 Date:- 13/12/2023
Total Marks:-100 Time: - 12:30 to 03:00 PM

Instructions:
1. All Questions are Compulsory.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Question: 1

(a). Answer the Following MCQs. (All Questions are Mandatory) [10]

1. What is the Full Form of DBMS?


i. Data Management System ii. Database Management System
iii. Database Management Software iv. Data Management Software
2. Which of the Following is not Integrity Constraints in DBMS?
i. Primary key ii. Alternate Key
iii. Foreign key iv. All of the Above
3. Attributes of the relationship is called_______.
i. Entity ii. Relationship
iii. Descriptive attribute iv. None of the Above
4. A candidate key is a subset of ______.
i. Primary Key ii. Foreign Key
iii. Super Key iv. All of the Above
5. Which Relational Algebra Operator is used for below Query: Find Out Name of all Students
who enroll for all subjects [ Student (Name, Subject) , Subject(Subject) ]
i. Union ii. Minus
iii. Rename iv. Division
6. _____ Functional Dependency state that, In a relation, if attribute(s) A → B and B → C, then
A → C (means C is transitively depends on A via B).
i. Full Functional Dependency ii. Partial Functional Dependency
iii. Trivial Functional Dependency iv. Transitive Functional Dependency
7. There are ___ types of anomalies that can arise in the database because of redundancy
i. 3 ii. 5
iii. 4 iv. 6
8. If two schedules produce the same result after execution, they are said to be _____ schedule.
i. equivalent ii. Non - equivalent
iii. Both iv. None
9. Which of the Following is condition of View
i. Initial Write , Updated Read, Final Write
ii. Initial Read , Updated Read, Final Write
iii. Initial Read , Updated Write, Final Write
iv. None
10. Which of the Following is not problems due to concurrency
i. Lost update problem ii. Dirty read problem
iii. Incorrect retrieval problem iv. All of the Above

MARWADI UNIVERSITY 1|
Enroll. No._________

(b). Answer the Following Questions in One Line. (All Questions are Mandatory) [10]

1. _______________ is an information repository which contains metadata.


Ans: A data dictionary
2. _____________ is data about data.
Ans: Metadata
3. Symbol of Derived Attribute in ER diagram

Ans:
4. ______ is Bottom-up approach.
Ans: Generalization
5. A primary key attribute value cannot be NULL. (True / False)
Ans: True
6. Let us consider a relation R with schema R = (A, B, C) and set of functional dependencies
FDs F = { AB → C, A → C }. In AB → C, B is ______ attribute.
Ans: extraneous
7. List Basic Types of Schedule
Ans: Serial schedule , Non-serial Schedule
8. A schedule is serializable if it is equivalent to a serial schedule (True / False)
Ans: True
9. _______ Optimization Uses predefined rules and doesn't look at actual data or costs. (Cost-
Based Optimization, Heuristic Optimization)
Ans: Heuristic Optimization
10. Full Form of DML
Ans: Data Manipulation Language

Question: 2.

(a) Write a SQL Query for the below table. [8]


EmployeeInfo (EmpID, EmpFname, EmpLname, Department, Project, Address, DOB,
Gender)
EmployeePosition( EmpID, EmpPosition, DateOfJoining, Salary)

1. Write a query to retrieve the average salary of employees.


Ans: SELECT AVG(Salary) AS AverageSalary FROM EmployeePosition;
2. Write a query to fetch the distinct departments from the EmployeeInfo table.
Ans: SELECT DISTINCT Department FROM EmployeeInfo;
3. Write a query to fetch the EmpFname from the EmployeeInfo table in upper case and
use the ALIAS name as EmpName.
Ans: SELECT UPPER(EmpFname) AS EmpName FROM EmployeeInfo;
4. Write a query to update the department of the employee with EmpID = 123 to
'Marketing'.
Ans: UPDATE EmployeeInfo SET Department = 'Marketing' WHERE EmpID =
123;
5. Write a query to fetch the number of employees working in the department „HR‟.
Ans: SELECT COUNT(*) FROM EmployeeInfo WHERE Department = 'HR';
6. Write a query to retrieve the first four characters of EmpLname from the
EmployeeInfo table.
Ans: SELECT SUBSTRING(EmpLname, 1, 4) FROM EmployeeInfo;
7. Write a query to fetch all the records from the EmployeeInfo table ordered by
EmpLname in descending order
Ans:SELECT * FROM EmployeeInfo ORDER BY EmpFname desc
8. Write a query to fetch details of all employees excluding the employees with first
names, “Sanjay” and “Sonia” from the EmployeeInfo table.
Ans: SELECT * FROM EmployeeInfo WHERE EmpFname NOT IN
('Sanjay','Sonia');

MARWADI UNIVERSITY 2|
Enroll. No._________

(b) What are the Types of Database User? Explain in Brief. [8]
Ans: 4 Types of User: 2 Marks per each with Proper Description
OR
(b) List and Explain Data Models in Database. [8]
Ans: 1 Marks Per Each with Proper Description
Record Base: Hierarchical Model, Network Model, Relational Model
Object Base: Entity Relational Model, Object Oriented Model
Physical Data Model

Question: 3.

(a) Draw E-R diagram for Bank Management System. [8]


Ans: Minimum 5 Entity: 3 Marks
Cardinality : 2 Marks
All type of Attribute: 3 Marks
(b) State and Explain Difference between Inner Join and Outer Join [4]
Ans: 1Marks for Each Point
(c) Explain Full Functional Dependency and Partial Functional Dependency [4]
Ans: 2 Marks for each with Definition and Example
OR
(a) Draw an E-R diagram for Library Management System [8]
Ans: Minimum 5 Entity: 3 Marks
Cardinality : 2 Marks
All type of Attribute: 3 Marks
(b) State and Explain any 4 Aggregate Functions. [4]
Ans: 1 Marks for each with Proper Description
(c) Explain Trivial Functional Dependency and Non-Trivial Functional Dependency [4]
Ans: 2 Marks for each with Definition and Example

Question: 4.

(a) What is meant by normalization? List and discuss various normalization forms [8]
Ans: Definition:2 Marks
Explain each Normal Forms with Rules and Example: 2 Marks per Each
(b) Explain ACID properties of transaction with suitable example [8]
Ans: 2 Marks for Each with Definition and example
OR
(a) Given functional dependencies (FDs) for relational schema R = (A,B,C,D,E): [8]
F = {A → BC, CD → E, B → D, E → A}
1. Find Closure for A
2. Find Closure for CD
3. Find Closure for B
4. Find Closure for BC
Ans: 2 Marks per each
A+ = ABCDE
CD+ = ABCDE
B+ = BD
BC+ = ABCDE
(b) Define transaction. Explain various states of transaction with suitable diagram. [8]
Ans: Definition: 1 Marks
Correct Diagram: 4 Marks
Correct Explanation for each state: 3 Marks

MARWADI UNIVERSITY 3|
Enroll. No._________

Question: 5.

(a) What is Lock-compatibility matrix? Write a note on two phase locking protocol [6]
Ans: Correct Matrix : 2 Marks
Growing Phase: 2 marks for Explanation
Shrinking Phase: 2 marks for Explanation
(b) Write a Pl/SQL program to print integers from 1 to 10 by using PL/SQL FOR loop [6]
Ans: Basic Syntax: 2 Marks
For loop: 2 Marks
Logic: 2 Marks
(c) Consider a relation R (A,B,C,D,E,F,G) with following functional dependencies: [4]
FD: {A → BC,D → F, CF → G ,BC → DE}
Find {A}+ , {AC}+
Ans: 2 Marks Per each.
A+ = { A , B , C , D , E , F , G }
{AC}+ ={A,B,C,D,E,F,G}
OR
(a) Explain two-phase commit protocol. [6]
Ans: Figure: 2 Marks
Correct Explanation for each step: 4 Marks
(b) Write a Pl/SQL program to print integers from 10 to 1 by using PL/SQL While loop [6]
Ans: Basic Syntax: 2 Marks
For loop: 2 Marks
Logic: 2 Marks
(c) Compute the closure of the following set F of functional dependencies FDs for relational [4]
schema R = (A,B,C,D,E,F):
F = (A → B, A → C, CD → E, CD → F, B → E)
Find out the closure of F.
Ans: F+ = (A → BC, CD → EF, A → E, AD → E, AD → F)

Question: 6.
(a) What are the activity performed in Query Processing? Explain in Brief with Suitable [8]
Diagram.
Ans: Diagram: 3 Marks
Description of 3 Steps: 2 Marks Per Each step
(b) How the checkpoint works when failure occurs? Explain with suitable example. [4]
Ans: Figure with Explanation : 1 Marks
Ignore the transaction, Redo transaction, Undo transaction: 1 Marks per each
(c) Write a PL/SQL block for Print The 'Hello World'. [4]
Ans:
DECLARE
message varchar2(20):= 'Hello, World!';
BEGIN
dbms_output.put_line(message);
END;
OR
(a) Explain Materialization and Pipeline Approach for Query Optimization with Example. [8]
Ans: Materialization: Description and Example - 4 Marks
Pipeline: Description and Example - 4 Marks
(b) Explain deadlock with suitable example of wait-for graph. [4]
Ans: Define: 2 Marks
Example with Examination: 2 Marks
(c) Write a PL/SQL block for calculating a+b (Consider a=10, b=20) [4]
Ans:
DECLARE
a integer := 30;
MARWADI UNIVERSITY 4|
Enroll. No._________

b integer := 40;
c integer;
BEGIN
c := a + b;
dbms_output.put_line('Value of c: ' || c);
END;

---Best of Luck---

MARWADI UNIVERSITY 5|
Enroll. No._________

– Bloom’S Taxonomy Report –

Sub: Image Processing - 01CE0507


Sem.: 5th
Branch: Computer Engineering / Information Technology

Que. Paper weightage as per Bloom’s Taxonomy


Marks of
LEVEL % of weightage Question No.
Que.

Q-1 a (1,3,4,8), Q-1 b(2,3,7),


Remember/Knowledge 14% 14
Q-2 a, Q-4 b
Q-1 a(2,5,10),
Understand 36% Q-1 b(4,5,8,10), Q-3 c, 36
Q-4 a, Q-6 a
Q-1 a(6), Q-1 b(6) , Q-2 b,
Apply 20%
Q-5 a, Q-6 b
20
Q-1 a(9), Q-1 b(9) , Q-3 a,
Analyze 20%
Q-5 b, Q-5 c
20
Q-1 a(7), Q-1 b(1), Q-3 b,
Evaluate 10% 10
Q-6 c
Higher order
- - -
Thinking/ Creative

Chart/Graph of Bloom’s Taxonomy

MARWADI UNIVERSITY 6|

You might also like