The answer I believe is B
Answer:
When exposed to the powerful magnetic field of a degausser, the magnetic data on a tape or hard disk is neutralized, or erased. Degaussing is the guaranteed form of hard drive erasure, as such; it serves as the standard method of data destruction.
Explanation:
Computational thinking- the thought processes involved in formulating a problem and expressing its solution(s) in such a way that a computer—human or machine—can effectively carry out. Computational Thinking is an iterative process based on three stages.
Problem solving process- The process of working through details of a problem to reach a solution. Problem solving may include mathematical or systematic operations and can be a gauge of an individual's critical thinking skills.
Data- facts and statistics collected together for reference or analysis.
Information- facts provided or learned about something or someone.
Algorithm- a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.
Aggregate data- aggregate data are data combined from several measurements. When data are aggregated, groups of observations are replaced with summary statistics based on those observations. In a data warehouse, the use of aggregate data dramatically reduces the time to query large sets of data.
Discovery Data- in the context of IT, is the process of extracting actionable patterns from data. The extraction is generally performed by humans or, in certain cases, by artificial intelligence systems.
Answer:
I am a young lady.
Explanation:
simply sentence or expand more:
- I am a young lady in my teens.
- I am a young woman in her twenties.
- I am a twenty-year-old lady who is just starting off in life.
- I am a twenty-year-old woman who is just getting her feet wet in the world.
Answer:
two
Explanation:
A linked list is a data structure which stores the multiple-element with data type
and a pointer that stores the address of the next element.
A linked list is a series of nodes connecting each other by a pointer.
a node contains data and a pointer.
For build an array, two pointers are used:
the first pointer for specifies the starting node called head node.
and the second pointer is used to connect the other node to build the linked list.
Both are used to build the array if we lose the head node we cannot apply the operation because we do not know the starting node and we cannot traverse the whole linked list.
for example:
1->2->3->4->5
here, 1 is the head node and -> denote the link which makes by the second pointer.
