The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Nit9
User Nit9
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Nit9
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE2005IT81b
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 of the ... data starting from the sector $4$ of the outermost track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
commented
Jan 9, 2018
in
Operating System

4k
views
gate2005it
operatingsystem
disks
normal
4
answers
2
GATE2004IT51
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 and ... transfer from the disk, the percentage of memory cycles stolen for transferring one word is $0.5 \%$ $1 \%$ $5\%$ $10\%$
commented
Jan 9, 2018
in
CO and Architecture

5.8k
views
gate2004it
coandarchitecture
dma
normal
2
answers
3
GATE200910
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
comment reshown
Jan 8, 2018
in
Operating System

2.8k
views
gate2009
operatingsystem
virtualmemory
easy
3
answers
4
GATE2006IT55
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$ ... and Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
commented
Jan 8, 2018
in
Operating System

3.6k
views
gate2006it
operatingsystem
processsynchronization
normal
5
answers
5
GATE200772
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... memory is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$
commented
Jan 6, 2018
in
CO and Architecture

2.7k
views
gate2007
coandarchitecture
machineinstructions
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;
answered
Dec 15, 2017
in
Databases

209
views
sql
databases
5
answers
7
GATE2008IT42
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$
commented
Dec 9, 2017
in
Digital Logic

4.6k
views
gate2008it
digitallogic
boothsalgorithm
normal
7
answers
8
GATE200669
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 6000, ... Plan 1 executes faster than Plan 2 for all databases For x = 9000, Plan I executes slower than Plan 2 for all databases
commented
Dec 8, 2017
in
Databases

3.8k
views
gate2006
databases
sql
normal
4
answers
9
GATE200668
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. ... for which Query3 returns strictly fewer rows than Query2 There exist databases for which Query4 will encounter an integrity violation at runtime
commented
Dec 8, 2017
in
Databases

5.7k
views
gate2006
databases
sql
normal
3
answers
10
GATE2007IT17
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)$
commented
Dec 7, 2017
in
Algorithms

3.1k
views
gate2007it
algorithms
timecomplexity
normal
1
answer
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 ﬁnite set?(j) accepts a recursive set? (k) is equivalent to a Turing machine with a shorter description???
answered
Dec 3, 2017
in
Theory of Computation

47
views
4
answers
12
GATE2007IT66
Consider the following two transactions : T1 and T2. T1 : read (A); T2 : read (B); read (B); read (A); if A = 0 then B ← B + 1; if B ≠ 0 then A ← A  1; write (B); write (A); Which of the following schemes, using shared and exclusive locks, satisfy the requirements for ... ← B + 1; then A ← A  1; write (B); write (A); unlock (A); unlock (A); unlock (B); unlock (B); commit; commit;
comment edited
Nov 26, 2017
in
Databases

4.1k
views
gate2007it
databases
transactions
normal
3
answers
13
GATE20074
Let $G$ be the nonplanar 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
commented
Nov 18, 2017
in
Graph Theory

3k
views
gate2007
graphtheory
normal
outofsyllabusnow
3
answers
14
GATE19952.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}$
comment edited
Nov 9, 2017
in
Probability

2.9k
views
gate1995
probability
normal
6
answers
15
ISRO201715
Which one of the following inplace sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
commented
Nov 1, 2017
in
Algorithms

2.6k
views
isro2017
algorithms
sorting
1
answer
16
Solve using Recursion Tree method when both parts are unequal
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
commented
Oct 29, 2017
in
Algorithms

706
views
algorithms
timecomplexity
asymptoticnotations
recurrence
6
answers
17
GATE199201,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 _______
commented
Oct 28, 2017
in
Algorithms

4.7k
views
gate1992
spanningtree
algorithms
timecomplexity
easy
3
answers
18
GATE19992.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
commented
Oct 7, 2017
in
Algorithms

3.2k
views
gate1999
algorithms
identifyfunction
normal
1
answer
19
GATE19991.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
commented
Oct 6, 2017
in
Theory of Computation

5k
views
normal
theoryofcomputation
gate1999
pushdownautomata
4
answers
20
GATE20097, ISRO20153
How many 32K $\times$ 1 RAM chips are needed to provide a memory capacity of 256Kbytes? 8 32 64 128
commented
Sep 30, 2017
in
Digital Logic

6.2k
views
gate2009
digitallogic
memoryinterfacing
easy
outofsyllabusnow
isro2015
1
answer
21
GATE2007IT48
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
commented
Sep 27, 2017
in
Theory of Computation

1.7k
views
gate2007it
theoryofcomputation
contextfreelanguages
normal
2
answers
22
GATE200512, ISRO200964
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is : $f(ba)$ $f(b)  f(a)$ $\int\limits_a^b f(x) dx$ $\int\limits_a^b xf (x)dx$
commented
Sep 24, 2017
in
Probability

2.7k
views
gate2005
probability
randomvariable
easy
isro2009
3
answers
23
GATE200354
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 triplet, whose first component ... $L'$ is not $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
commented
Sep 24, 2017
in
Theory of Computation

