The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
<h3>What is time complexity of data structures?</h3>
Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.
Note that The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
Learn more about data from
brainly.com/question/17350816
#SPJ1
Networks in small areas are called Local Area Network (LAN). LAN's are in small areas like offices and buildings. Computers close to each other can make up a LAN network with the right equipments. A LAN network is good for doing business.
Answer:
PNG
Explanation:
PNG files can shrink to incredibly small sizes - especially images that are simple colours, shapes, or text. This makes it the ideal image file type for Web graphics.
Answer:
Advantages of hardware:
Physical existence
Multitasking
Speedy
Disadvantages:
Costly as different equipment cost differently
Time consuming
requires space
Privacy issues
Explanation:
Advantages of Software:
Less costly
Improved privacy controls
Requires no space
Disadvantages:
Does not have physical existence
hacking and cyber attacks may steal important information
Regular updates required
I believe the answer is D, document object model. Conditional Statements deal with if statements, iterative structures are while and for loops, HTML tags are the tags which help to format and define a webpage, and src attribute deal with specifying external sources for certain tags.
