Question
A relation R(A, B, C,
- D has the composite candidate key {A, B}, and the functional dependencies AB→C and C→D hold, where C fully depends on the entire key {A,B} (no partial dependency exists). What is the highest normal form that R satisfies?
More IT DBMS Questions
- Wait-Die and Wound-Wait are strategies for:
- What does [aeiou] match in a regular expression?
- Which of the following is an example of a NoSQL database?
- In indexing, which tree is most commonly used for disk-based indexing because it minimizes disk seeks and keeps nodes dense?
- Which normal form removes transitive dependency?
- In relational algebra, the operation that combines tuples from two relations using common attribute values is:
- Shadow Paging avoids:
- Which SQL command is used to retrieve data from a table?
- What is an 'ER Diagram' (Entity-Relationship Diagram) used for in database design?
- What does re.sub(r'(\w+)', r'_\1_', 'hello world') return?
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)