Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
Answer:
The first IBM PC virus in the "wild" was a boot sector virus dubbed (c)Brain, created in 1986 by Amjad Farooq Alvi and Basit Farooq Alvi in Lahore, Pakistan, reportedly to deter unauthorized copying of the software they had written. The first virus to specifically target Microsoft Windows, WinVir was discovered in April 1992, two years after the release of Windows 3.0.
Explanation:
HOPE THIS HELPS
i think its b sorry if wrong
Answer: Strong 128-bit encryption.
Explanation: An individual character corresponds to 8 bits . So if there are 16 characters then,
16
8=128 bits keys
This makes the 128 bit key encryption the strongest amongst all other options.It is strongest because it is almost impossible to decode the 128-character key by any method e.g.-brute-force method.
Other options are incorrect because the characters given by the other bits are as follows: 
=32 characters
=64 characters
=128 characters
Thus, the strongest character key is of 128 bits. for cipher.
