Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Nit9
5
answers
1
GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...
13.8k
views
commented
Jan 9, 2018
Operating System
gateit-2005
operating-system
disk
normal
+
–
6
answers
2
GATE IT 2004 | Question: 51
The storage area of a disk has the innermost diameter of $10$ cm and outermost diameter of $20$ cm. The maximum storage density of the disk is $1400$ bits/cm. The disk rotates at a speed of $4200$ RPM. The main memory of a computer has $64$-bit word length ... from the disk, the percentage of memory cycles stolen for transferring one word is $0.5 \%$ $1 \%$ $5\%$ $10\%$
The storage area of a disk has the innermost diameter of $10$ cm and outermost diameter of $20$ cm. The maximum storage density of the disk is $1400$ bits/cm. The disk ro...
22.3k
views
commented
Jan 9, 2018
CO and Architecture
gateit-2004
co-and-architecture
dma
normal
+
–
2
answers
3
GATE CSE 2009 | Question: 10
The essential content(s) in each entry of a page table is / are Virtual page number Page frame number Both virtual page number and page frame number Access right information
The essential content(s) in each entry of a page table is / areVirtual page numberPage frame numberBoth virtual page number and page frame numberAccess right information
11.7k
views
comment reshown
Jan 8, 2018
Operating System
gatecse-2009
operating-system
virtual-memory
easy
+
–
5
answers
4
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore ini...
13.4k
views
commented
Jan 8, 2018
Operating System
gateit-2006
operating-system
process-synchronization
normal
+
–
5
answers
5
GATE CSE 2007 | Question: 72
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ are the general purpose registers.$$\small \begin{array}{|c|l|l||c|} \hline & \text {Instruct...
9.4k
views
commented
Jan 6, 2018
CO and Architecture
gatecse-2007
co-and-architecture
machine-instruction
interrupts
normal
+
–
1
answer
6
SQL QUERY
what is the meaning of following query: select R.* from R,S where R.a = S.a and is unique R;
what is the meaning of following query:select R.* from R,S where R.a = S.a and is unique R;
535
views
answered
Dec 15, 2017
Databases
sql
databases
+
–
5
answers
7
GATE IT 2008 | Question: 42
The two numbers given below are multiplied using the Booth's algorithm. Multiplicand : $0101$ $1010$ $1110$ $1110$ Multiplier: $0111$ $0111$ $1011$ $1101$ How many additions/Subtractions are required for the multiplication of the above two numbers? $6$ $8$ $10$ $12$
The two numbers given below are multiplied using the Booth's algorithm.Multiplicand : $0101$ $1010$ $1110$ $1110$Multiplier: ...
21.8k
views
commented
Dec 8, 2017
Digital Logic
gateit-2008
digital-logic
booths-algorithm
normal
+
–
8
answers
8
GATE CSE 2006 | Question: 69
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts ... faster than Plan 2 for all databases For $x = 9000,$ Plan I executes slower than Plan 2 for all databases
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...
15.2k
views
commented
Dec 8, 2017
Databases
gatecse-2006
databases
sql
normal
+
–
7
answers
9
GATE CSE 2006 | Question: 68
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. ... strictly fewer rows than Query$2$ There exist databases for which Query$4$ will encounter an integrity violation at runtime
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...
20.4k
views
commented
Dec 8, 2017
Databases
gatecse-2006
databases
sql
normal
+
–
3
answers
10
GATE IT 2007 | Question: 17
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute $b^n \bmod{m}, 0 \leq b, n \leq m$ ? $O(\log n)$ $O(\sqrt n)$ $O\Biggl (\frac{n}{\log n} \Biggr )$ $O(n)$
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications require...
8.8k
views
commented
Dec 7, 2017
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
0
answers
11
toc decidability
CS4820 Spring 2013 Notes on Turing Machines 19/26 (e) ever moves its head more than 481 tape cells away from the left endmarker on input ε ? (f) accepts the null string ε ? (g) accepts any string at all?(h) accepts every string?(i) accepts a finite set?(j) accepts a recursive set? (k) is equivalent to a Turing machine with a shorter description???
CS4820 Spring 2013 Notes on Turing Machines 19/26(e) ever moves its head more than 481 tape cells away from the left endmarker on input ε ? (f) accepts the null string �...
205
views
edited
Dec 2, 2017
5
answers
12
GATE IT 2007 | Question: 66
Consider the following two transactions$: T1$ and $T2.$ ...
Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...
18.0k
views
comment edited
Nov 25, 2017
Databases
gateit-2007
databases
transaction-and-concurrency
normal
+
–
3
answers
13
GATE CSE 2007 | Question: 4
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has 9 edges and 5 vertices 9 edges and 6 vertices 10 edges and 5 vertices 10 edges and 6 vertices
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
10.2k
views
commented
Nov 18, 2017
Graph Theory
gatecse-2007
graph-theory
normal
out-of-syllabus-now
+
–
6
answers
14
GATE CSE 1995 | Question: 2.14
A bag contains $10$ white balls and $15$ black balls. Two balls are drawn in succession. The probability that one of them is black and the other is white is: $\frac{2}{3}$ $\frac{4}{5}$ $\frac{1}{2}$ $\frac{1}{3}$
A bag contains $10$ white balls and $15$ black balls. Two balls are drawn in succession. The probability that one of them is black and the other is white is:$\frac{2}{3}$...
8.5k
views
comment edited
Nov 9, 2017
Probability
gate1995
probability
normal
+
–
5
answers
15
ISRO2017-15
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
4.9k
views
commented
Oct 31, 2017
Algorithms
isro2017
algorithms
sorting
+
–
2
answers
16
Solve using Recursion Tree method when both parts are unequal
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
1.7k
views
commented
Oct 28, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
10
answers
17
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
17.5k
views
commented
Oct 27, 2017
Algorithms
gate1992
spanning-tree
algorithms
time-complexity
easy
fill-in-the-blanks
+
–
3
answers
18
GATE CSE 1999 | Question: 2.24
Consider the following $C$ function definition int Trial (int a, int b, int c) { if ((a>=b) && (c<b)) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, a, c); } The functional Trial: Finds the maximum of $a$, $b$, and $c$ Finds the minimum of $a$, $b$, and $c$ Finds the middle number of $a$, $b$, $c$ None of the above
Consider the following $C$ function definitionint Trial (int a, int b, int c) { if ((a>=b) && (c<b)) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, ...
11.2k
views
commented
Oct 7, 2017
Algorithms
gate1999
algorithms
identify-function
normal
+
–
1
answer
19
GATE CSE 1999 | Question: 1.6
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true? $L_1 = L_2$ $L_1 \supset L_2$ $L_1 \subset L_2$ None
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true?$L_1 = L...
22.0k
views
commented
Oct 6, 2017
Theory of Computation
normal
theory-of-computation
gate1999
pushdown-automata
+
–
6
answers
20
GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
17.6k
views
commented
Sep 30, 2017
Digital Logic
gatecse-2009
digital-logic
memory-interfacing
easy
isro2015
+
–
2
answers
21
GATE IT 2007 | Question: 48
Consider the grammar given below: $S \rightarrow x \ B \mid y \ A$ $A \rightarrow x \mid x \ S \mid y \ A \ A$ $B \rightarrow y \mid y \ S \mid x \ B \ B$ Consider the following strings. $xxyyx$ $xxyyxy$ $xyxy$ $yxxy$ $yxx$ $xyx$ Which of the above strings are generated by the grammar ? i, ii and iii ii, v and vi ii, iii and iv i, iii and iv
Consider the grammar given below:$S \rightarrow x \ B \mid y \ A$$A \rightarrow x \mid x \ S \mid y \ A \ A$$B \rightarrow y \mid y \ S \mid...
7.5k
views
commented
Sep 27, 2017
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
3
answers
22
GATE CSE 2005 | Question: 12, ISRO2009-64
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is : $f(b-a)$ $f(b) - f(a)$ $\int\limits_a^b f(x) dx$ $\int\limits_a^b xf (x)dx$
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is :$f(b-a)$$f(b) - f(a)$$\int\limits_a^b f(x) dx...
11.6k
views
commented
Sep 24, 2017
Probability
gatecse-2005
probability
random-variable
easy
isro2009
+
–
4
answers
23
GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...
24.1k
views
commented
Sep 23, 2017
Theory of Computation
theory-of-computation
turing-machine
gatecse-2003
difficult
+
–
1
answer
24
Test by Bikram | Mock GATE | Test 1 | Question: 42
Find the missing statement in the if loop of $Floyd$ algorithm. Procedure Floyd: (var A: array[1...n,1...n] of real; C: array [1...n,1...n] of real); Var i, j, k: integer; begin M for i:=l to n do for j:=l to n do A[i,j]: =C[i,j] for i:=l to n do A[i,j ]:=0 ; ... $A[i,j]: = A[i, j] + A[k,j]$ $A[i,j]: = A[j,k]+ A[j,i]$ $A[i,j]: =A[i,k] + A[i,j]$
Find the missing statement in the if loop of $Floyd$ algorithm.Procedure Floyd: (var A: array[1...n,1...n] of real; C: array [1...n,1...n] of real); Var i, j, k: integer;...
547
views
commented
Feb 11, 2017
GATE
tbb-mockgate-1
algorithms
graph-algorithms
shortest-path
+
–
3
answers
25
Semaphor-Blocked processes
Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. The number of blocked processes at the end are _________. 4 P, 6 V, 9 P, 13 V, 14 P Answer given is 13 How? I am getting 8.
Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed....
6.2k
views
commented
Feb 6, 2017
Operating System
operating-system
+
–
3
answers
26
Test by Bikram | Mock GATE | Test 1 | Question: 6
What is the output of the following program? main( ) { int i=4, z=12; if( i=5 || z > 50) printf(“ Gate2017”); else printf(“ Gateoverflow”); } Gate2017 Gateoverflow syntax error Gate2017Gateoverflow
What is the output of the following program?main( ){int i=4, z=12;if( i=5 || z 50)printf(“ Gate2017”);elseprintf(“ Gateoverflow”);}Gate2017Gateoverflowsyntax err...
1.0k
views
commented
Feb 6, 2017
GATE
tbb-mockgate-1
programming
programming-in-c
+
–
2
answers
27
Test by Bikram | Mock GATE | Test 1 | Question: 8
Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$ ... The given schedule is A serializable schedule A non-serializable schedule A dead lock situation Both non-serializable and deadlock schedule
Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$$$\begin{array}{|c|c|c|} \hline \bf{T_1} & \bf{T_2} \\ \hli...
1.3k
views
commented
Feb 6, 2017
Databases
tbb-mockgate-1
transaction-and-concurrency
databases
+
–
2
answers
28
Test by Bikram | Mock GATE | Test 1 | Question: 11
Consider following recursive functions: function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) end The above function is run on a computer with a stack of $x$ ... we can execute this function for maximum value $n = 10$ without overflowing the stack. Then the size of the stack is ______ $Bytes$.
Consider following recursive functions:function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) endThe above function is...
1.4k
views
commented
Feb 6, 2017
GATE
tbb-mockgate-1
numerical-answers
runtime-environment
compiler-design
+
–
3
answers
29
Test by Bikram | Mock GATE | Test 1 | Question: 24
The internet host is roughly doubling in size every $18$ $months$. Although no one really knows for sure, one estimate put the number of hosts on it at $7$ million in January $1996$. Using these data the expected number of internet hosts in January $2008$ is _____ billion.
The internet host is roughly doubling in size every $18$ $months$. Although no one really knows for sure, one estimate put the number of hosts on it at $7$ million in Jan...
858
views
comment edited
Feb 5, 2017
Probability
tbb-mockgate-1
numerical-answers
statistics
quantitative-aptitude
asymptotic-notation
+
–
2
answers
30
Test by Bikram | Mock GATE | Test 1 | Question: 16
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision? $0.123$ $0.145$ $0.800$ $0.750$
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...
886
views
comment edited
Feb 5, 2017
GATE
tbb-mockgate-1
data-structures
hashing
algorithms
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register