Applications of sorted arrays
Edit
Commercial computing[2]
Edit
Government organizations, private companies and many web-based applications have to deal with huge amounts of data. The data will often have to be accessed multiple times. Keeping the data in a sorted format allows for quick and easy retrieval.
In discrete mathematics
Edit
Sorted arrays can be used to implement Dijkstra's algorithm or Prim's algorithm. Also, algorithms like Kruskal's algorithm for finding minimal spanning trees.
In priority scheduling
Edit
At the operating system level, many processes are pending at a time but the can handle only one process at a single instance in time. Therefore, priorities are associated to each process. Then the processes are sent to the CPU according to the highest priority by using sorted array of process IDs. Here, processes got sorted depending upon their priorities and then CPU is allocated to them. The process having the highest priority takes first position in sorted array. Hence priority-wise system processes scheduling is done.[3]
In shortest-job-first scheduling
Edit
This is the special case of priority scheduling. Here, processes get sorted according to burst time of the processes. The process requiring the shortest time will be allocated CPU first. Hence, processes are being sent to CPU according to their burst time.
Process Burst time
P1 3
P2 4
P3 1
P4 8
P5 6
Answers
Answered by
1
▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬
what is this
▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬
mohandoss20:
this is answer for another one sorry for ask
Similar questions