Welcome to the DBMS MCQs Page
Dive deep into the fascinating world of DBMS with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of DBMS, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of DBMS, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.
Check out the MCQs below to embark on an enriching journey through DBMS. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.
Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of DBMS. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!
DBMS MCQs | Page 2 of 23
Explore more Topics under UGC CBSE NET Exam
1. An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among . entity types.
IV. Semantic integrity constraints that reflects the business rules about data not captured in the ERdiagram.
Branch = (Branch-name, Assets, Branch-city)
Customer = (Customer-name, Bank name, Customer-city)
Borrow = (Branch~name, loannumber, customer account-number)
Deposit = (Branch-name, Accountnumber,
Customer-name, Balance)
Using relational Algebra, the Query that finds customers who have balance more than 10,000 is_______
Student (stuid, name, course, marks)
Which one of the following two queries is correct to find the highest marks student in course 5 ?
Q.1. Select S.stuid From student S Where not exists (select * from student e where e.course = '5' and e.marks ≥s.marks)
Q.2. Select s.stuid From student S Where s.marks >any (select distinct marks from student S where s.course =5)
a.Decomposition Rule (i) If X →Y and Z →W then {X, Z} → {Y, W}
b. Union Rule (ii) If X →Y an {Y,W} → Z then {X, W} → Z
c. Composition Rule (iii) If X →Y and X →Z then X → {Y, Z}
d. Pseudo transitivity Rule (iv) If X →{Y,Z} and {Y,W} → Z then X → Y and X →Z
List - I List - II
a. Secondary i. Functional Dependency
Index
b. Nonprocedural ii. B-Tree
Query
Language
c. Closure of iii. Relational Algebraic
set of Operation
Attributes
d. Natural iv. Domain Calculus
JOIN
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
