Answer:
The typedef struct is as follows:
typedef struct jumper_t {
char name[16];
double tries[N_TRIES];
double best_jump;
double deviation;
} jumper_t;
The declaration of jlist is:
jumper_t jlist[10];
Explanation:
This defines the typedef structure
typedef struct jumper_t {
The following declares the variables as stated in the question
<em> char name[16];
</em>
<em> double tries[N_TRIES];
</em>
<em> double best_jump;
</em>
<em> double deviation;
</em>
}
This ends the typedef definition
jumper_t;
(b) The declaration of array jlist is:
jumper_t jlist[10];
The question above has multiple choices as below;
<span>a. </span>Wear aggregation.
<span>b.
</span>Wear mitigation.
<span>c. </span>Wear prevention
<span>d.
</span>Wear leveling
The answer is d) Wear leveling.
This technique by some SSD controllers to increase the
memory’s lifetime is called wear leveling. The mechanism for this principle is
simple: distribute the entries for all the blocks evenly so that they will wear
out evenly. Flash controller typically manages wear leveling and uses a wear
leveling algorithm to control which physical block to use.
Answer:
// Program is written in C++ Programming Language
// Comments are used for explanatory purpose
// Program starts here
#include<iostream>
using namespace std;
int main()
{
// Declare integer variable n which serves as the quotient.
int n;
// Prompt to enter any number
cout<<"Enter any integer number: ";
cin>>n;
// Check for divisors using the iteration below
for(int I = 1; I<= n; I++)
{
// Check if current digit is a valid divisor
if(n%I == 0)
{
// Print all divisors
cout<<I<<" ";
}
}
return 0;
}
Answer:
1. A high level algorithm for cooking a cheeseburger could be:
- Heat fry pan
- Cook one side of the hamburger
- Wait
- Turn hamburger upside down
- Put cheese over hamburger
- Wait
- Cut hamburger bread in half
- Put cooked hamburger inside bread
- End (eat)
2. A detailed algorithm for cooking a cheeseburger could be:
- Place fry pan over the stove heater
- Turn on heater (max temp)
- IF fry pan not hot: wait, else continue
- Place raw hamburger on fry pan
- IF hamburger not half cooked: Wait X time then go to line 5, else continue
- Turn hamburger upside down
- Put N slices of cheese over hamburger
- IF hamburger not fully cooked: Wait X time then go to line 8, else continue
- Turn off heater
- Cut hamburger bread in half horizontally
- Put cooked hamburger on one of the bread halves.
- Put second bread half on top of hamburger
- End (eat)
Explanation:
An algorithm is simply a list of steps to perform a defined action.
On 1, we described the most relevant steps to cook a simple cheeseburger.
Then on point 2, the same steps were taken and expanded with more detailed steps and conditions required to continue executing the following steps.
In computational terms, we used pseudo-code for the algorithm, since this is a list of actions not specific to any programming language.
Also we can say this is a structured programming example due to the sequential nature of the cooking process.
• Installed a program containing ransomware/malware. (Do not accept downloaded without inferring it was installed)
• Opened an email attachment containing malware.
• Opened a file containing a malicious macro.
• Left his computer unsecure allowing someone else to install malware on it. (Should include an example, e.g. not logging off)
