Aspire Faculty ID #19040 · Topic: UGC NET Computer Science Dec 2019 (Paper II) · Just now
UGC NET Computer Science Dec 2019 (Paper II)

Given a CPU time slice of $2$ ms and the following list of processes.
Process Burst time $($ms$)$ Arrival time
$P1$ $3$ $0$
$P2$ $4$ $2$
$P3$ $5$ $5$
Find average turnaround time and average waiting time using round-robin CPU scheduling.

Solution

Time quantum $=2$ ms

Gantt chart:

$P1(0-2),\ P2(2-4),\ P1(4-5),\ P2(5-7),\ P3(7-9),\ P3(9-11),\ P3(11-12)$

Completion time:

$CT(P1)=5$

$CT(P2)=7$

$CT(P3)=12$

Turnaround time:

$TAT=CT-AT$

For $P1$:

$TAT=5-0=5$

For $P2$:

$TAT=7-2=5$

For $P3$:

$TAT=12-5=7$

Average turnaround time:

$\dfrac{5+5+7}{3}=\dfrac{17}{3}=5.66$

Waiting time:

$WT=TAT-BT$

For $P1$:

$WT=5-3=2$

For $P2$:

$WT=5-4=1$

For $P3$:

$WT=7-5=2$

Average waiting time:

$\dfrac{2+1+2}{3}=\dfrac{5}{3}=1.66$

Previous 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Nearest first
1
Which of the following interprocess communication model is used to exchange messages among co-operative processes?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
Suppose a system has $12$ magnetic tape drives and at the time $t_0$, three processes are allotted tape drives out of t…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
Consider a paging system where translation lookaside buffer $($TLB$)$, a special type of associative memory, is used wi…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
Which of the following is not needed by an encryption algorithm used in Cryptography?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
A counting semaphore is initialized to $8$. $3$ wait $()$ operations and $4$ signal $()$ operations are applied. Find t…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Find the minimum number of tables required for converting the following entity relationship diagram into a relational d…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
Given two tables $EMPLOYEE(EID,ENAME,DEPTNO)$ and $DEPARTMENT(DEPTNO,DEPTNAME)$. Find the most appropriate statement of…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ numbers of tuples respectively. Find the maximum number of …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
 Which of the component module of DBMS does rearrangement and possible ordering of operations, eliminate redundanc…
Topic: UGC NET Computer Science Dec 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Ascending by ID
1
Which of the following methods are used to pass any number of parameters to the operating system through system calls?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
Java Virtual Machine $($JVM$)$ is used to execute architectural neutral byte code. Which of the following is needed by …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
In a system for a restaurant, the main scenario for placing an order is given below: (a) Customer reads menu (b) Custom…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
An $...............$ chart is a project schedule representation that presents project plan as a directed graph. The cri…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
Let $a^{2c}\bmod n=(a^c)^2\bmod n$ and $a^{2c+1}\bmod n=a\cdot(a^c)^2\bmod n$. For $a=7,\ b=17$ and $n=561$, what is th…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
A clique in an undirected graph $G=\langle V,E\rangle$ is a subset $V'\subseteq V$ of vertices, such that
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsort…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n\le 2$. $T(n)=4T(\sqrt n)…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
Consider a weighted directed graph. The current shortest distance from source $S$ to node $x$ is represented by $d[x]$.…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...