Answer:
Some key points to remember, when handling the linked list are as follow:
- Linked list is the linear data structure in which each of the elements contain separate object.
- Linked list components are not store in a contiguous location.
- In the linked list the elements or components are basically use the pointers for linked with another elements.
- The last node of the linked list must contain null value.
- In the linked list, the allocation of the memory is equal to upper node limit.
Answer:
the teacher said a (dash) reads pages on website pls answer me now i have to write it now
Cache memory is a high-speed memory that stores the instructions and data that have been frequently accessed. It decreases the time it takes to decode the instructions stored in the instruction pipeline.
A. It decreases the time it takes to decode instructions stored in the instruction pipeline.
<u>Explanation:</u>
Whenever an instruction is invoked or some data is accessed, the CPU looks for it in the cache memory before accessing the main memory.
If the content is found in the cache memory, it accessed from there and then and hence the access time and decode time is reduced as there were no main memory lockups.
