Yeah, you

1071-E2FR5Q

1.
create table magasfizetes as
select * from employees;
delete from magasfizetes;

create or replace trigger beszuras
after insert on employees
for each row
declare x number(5);
begin
select avg(salary) into x
from employees
where department_id=:new.department_id
group by department_id;
if x < :new.salary then
insert into magasfizetes values(:new.employee_id, :new.last_name, :new.first_name,
:new.email, :new.phone_number,:new.hire_date, :new.job_id, :new.salary, :new.commission_pct,
:new.manager_id, :new.department_id);
dbms_output.put_line('magas');
end if;
end;
savepoint sp;
insert into employees values(1,'kiara', 'kamaridisz', 'kk', '123',
to_date('2012.12.04.','yyyy.mm.dd.'), 'IT_PROG', 10000, null, 100, 60);
rollback to sp;

2.
create or replace procedure nemtom (varos varchar) is
osszfizu number;
begin
select sum(salary) into osszfizu
from employees natural join departments
natural join locations
where lower(city)=lower(varos);
if osszfizu is not null then
dbms_output.put_line(osszfizu);
else
dbms_output.put_line('nincs');
end if;
end;
begin nemtom('rama');
end;

3.a
select last_name || ' ' || first_name as nev, job_title
from employees e, jobs j
where e.job_id=j.job_id and salary in
(select max_salary from jobs);

3.b
select first_name || ' ' || last_name as foni, salary, job_title, beosztott
from employees e,
(select e1.employee_id, count(*) beosztott
from employees e1, employees e2
where e2.manager_id=e1.employee_id
group by e1.employee_id) beo, jobs
where e.employee_id=beo.employee_id and e.job_id=jobs.job_id;

3.c
select location_id, street_address, city
from locations
order by location_id desc
fetch first 4 rows only;

remove_front :: Pointer (Node a) -> Pointer (Node a)
remove_front Nil = error "remove_front: empty list"
remove_front (Value (Node {next = n})) = n

remove_back :: (Eq a) => Pointer (Node a) -> Pointer (Node a)
remove_back Nil = error "remove_back: empty list"
remove_back ptr@(Value (Node {key = k, next = n}))
| n == Nil = Nil
| otherwise = Value (Node {key = k, next = remove_back n})

push_front :: Pointer (Node a) -> a -> Pointer (Node a)
push_front ptr x = Value (Node {key = x, next = ptr})

push_back :: Pointer (Node a) -> a -> Pointer (Node a)
push_back Nil x = Value (Node {key = x, next = Nil})
push_back ptr@(Value (Node {key = k, next = n})) x = Value (Node {key = k, next = push_back (remove_front ptr) x})

insert :: Pointer (Node a) -> a -> Integer -> Pointer (Node a)
insert l x 0 = push_front l x
insert Nil x _ = Value (Node {key = x, next = Nil})
insert (Value (Node {key = k, next = n})) x i
| i > 1 = Value (Node {key = k, next = insert n x (i-1)})
| i == 1 = Value (Node {key = k, next = push_front n x})

remove :: (Banán) -> remove_medal (Wicked_Sick)
(x = d)