<em>hoping</em><em> that</em><em> </em><em>it </em><em>was </em><em>helpful</em><em> to</em><em> </em><em>you</em>
<em>plz </em><em>mark </em><em>me </em><em>as </em><em>brainlist</em><em> answer</em>
Answer:
O(n²)
Explanation:
The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).
This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.
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
The answer is NO.
Thats what makes UDP connectionless. Aclient that is going to
send a UDP message to the server just sends it.The server does not know it is
coming untill it arrives .When a server recieves a UDP message it gets the
source address/port and the data.
