SQL Exercise: Sort unique jobs by department in descending order
[An editor is available at the bottom of the page to write and execute the scripts.]
76. From the following table, write a SQL query to list the unique jobs of department 2001 and 3001 in descending order. Return job name.
Pictorial Presentation:
Sample table: employees
Sample Solution:
SELECT DISTINCT job_name
FROM employees
WHERE dep_id IN (2001,
3001)
ORDER BY job_name DESC;
Sample Output:
job_name ---------- SALESMAN MANAGER CLERK ANALYST (4 rows)
Explanation:
The said query in SQL that selects the distinct job names of employees from the 'employees' table who work in departments 2001 or 3001, and orders the results in descending order by job name.
The DISTINCT keyword eliminates duplicates in the result set, ensuring that each job name appears only once.
The WHERE clause filters the results to only include employees who work in departments 2001 or 3001.
The ORDER BY clause orders the result set by job name in descending order.
Relational Algebra Expression:
Relational Algebra Tree:
Practice Online
Sample Database: employee
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
Previous SQL Exercise: Ascending by job name and descending by employee ID.
Next SQL Exercise: Employees except given job in ASC order of salaries.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.