Answer:
Using a one time password OTP and using a three factor authentication.
Explanation:
Social engineering is a form system and network attack, drafted by an attacker, to steal user credentials needed for accessing their accounts, to steal information.
Social engineering attacks like phishing, spear phishing, baiting and quid quo pro are used to fool users to giving out their user details.
One time password is an implied use of a password just once and a new password his generated to boost security. In a three factor authentication, OTP can be used as well as biometrics of a user which can not be giving away by a user to an attacker.
The answer is C, can you mark me brain
A driver. A driver is basicly and application or component that helps communicate between you computer and a device(a mouse, keyboard, printer etc.) You may have know when you get a new mouse and connect it up, Windows always tries to find a driver and download it.
Answer:
Please find the answer below
Explanation:
// Online C compiler to run C program online
#include <stdio.h>
int main() {
// Write C code here
//printf("Hello world");
int userNum;
int i;
int j;
scanf("%d", &userNum);
/* Your solution goes here */
for(i = 0; i<=userNum; i++){
for(j = 0; j <= i; j++){
printf(" ");
}
printf("%d\n", i);
}
return 0;
}
Answer:
Question was incomplete and continued the question
For each of the following scenarios, which of these choices would be best? Explain your answer.
BST
Sorted Array
Un-sorted Array
a) The records are guaranteed to arrive already sorted from lowest to highest (i.e., whenever a record is inserted, its key value will always be greater than that of the last record inserted). A total of 1000 inserts will be interspersed with 1000 searches.
b) The records arrive with values having a uniform random distribution (so the BST is likely to be well balanced). 1,000,000 insertions are performed, followed by 10 searches.
Explanation:
Answer for a: Un-sorted array or Un-sorted linked list : as mentioned in the question itself that the records are arriving in the sorted order and search will not be O(log n) and insert will be not be O(n).
Answer for b : Un-sorted array or Un-sorted linkedlist : Number of the items to be inserted is already known which is 1,000,000 but it is very high and at the same time search is low. Unsorted array or Unsorted linked list will be best option here.
