Answer:
The answer to these questions can be defined as below:
Explanation:
Question 1:
In the best case big-oh the bubble and selection sort is used, where bubble style simply swaps the items, whereas the sort of sorting takes place by choosing the element.
Question 2:
In the worst case, the merge and selection is used, where Merge-sort splits the list into two sub-lists equally and incessantly names itself in the sublists to still be sorted, whereas Heap-sort is an anti-recursive type.
Question 3:
In the worst case of swapping the bubble sort algorithm is used.
Question 4:
In sorts of swap selection, bubble, and quick sort is used.
Question 5:
Insertion sorts provide the shift sorts.
Question 6:
The best big-oh is o(n), in the worst case, best case complexity of different sorts are different.
Answer:
The correct answer is "0.73 A".
Explanation:
Given that:
Power,
P = 8.3 W
Voltage,
ΔV = 11.4 V
The current will be:
⇒ 
On substituting the values, we get
⇒ 
⇒ 
Answer:
binary is a language.
Explanation:
Well it is a language which uses only two numbers, 0 and 1. This is the language that computer understands. 0 in general means true and 1 in general means false. Binary codes are used for various methods of encoding data.
Answer:
DNS poisoning
Explanation:
DNS is a server service that verifies or resolves an IP address to a site or domain name. It's services is made available with a dhcp request from a client system, providing the ip address of the DNS server. The DNS server has the records of domain name linked to their individual ip addresses.
When an attacker wants a client to visit his site without knowing the site is not genuine, he gains access to the dns server and changes the information or poisons the entries of the server. So if the client tries to access that site, it takes him to the attackers site. This is called DNS poisoning.
