Answer:
While statements determine whether a statement is true or false. If what’s stated is true, then the program runs the statement and returns to the first step. If what’s stated is false, the program exits the while and goes to the next statement. An added step to while statements is turning them into continuous loops. If you don’t change the value so that the condition is never false, the while statement becomes an infinite loop.
If statements are the simplest form of conditional statements, statements that allow us to check conditions and change behavior/output accordingly. The part of the statement following the if is called the condition. If the condition is true, the instruction in the statement runs. If the condition is not true, it does not. The if statements are also compound statements. They have a header (if x) followed by an indented statement (an instruction to be followed is x is true). There is no limit to the number of these indented statements, but there must be at least one.
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.
Answer:
Going green has several other benefits for companies. These include tax credits and incentives, improved efficiency, healthier workplaces, and cost savings – for instance by printing less, turning lights off in unused rooms and refilling ink cartridges. Reusing items also reduces waste from plastic packaging.
Explanation:
Answer:
Link-local address
Explanation:
IP addresses that have "FE80" as the hexadecimal representation of their first 10 bits are IPV6 reserved addresses for link-local unicast addressing. These addresses are automatically configured (though may be manually configured too) on any interface and should not be routed. They are used for addressing on a single link with the main aim, among others, of automatic configuration and routing protocol advertisement. Devices attached to this link can be accessed or reached using the link-local addresses as they don't need a global address to communicate.
However, routers will not forward datagram or packets using link-local addresses. In other words, routers are not allowed to connect to the internet using the unicast link-local addresses.
// Variable to keep track of array size
int length = 0;
// Array itself
int array[] = {};
// while loop will take input in the array until a negative number is entered
while(input>=0){
stdin = new Scanner(System.in);
array[length] = stdin;
length +=1;
}
// int variable to terminate while loop
int i =0;
// keep track of index of output array
int y =0;
while(arr[i] != length){
// making output array
int output[]={}; bool flag;
// put the element in out put array considering if it the desired one
output[y] = array [i];
// Now check if it was the desired?
for(int z=1;z<=length;z++){
if(array[i+z]!=output[y]){
flag = true;
}
else
{
output[y]=0;
y+=1;
}
if(array[i+z+1]=output[y] && flag == true){
output[y] = array[i];
y+=1;
}
}
//output the array
for(int o=0;o<y;o++)
System.out.println(output[o];
