Answer:
The trigger code is given below
create trigger F1_Del
after delete on Friend
for each row
when exists (select * from Friend
where ID1 = Old.ID2 and ID2 = Old.ID1)
begin
delete from Friend
where (ID1 = Old.ID2 and ID2 = Old.ID1);
end
create trigger F1_Insert
after insert on Friend
for each row
when not exists (select * from Friend
where ID1 = New.ID2 and ID2 = New.ID1)
begin
insert into Friend values (New.ID2, New.ID1);
end
This is to much work for 5 points cmon
Answer:
Software updates do a lot of things. Software updates offer plenty of benefits. ...
Updates help patch security flaws. Hackers love security flaws, also known as software vulnerabilities. ...
Software updates help protect your data. ...
It’s not all about you. ...
You deserve the latest and greatest
Explanation:
hope that worked
Answer:
View Base tables: Virtual table based on a SELECT query
CREATE VIEW statement: Data definition command that stores the query specification in the data dictionary
DROP VIEW statement: Data definition command that removes the query specification in the data dictionary
Explanation:
Views are virtual tables, which can be created by select queries using the real database tables.
Creating and dropping views can be done by the CREATE VIEW and DROP VIEW statements.
<u>CREATE VIEW syntax:</u>
CREATE VIEW view_name AS
SELECT column1, column2, ...
FROM table_name
WHERE condition;
<u>DROP VIEW syntax:</u>
DROP VIEW view_name;
Answer:
The worst case running time of a linear search is O(N).
Explanation:
In a linear search, you will run the program looking at each array position until you find your desired information.
The best case scenario is when you find it at the first position.
The worst case scenario is when you find the value at the last array position. So, in a N-length array, the information is at position N. This means that the worst case running time of a linear search is O(N).
