Answer:
Option A(True) is the correct answer for the above question.
Explanation:
- The flowchart is used to give the solution of a problem through the diagram in a step by step processor. It helps the user to understand the solution easily. For diagram, it uses many types of symbols that are fixed for every sequence just like An oval symbol represents the start and end of the flowchart which is fixed for every flowchart.
- So for the decisions in a flowchart, the diamond symbol is used which is to make the decisions and it has two sides-- one is true and the other is false.
- The decisions are used also to represent the loop structure which is also called the repetition structure because the loop is controlled by the help of decisions so the diamond box is also used for the loop
- The above question-statement says that the decisions-controlled is used for the loop and for the decisions which are true because it is also described above.
Answer:
Advantages: computers don't make human error
It can be used for communication
Ease of access
Disadvantages: computers can be a distraction
Potential loss of privacy
It can limit learning and create a dependency
Answer:
Ransomware
Explanation:
Just as its name implies, you have to pay a 'ransom' to get a locked file that belongs to you
Answer:
Java Class given below
Explanation:
class ReadOnly
{
protected int val;
public ReadOnly(int arg)
{
val = arg;
}
public int getVal()
{
return val;
}
}
class ReadWrite extends ReadOnly
{
private boolean dirty;
public ReadWrite(int arg)
{
super(arg);
dirty = false;
}
public void setVal(int arg)
{
val = arg;
dirty = true;
}
public boolean isDirty()
{
return dirty;
}
}
In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.