7.6k
views
theoryofcomputation
turingmachine
gate2003
difficult
3
answers
24
SemaphorBlocked 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.
commented
Feb 6, 2017
in
Operating System

653
views
operatingsystem
2
answers
25
Memory Management
Reply with solution as soon as possible...
commented
Feb 4, 2017
in
Operating System

162
views
1
answer
26
GATE2008IT26
Consider the field $C$ of complex numbers with addition and multiplication. Which of the following form(s) a subfield of $C$ with addition and multiplication? S1: the set of real numbers S2: $\{(a + ib) \mid a$ and $b$ are rational numbers$\}$ S3: $\{a + ib \mid (a^2 + b^2) \leq 1\}$ S4: $\{ia \mid a \text{ is real}\}$ only S1 S1 and S3 S2 and S3 S1 and S2
commented
Feb 4, 2017
in
Set Theory & Algebra

1.3k
views
gate2008it
settheory&algebra
normal
fields
nongate
4
answers
27
GATE201130
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... is always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$
commented
Feb 4, 2017
in
Mathematical Logic

3.8k
views
gate2011
mathematicallogic
normal
firstorderlogic
6
answers
28
GATE2016128
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$,satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
commented
Jan 31, 2017
in
Set Theory & Algebra

6.7k
views
gate20161
settheory&algebra
functions
normal
numericalanswers
3
answers
29
GATE2016254
For the $IEEE$ $802.11$ MAC protocol for wireless communication, which of the following statements is/are TRUE? At least three nonoverlapping channels are available for transmissions. The RTSCTS mechanism is used for collision detection. Unicast frames are ACKed. All I, II, and III I and III only II and III only II only
commented
Jan 31, 2017
in
Computer Networks

5.4k
views
gate20162
computernetworks
wifi
normal
11
answers
30
GATE2016250
A file system uses an inmemory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost of checking ... are in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
commented
Jan 31, 2017
in
CO and Architecture

5.2k
views
gate20162
coandarchitecture
cachememory
normal
numericalanswers
6
answers
31
GATE2005IT52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having all edges ... $G$ having all edges of maximum weight. Edge $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
comment edited
Jan 19, 2017
in
Algorithms

4.5k
views
gate2005it
algorithms
spanningtree
normal
9
answers
32
GATE200369
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... in a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$
commented
Jan 19, 2017
in
Algorithms

3.4k
views
gate2003
algorithms
normal
greedyalgorithm
6
answers
33
GATE200744
In the following C function, let $n \geq m$. int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? $\Theta(\log_2n)$ $\Omega(n)$ $\Theta(\log_2\log_2n)$ $\Theta(\sqrt{n})$
commented
Jan 18, 2017
in
Algorithms

6.8k
views
gate2007
algorithms
timecomplexity
normal
5
answers
34
GATE200681
A CPU has a $32$ $KB$ direct mapped cache with $128$ byteblock size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8bytes$ each. Consider the following two $C$ code segments, $P1$ and $P2$. $P1$: for (i=0; i<512; i++) { for (j=0; j< ... for $P2$ be $M2$. The value of the ratio $\frac{M_{1}}{M_{2}}$: $0$ $\frac{1}{16}$ $\frac{1}{8}$ $16$
commented
Jan 13, 2017
in
CO and Architecture

2.6k
views
coandarchitecture
cachememory
normal
gate2006
3
answers
35
GATE2014231
Consider the procedure below for the ProducerConsumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while(true) { semWait ... s when the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlockfree operation.
commented
Jan 8, 2017
in
Operating System

4k
views
gate20142
operatingsystem
processsynchronization
normal
10
answers
36
GATE200933
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using testandset instruction as follows: void enter_CS(X) { while(testandset(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location associated with ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only
commented
Jan 8, 2017
in
Operating System

7.6k
views
gate2009
operatingsystem
processsynchronization
normal
5
answers
37
GATE200661
The atomic fetchandset $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$. Consider the following implementation of $P$ and $V$ ... set, a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore
comment edited
Jan 5, 2017
in
Operating System

8.7k
views
gate2006
operatingsystem
processsynchronization
normal
5
answers
38
GATE201153
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ ... $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
comment reshown
Jan 4, 2017
in
Computer Networks

6.1k
views
gate2011
computernetworks
routing
distancevectorrouting
normal
5
answers
39
GATE201054
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$
comment edited
Jan 4, 2017
in
Computer Networks

6.1k
views
gate2010
computernetworks
routing
distancevectorrouting
normal
1
answer
40
MadeEasy Test Series: Algorithms  P Np Npc Nph
Q. consider the following problem: a) Eulerian path b) 2 SAT c) Constraint reachibilty d)graph coloring number of problem which is polynomial solvable?? i am get only b (2SAT) somy answer is 1 but answer given 2 here also eulerian path ?? how to appraoch these type of question Plz explain??
answered
Dec 20, 2016
in
Theory of Computation

101
views
madeeasytestseries
algorithms
pnpnpcnph
50,737
questions
57,284
answers
198,181
comments
104,861
users