Answer:
An atom consists of two basic parts: the nucleus and the electrons. The nucleus is the central core of an atom and is made up of protons and neutrons. Electrons are very light, negatively charged particles that surround the positively charged nucleus. Early models of the atom depicted the electrons circling the nucleus in fixed orbits, much like planets revolving around the sun.
Current theory suggests that electrons are housed in orbitals. This is a valence orbital or valence orbit
Explanation:
The outermost orbital shell of an atom is called its valence shell, and the electrons in the valence shell are valence electrons. Valence electrons are the highest energy electrons in an atom and are therefore the most reactive. this is where your valence orbit gets its name because it is the outermost shell.
In the context of web and network privacy issues, new employees in an organization have to sign an acceptable use policy (AUP) before they access the network. This usage policy<span> or fair use policy, </span> provides guidance and set of rules for using the network and network resources and protects the network and the users.
Answer:
it is an electronic device that manipulates raw facts into a meaning and organized information
Answer:
Question was incomplete and continued the question
For each of the following scenarios, which of these choices would be best? Explain your answer.
BST
Sorted Array
Un-sorted Array
a) The records are guaranteed to arrive already sorted from lowest to highest (i.e., whenever a record is inserted, its key value will always be greater than that of the last record inserted). A total of 1000 inserts will be interspersed with 1000 searches.
b) The records arrive with values having a uniform random distribution (so the BST is likely to be well balanced). 1,000,000 insertions are performed, followed by 10 searches.
Explanation:
Answer for a: Un-sorted array or Un-sorted linked list : as mentioned in the question itself that the records are arriving in the sorted order and search will not be O(log n) and insert will be not be O(n).
Answer for b : Un-sorted array or Un-sorted linkedlist : Number of the items to be inserted is already known which is 1,000,000 but it is very high and at the same time search is low. Unsorted array or Unsorted linked list will be best option here.
