The FCFS algorithm is particularly troublesome for
Asked in APSC 66 12/ Junior Manager (Electrical / Mechanical / IT/ INSTRUMENTATION) , in Assam Power Generation Corporation Limited (APGCL) (Advt. No. 12/, dtd 25-04-) ELECTRICAL ENGINEERING ME 2023
Show answer
Answer: C. time-sharing system
More APSC Prelims previous year questions questions
- If a process fails, most operating systems write the error information to a/an
- A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry. How many pages are there in the virtual address space?
- With round-robin scheduling algorithm in a time-shared system
- Which of the following statements is/are true? I. Shortest remaining time first scheduling may cause starvation. II. Preemptive scheduling may cause starvation. III. Round-robin is better than FCFS in terms of response time.
- Which data structure is used for implementing recursion?
- Level of node is distance from root to that node. For example, level of root is 1 and level of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is
- Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like 2 5 1 7 9 12 11 10 Which of the following statements is correct?
- Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum one or two elements are misplaced)?