what is the searching technique used for selecting a job from ready queue ?

Question

If the ready queue is such that we have all the PCB's linked up together as a linked list then whenever the CPU needs to pick
up a process for execution then does it perform linear search on it , and if it does then it would be taking large time
since there a large no of processes executing simultaneously in the memory , so then which searching technique is generally empolyed
to pick up a process from the linked list ?

Answer 1

You had told "ready queue" in question.

A queue can be implemented using a linkedlist, but always allows constant time deletion- and this is used to pick up a process for execution. There is no need to do a search here. Whatever criteria is needed to pick up a process can be used to design the "priority" of the queue and it can be made a priority queue.