Question
In a relation with a composite candidate key, a functional dependency X→Y is called a 'partial dependency' when:
More IT DBMS Questions
- Which of the following is a property of a relational database?
- Which of the following is used to remove all records from a table without removing the table structure?
- A relation R(A,B,C,D) has functional dependencies A→B and B→C. Which statement follows?
- A relation R(A, B, C, D, E) has the functional dependencies AB→C, C→D, D→E, and E→A. Assuming AB is the only candidate key of R, which normal form does R s...
- A table contains 8,000,000 records, and a B+ tree index built on it has a fan-out (branching order) of exactly 200 at each internal node. What is the appro...
- What does the 'principle of least privilege' mean in information security?
- Consider the following C++-like pseudo-code for a binary tree traversal: ```cpp struct Node { int data; Node left; N...
- Which of the following concurrency control methods avoids deadlocks entirely but can reduce concurrency by blocking transactions at start?
- In database management, what is a 'foreign key'?
- Given the `SinglyLinkedList` and its `delete_node` method as provided, what will be the output of `my_list.print_list()` after the following sequence of op...
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)