Register
Filter

Recent activity by darshan-at

1 answer
1
scheduling
9 answers
2
GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
2 answers
3
GATE CSE 2018 | Question: 6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true?$k \geq 2^n...
6 answers
4
GATE CSE 2012 | Question: 31
Consider the $3$ processes, $P1, P2$ and $P3$ ... $P1, P3, P2$ FCFS: $P1, P2, P3$ RR2: $P1, P3, P2$ FCFS: $P1, P3, P2$ RR2: $P1, P2, P3$
Consider the $3$ processes, $P1, P2$ and $P3$ shown in the table. $$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time} & \textbf{Time Units Req...
2 answers
5
ISRO2018-66
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input? Mege Sort Insertion Sort Selection Sort Quick Sort
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?Mege SortInsertion SortSelection SortQuick Sort...
0 answers
9
Persistent CSMA
1 answer
11
madeeasy os
why c) option wrong?
why c) option wrong?
1 answer
14
self doubt
Main memory=512 words. block size=8 words. cache size =32 words There is an array A[100] and each element is 4 words then what is the hit ratio for the following loop. for(i=0;i<=9;i++) { for(j=0;j<=9;j=j+2) { A[i][j]=A[i][j]+20; } }
Main memory=512 words.block size=8 words.cache size =32 wordsThere is an array A[100] and each element is 4 words then what is the hit ratio for the following loop.for...