Question

Given a table Orders(OrderID, CustomerID, Amount), which SQL statement correctly returns the CustomerID of every customer who has placed more than 3 orders with a combined order amount exceeding 5000?

Q: Answer-Given a table Orders(OrderID, CustomerID, Amount), which SQL statement correctly returns the Custome...

WHERE filters individual rows before any grouping occurs, so it cannot reference aggregate functions like COUNT or SUM attempting to use WHERE with aggregates as in options A, C, and E is a syntax error. HAVING is specifically designed to filter groups after aggregation has been performed, and it must appear after the GROUP BY clause, not before it ruling out option D. Option B correctly groups by CustomerID first and then filters those groups using HAVING with both aggregate conditions.

A SELECT CustomerID FROM Orders WHERE COUNT(*) > 3 AND SUM(Amount) > 5000 GROUP BY CustomerID;

B SELECT CustomerID FROM Orders GROUP BY CustomerID HAVING COUNT(*) > 3 AND SUM(Amount) > 5000;

C SELECT CustomerID FROM Orders GROUP BY CustomerID WHERE COUNT(*) > 3 AND SUM(Amount) > 5000;

D SELECT CustomerID FROM Orders HAVING COUNT(*) > 3 AND SUM(Amount) > 5000 GROUP BY CustomerID;

E SELECT CustomerID, COUNT(*), SUM(Amount) FROM Orders WHERE CustomerID GROUP BY HAVING COUNT(*) > 3 AND SUM(Amount) > 5000;

Practice Next

More IT DBMS Questions

You have a Python list of fruits and want to extract a specific sub-list using slicing. Complete the missing part of the code to obtain the sub-list `['b...
A relation is in 2NF if:
What is a table joined with itself called?
What is context switching?
Given a relation R(A, B, C, D, E) and functional dependencies {A -> B, BC -> D, D -> E}. Which of the following is a candidate key for R?
Which of the following is a property of a relational database?
An RDBMS provides mechanisms for data integrity, such as primary keys and foreign keys, which are generally lacking in:
In indexing, which tree is most commonly used for disk-based indexing because it minimizes disk seeks and keeps nodes dense?
In relational algebra, the operation that combines tuples from two relations using common attribute values is:
Distributed 2-Phase Commit (2PC) can suffer from:

Hey! Ask a query

🎓

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)

Download Now 100% Free PDF

Given a table Orders(OrderID, CustomerID, Amount), which SQL statement correctly returns the CustomerID of every customer who has placed more than 3 orders with a combined order amount exceeding 5000?

Detailed Solution

More IT DBMS Questions

Hey! Ask a query

Please Register/Login

RBI Grade B 2026 Phase 1 Memory Based Paper