Answer:
Explanation:
The arithmetic logic unit (ALU) performs mathematical, logical, and decision operations. It can be divided into the arithmetic unit (responsible for addition, subtraction, multiplication and division). And logic unit (responsible for comparing, selecting, matching and merging different data or information). The power and efficiency of the CPU depends on the design of the ALU.
Next up is the control unit (CU) which directs all the processor’s operations. It’s where the CPU reads and interprets requests from memory and transforms them into a series of signals (binary). Then it sends the operation to various parts of the laptop as instructed. The CU calls the ALU to perform the necessary calculations. It also coordinates all input/output devices to transfer or receive instructions.
The main job of the memory unit is to store data or instructions and intermediate results. It’s divided into primary memory and secondary memory to supply data to other units of the CPU. It allows the CPU to perform functions requested by programs like the operating system without having to ask RAM.
Another element of the CPU not depicted in the diagram is transistors. To carry out calculations, binary information (ones and zeros) is stored in these microscopic switches. They control the flow of electricity depending on whether the switch is ON or OFF. Signals turn off and on different combinations of transistors to perform calculations. A very thin silicon chip can contain several hundred million transistors.
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
A pre-programmed function is a section of code which is reusable to perform certain routine. One benefit of using a pre-programmed function to analyze data is the code redundancy can be reduced. The function is only written for once and it can be called to perform a specific data analysis whenever it is needed.
Besides, a pre-programmed function also offer consistent analytical output as all data are processed by a same analytical procedure in the function.
Answer: 1. put her insertion point at the end of item 2b. 2. press enter key
Answer:
where is the picture?????
