SQL Exercise: Sort unique jobs by department in descending order
SQL employee Database: Exercise-76 with Solution
[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.
Sample table: employees
SELECT DISTINCT job_name FROM employees WHERE dep_id IN (2001, 3001) ORDER BY job_name DESC;
job_name ---------- SALESMAN MANAGER CLERK ANALYST (4 rows)
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:
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.
SQL: Tips of the Day
Grouped LIMIT in PostgreSQL: Show the first N rows for each group?
db=# SELECT * FROM xxx; id | section_id | name ----+------------+------ 1 | 1 | A 2 | 1 | B 3 | 1 | C 4 | 1 | D 5 | 2 | E 6 | 2 | F 7 | 3 | G 8 | 2 | H (8 rows)
I need the first 2 rows (ordered by name) for each section_id, i.e. a result similar to:
id | section_id | name ----+------------+------ 1 | 1 | A 2 | 1 | B 5 | 2 | E 6 | 2 | F 7 | 3 | G (5 rows)
PostgreSQL v9.3 you can do a lateral join
select distinct t_outer.section_id, t_top.id, t_top.name from t t_outer join lateral ( select * from t t_inner where t_inner.section_id = t_outer.section_id order by t_inner.name limit 2 ) t_top on true order by t_outer.section_id;
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook