Answer:
The Fastest car in the world would be between 1,184 Horse Power-1,106 Torque
Explanation:
Multiple research has been conducted with regards to this point of view, but the common conclusion is that it depends more on the platform. People tend to be more dishonest when not comfortable and when given the chance live off their fantasy even for short while online. We all do agree that an example is the social media where in order to get attention we only share positive things. You might want to check speaker Simon Sinek and see rich views and in depth understanding of how technology has changed us.
Answer:
a) Generate a new public and private key
Explanation:
You encrypt a message using the recipient's public key and the recipient decrypts the message using his own private key. Only the public key can be known by an external agent. The private key is for the individual and is not expected to be shared. In the event that the recipient cannot decrypt the message, it is unsafe to send one's private key to him. He does not even need one's private key to decrypt the message, he needs his own private key.
The best thing to do is to generate another means of security by generating new public and private key so that the sender encrypts the message with the new public key and the receiver decrypts it using his new private key.
Option B is wrong because, if the encryption is removed, the aim, which is to secure the message from intruders is not achieved.
Answer:
C)
Explanation:
One principle that can improve the efficiency of I/O would be to move processing primitives into hardware. Primitives are a semantic value representing something else such as words or numbers within the programming language. By moving them into hardware they system is able to read them at a much faster speed making the I/O more efficient.
Answer:
The Solution Code is written in Java.
- public class Main {
- public static void main(String[] args) {
- System.out.print("Please enter an integer: ");
- Scanner input = new Scanner(System.in);
- int number = input.nextInt();
- System.out.print("Prime numbers less than or equal to " + number + " : ");
- for(int i=2; i <= number; i++){
- if(checkPrime(i)){
- System.out.print(i + " ");
- }
- }
- }
- public static Boolean checkPrime(int num){
- for(int i=2; i < num; i++)
- {
- if(num % i == 0){
- return false;
- }
- }
- return true;
- }
- }
Explanation:
Firstly, we create a function to check if a number is prime (Line 18 - 27).
- This function will take one input value which is an integer, num.
- To check if the input num is a prime, we can use modulus operator, %, to confirm if the num is divisible by any number starting from 2 to num - 1 (Line 19 - 24).
- If the num is divisible by any number expect 1 and itself, it should equal to zero and return false to indicate it is not a prime number.
- If all the num (except 1 and itself) is not divisible, the function will return true (Line 25).
Next, in our main program part (Line 3 - 16)
- Prompt the user to input a number (Line 5 - 7)
- Using a for-loop, we can keep calling the checkPrime() function by passing a current number (starting from 2 to input number) as argument (Line 12). The checkPrime() function will run and return true it the current number is prime, return false if it is not prime.
- If the checkPrime() function return true, it will print the current number before proceed to the iteration of the for-loop to repeat the same check prime procedure (Line 13)
- At the end all the prime numbers less than or equal to the input number will be printed out in the terminal
