23. The scheduling algorithm in which the CPU is allocated to the first process which reaches the CPU is called_ A Priority scheduling B Shortest Remaining Time Next C Shortest Job First + First-Come-First-Serve 24. The ability of an application to run in different platforms is called_ A reusability -B flexibility C reliability D Portability 25. A process may be at any time running, runnable or suspended. Which of the following statements is true? A A process will join the queue of suspended jobs if, while it is running, the time slice expires B A process is runnable if it is waiting for an 1/O device to become free C A process is running if it is in memory, waiting for the process to become free D A process is suspended if it is waiting for an l/O device to become free

23. The scheduling algorithm in which the CPU is allocated to the first process which reaches the CPU is called_ A Priority scheduling B Shortest Remaining Time Next C Shortest Job First + First-Come-First-Serve 24. The ability of an application to run in different platforms is called_ A reusability -B flexibility C reliability D Portability 25. A process may be at any time running, runnable or suspended. Which of the following statements is true? A A process will join the queue of suspended jobs if, while it is running, the time slice expires B A process is runnable if it is waiting for an 1/O device to become free C A process is running if it is in memory, waiting for the process to become free D A process is suspended if it is waiting for an l/O device to become free

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question 1 Typed answers are easier for students to read than handwritten notes
What is the difference between depth-first search (DFS) and breadth-first search (BFS) in computer science?
Other than the examples in this book, define the three types of recursive binary relationships and provide an example of each.
#15
1. What is an algorithm?
Name and explain the three elements of recursion. Provide an example of recursion in nature, real life. Provide an example of a programming application which would be an appropriate place to implement recursion.
Answer quickly as soon as possible. Algorithm 1. Analysis of Algorithms (Asymptotic Notation, Divide and Conquer, Recurrences)Algorithm 2. Graph Algorithms (Single Source Shortest Path, Dijkstra's Algorithm) State the above 2 algorithms—answer using bullet points.
Kevin wants to conduct a Boolean search on two different topics. Which Boolean operator should Kevin use to get the right search results?