Question
Given the following tables: Orders (OrderID,
CustomerID, OrderDate) and Customers (CustomerID, CustomerName, City), what SQL query will return the names of customers who have placed orders in 'New York' within the last 30 days?Solution
The correct query utilizes a JOIN between the Customers and Orders tables on the CustomerID field. This allows you to filter customers who are located in 'New York' and have placed an order in the last 30 days. The JOIN ensures that only customers who have an associated order are included, and the date condition (OrderDate >= CURDATE() - INTERVAL 30 DAY) filters for recent orders. Why Other Options Are Wrong : A) Incorrect : The query attempts to filter customers directly, but it fails to include the necessary JOIN with the Orders table, which is crucial for retrieving orders placed by customers in 'New York'. C) Incorrect : This query incorrectly selects from the Orders table and does not filter by customer details. The City column does not exist in the Orders table. D) Incorrect : This query incorrectly attempts to select data from the Customers table without joining it with the Orders table, so there will be no filtering by order date. E) Incorrect : Although the JOIN is correctly applied, this query places the conditions in the wrong order, and the query logic would still be correct but unnecessarily complex.
Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
Which of the following is NOT a characteristic of the Internet of Things (IoT)?
The amortized time for inserting into a dynamic array (like C++ vector) is:
In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
Which of the following is substring of “IXAMBEE”?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?