Register
Filter

Recent activity by endurance1

4 answers
2
GATE IT 2005 | Question: 9
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of the memory cycle time is used for refreshing? $10$ $6.4$ $1$ $0.64$
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of t...
2 answers
4
ACE Model Grand Test 2003 Operating System
The state of a process during context switching is 1. May be busy 2. May be idle 3. Always idle 4. always busy
The state of a process during context switching is 1. May be busy2. May be idle3. Always idle4. always busy
5 answers
6
ISRO2015-77
In $\text{X = (M + N }\times \text{O)/(P} \times \text{Q})$, how many one-address instructions are required to evaluate it? $4$ $6$ $8$ $10$
In $\text{X = (M + N }\times \text{O)/(P} \times \text{Q})$, how many one-address instructions are required to evaluate it?$4$$6$$8$$10$
9 answers
9
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_______________.
3 answers
10
GATE CSE 1995 | Question: 24
Prove that in finite graph, the number of vertices of odd degree is always even.
Prove that in finite graph, the number of vertices of odd degree is always even.
4 answers
11
GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
6 answers
14
GATE CSE 1995 | Question: 1.20
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is: $2$ $4$ $8$ None of the above
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is:$2$$4$$8$None of the above
4 answers
18
GATE IT 2004 | Question: 44
The function $A \bar B C + \bar A B C + AB \bar C+ \bar A \bar B C+ A \bar B \bar C$ is equivalent to $A \bar C + AB+ \bar A C$ $A \bar B+ A \bar C+ \bar A C$ $\bar A B+ A \bar C+ A \bar B$ $\bar AB+ AC+ A \bar B$
The function $A \bar B C + \bar A B C + AB \bar C+ \bar A \bar B C+ A \bar B \bar C$ is equivalent to$A \bar C + AB+ \bar A C$$A \bar B+ A \bar C+ \bar A C$$\bar A B+ A \...
2 answers
21
GATE CSE 2014 Set 3 | Question: 5
If $V_1$ and $V_2$ are $4$-dimensional subspaces of a $6$-dimensional vector space $V$, then the smallest possible dimension of $V_1 \cap V_2$ is _____.
If $V_1$ and $V_2$ are $4$-dimensional subspaces of a $6$-dimensional vector space $V$, then the smallest possible dimension of $V_1 \cap V_2$ is _____.
7 answers
23
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
A binary search tree is used to locate the number $43$. Which of the following probe sequences are possible and which are not? Explain.$\begin{array}{llllll} \text{(a)} ...
6 answers
24
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
An advantage of chained hash table (external hashing) over the open addressing scheme isWorst case complexity of search operations is lessSpace used is lessDeletion is ea...
8 answers
29
GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is:$2^n$$2^{n-1}$$2^n-1$$2^{n-2}$