Answer:
The basics: microsoft edge, files, prbly word doc because I`m writing all the time
Other stuff would be spo.tify because i listen to music often and mine.craft
The one that is correct is the one that says "Facts can be scientifically tested"
Engineers who are involved in product design and manufacture of computer-aided should have enough knowledge in circuit and auto cad electronic design.
<u>Explanation:</u>
He or she should have mother board, voltage in or out extra. Person who develops should enough knowledge on circuit design which capacitor, resistance and voltage and processor capacity.
Each design they have first simulates and tested and result should be recorded. On simulation test success design is made.
There is third party software also available for design the circuit and gives the tested results as report.
The 2 statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of data structures with N data is O(N).
- The average time complexity of inserting data into a heap is O(logN).
<h3>What is Time Complexity?</h3>
This is known to be the idea in computer science that handles the quantification of the needed time frame that is taken by a set of code or algorithm to act or run as a function of the numbers of input.
Note that The 2 statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of data structures with N data is O(N).
- The average time complexity of inserting data into a heap is O(logN).
See full question below
. Choose 2 statements that correctly describe the time complexity of data structures with N data. The average time complexity of the data lookup in a hash table is O(N). The average time complexity of the data lookup in a complete binary tree is O(logN). The average time complexity of deleting an item from an array is 0(1). The average time complexity of accessing the kth element in a linked list is 0(1). The average time complexity of inserting data into a heap is O(logN)
Learn more about Data structures from
brainly.com/question/24268720
#SPJ1