Question
Consider three processes P1, P2, P3 with burst times 10, 5, 8 milliseconds respectively. All arrive at time 0. If they are scheduled using the Shortest Job First (SJ
- F non-preemptive algorithm, what is the average waiting time?
More IT Operating System Questions
- Which is relational Database
- There is a BST and below is the Pre order of the BST, What will be it’s In order 150 70 60 80 250 200 350
- Consider a Shape class with a method draw(), and Circle and Rectangle classes that inherit from Shape and override draw(). If you have a List containing Ci...
- Complete the is_empty method for a stack implemented using a Python list. class Stack: def __init__(self): self._items = [] def push(...
- Which of the following programming language most of “Wireshark” is implemented in?
- When choosing an algorithm for a specific task, what is the most important factor to consider first?
- Which of the following operators is the assignment operator?
- A Java method isLeaf(TreeNode node) is intended to check if a given node is a leaf in a binary tree. class TreeNode { int val; TreeNode left, ...
- Which of the following operation is performed by Domain Name Server (DNS)?
- You are asked to implement a feature that requires storing unique items and quickly checking for the existence of an item. Which data structure would be th...
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
