You actually have the correct answer. An excel formula starts with = so your answer would be =4*6
Answer:
because it provides you a lot of storage and the post production equipment to handle it and it is used to do big projects
Explanation:
so l know this much it is correct please mark me brainllest
The simplest ways are being used to help eliminate the previously stored data, by deleting hard disc storage facilities with the same data wherever that used a sequence of all zeros.
<h3>What is a hard disc?</h3>
The "DoD Standard" is a term used during the data sanitizing industry and refers to DoD 5220.22-M, and the further discussion can be defined as follows:
The simplest ways are being used to help eliminate the previously stored data, by deleting hard disc storage facilities with the same data wherever that used a sequence of all zeros.
The sparging eliminates statistics to entirely delete the gravitational flux from electronic media.
Hard drives as well as other data storage devices, for example, computer tapes, retain magnetic data.
It could no longer be seen as storage after a disk is degaussed.
Therefore, the final answer is "Using the DoD 5220.22-M method and Degauss media with a magnet".
Learn more about hard disc at:
brainly.com/question/13329582
#SPJ1
Answer:
true I know this cuz I smart
A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers.
<h3>What is a binary search tree?</h3>
A binary search tree, also known as an ordered binary tree or a sorted binary tree in computer science, is a rooted binary tree data structure where each internal node's key is higher than all the keys in its left subtree and less than all the keys in its right subtree.
A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers. Because each tree node has a maximum of two offspring, it is known as a binary tree. It can be used to search for the presence of a number in O(log(n)) time.
A binary search tree (BST) is a specific type of binary tree in which every node has a comparable key and a connected or associated value.
To learn more about binary search trees refer to:
brainly.com/question/28295292
#SPJ4