Answer:
Generations of Computers Generation in computer terminology is a change in technology a computer is/was being used. Initially, the generation term was used to distinguish between varying hardware technologies. Nowadays, generation includes both hardware and software, which together make up an entire computer system.
Answer:
public class Main
{
public static void main(String[] args) {
int carYear = 1995;
if(carYear < 1967)
System.out.println("Probably has few safety features.");
if(carYear > 1971)
System.out.println("Probably has head rests.");
if(carYear > 1992)
System.out.println("Probably has anti-lock brakes.");
if(carYear > 2002)
System.out.println("Probably has tire-pressure monitor.");
}
}
Explanation:
The code is in Java.
Initialize the carYear
Use if statements to handle year before 1967, after 1971, after 1992 and after 2002.
Print the required message for each if statement
Answer:
The answer is "Actual products".
Explanation:
The key purpose of this research is to better analyze the concepts, which is done to establish customer buying expectations and perceptions of the item. The key point is to assess the consumers ' initial response to the product idea.
- This concept testing is also known as a creation, it is an advantage, which can be conveyed to the user to test their reactions.
- In conceptual testing, it is a quality check between the design definition and the actual production of the product.
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.
