SQL Exercise: List the employees in given department, joined after 91
SQL employee Database: Exercise-65 with Solution
[An editor is available at the bottom of the page to write and execute the scripts.]
65. From the following table, write a SQL query to find those employees who joined after 1991, excluding MARKER or ADELYN in the departments PRODUCTION or AUDIT. Return employee name.
Sample table: employees
Sample table: department
Sample table: salary_grade
SELECT e.emp_name FROM employees e, department d, salary_grade s WHERE e.dep_id = d.dep_id AND d.dep_name IN ('PRODUCTION', 'AUDIT') AND e.salary BETWEEN s.min_sal AND s.max_sal AND e.emp_name NOT IN ('MARKER', 'ADELYN') AND to_char(hire_date,'YYYY') >'1991';
emp_name ---------- ADNRES SCARLET (2 rows)
The said query in SQL that retrieves the names of employees who belong to the "PRODUCTION" or "AUDIT" departments, have a salary within the range of their grade, were not hired before 1991, and have names other than "MARKER" and "ADELYN" from the 'employees', 'department', and 'salary_grade' tables.
The WHERE clause first joins the 'employees' and 'department' tables based on the department ID column.
It then retrieve employees who belong to the departments named "PRODUCTION" or "AUDIT" and then it checks whether the employee's salary falls within the range of minimum and maximum salaries defined for their grade in the 'salary_grade' table.
The WHERE clause then excludes employees with the names "MARKER" and "ADELYN" and includes only those employees who were hired after 1991 from the results.
Sample Database: employee
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
Previous SQL Exercise: List the employee with their grade for the grade 4.
Next SQL Exercise: List the employees in ascending order of their 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