Answer: Passive
Explanation: Passive scanning is the process that scans the possibility of the risk that can arise while data is received starting port to the destination. It does the scanning between the server and the client software to define vulnerability .
It cannot work in those network which don't persist the traffic.No false data that is present in the application is detected by it if the data is unclear.
Answer:
False.
Explanation:
The /tmp directory is a directory that contains files that are required temporarily and also for temporary storage of data.The data inside the /tmp directory gets deleted when the system boots or shuts down.Since the directory exists permanently the content inside it is temporary.
So we can conclude that the answer is False.
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:
int count =0;
for(int i=0;i<10;i++)
{
if(myArray[i]>=0)
{
count++;
}
}
cout<<"Number of positive integers is "<<count<<endl;
Explanation:
The above written loop is for counting positive integers in the myArray[].
For counting we have taken a count integer initialized with 0.On iterating over the array if the element is greater than or equal to 0 we consider it as positive and increasing the count.At the end printing the count.
Computer hacking<span> refers to the practice of modifying or altering </span>computer<span> software and hardware to accomplish a goal that is considered to be outside of the creator's original objective.
</span>
“bot,” is a computer under the control of a hacker <span>without the knowledge of the computer user.</span>
