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 Danish
User Danish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Danish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
6
answers
1
TIFR2010B32
Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem. process P1 is begin loop Non_critical_section; while not (Turn=1) do skip od; Critical_section_1; Turn=2; end loop end ∥ process P2 is begin loop Non_critical_section; ... (3), but does not satisfies the requirement (2). Satisfies all the requirement (1), (2), and (3).
answered
Nov 26, 2015
in
Operating System

991
views
tifr2010
operatingsystem
processsynchronization
1
answer
2
TIFR2010B40
Which of the following statement is FALSE? All recursive sets are recursively enumerable. The complement of every recursively enumerable sets is recursively enumerable. Every Nonempty recursively enumerable set is the range of some totally recursive function. All finite sets are recursive. The complement of every recursive set is recursive.
commented
Nov 26, 2015
in
Theory of Computation

832
views
tifr2010
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
8
answers
3
GATE2014112
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
answered
Aug 30, 2015
in
DS

5.9k
views
gate20141
datastructure
binarytree
numericalanswers
normal
4
answers
4
GATE2015153
Suppose that the stopandwait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.
commented
Jul 30, 2015
in
Computer Networks

8.3k
views
gate20151
computernetworks
stopandwait
normal
numericalanswers
3
answers
5
GATE2015151
Consider the NPDA ... is as follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
commented
Jul 29, 2015
in
Theory of Computation

7.2k
views
gate20151
theoryofcomputation
pushdownautomata
normal
3
answers
6
GATE2015155
The least number of temporary variables required to create a threeaddress code in static single assignment form for the expression $q + r / 3 + s  t * 5 + u * v/w$ is__________________.
commented
Jul 29, 2015
in
Compiler Design

8.9k
views
gate20151
compilerdesign
intermediatecode
normal
numericalanswers
2
answers
7
GATE19943.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
commented
Jul 1, 2015
in
Theory of Computation

3.1k
views
gate1994
theoryofcomputation
finiteautomata
normal
7
answers
8
GATE2015223
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
commented
Feb 15, 2015
in
Operating System

7.9k
views
gate20152
operatingsystem
resourceallocation
easy
4
answers
9
GATE2015244
Consider the sequence of machine instruction given below: ... uses operand forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
commented
Feb 13, 2015
in
CO and Architecture

8.8k
views
gate20152
coandarchitecture
pipelining
normal
numericalanswers
7
answers
10
GATE2015226
Let $f(x)=x^{\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the Xaxis, when $x$ varies from $1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[1, 1]$ $f$ is not bounded in $[1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
commented
Feb 13, 2015
in
Calculus

4.7k
views
gate20152
continuity
functions
normal
1
answer
11
GATE201524
A software requirements specification (SRS) document should avoid discussing which one of the following? User interface issues Nonfunctional requirements Design specification Interfaces with third party software
commented
Feb 12, 2015
in
IS&Software Engineering

889
views
gate20152
is&softwareengineering
normal
nongate
3
answers
12
GATE201526
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.
commented
Feb 12, 2015
in
Databases

3.5k
views
gate20152
databases
btree
normal
numericalanswers
1
answer
13
GATE200630
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s$ (e.g. $d (101) = 5$ ). Let $L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod } 7\neq 4 \right \}$ Which one of the following statements is true? $L$ is recursively enumerable, but not recursive $L$ is recursive, but not contextfree $L$ is contextfree, but not regular $L$ is regular
commented
Feb 5, 2015
in
Theory of Computation

1.8k
views
gate2006
theoryofcomputation
normal
identifyclasslanguage
6
answers
14
GATE201345
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... taken during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
commented
Jan 25, 2015
in
CO and Architecture

13.6k
views
gate2013
normal
coandarchitecture
pipelining
2
answers
15
GATE2008IT68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only
answered
Jan 21, 2015
in
Computer Networks

3.7k
views
gate2008it
computernetworks
networkprotocols
normal
2
answers
16
GATE2006IT48
The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows $a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $h : 21$ A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code? $110111100111010$ $fdheg$ $ecgdf$ $dchfg$ $fehdg$
commented
Jan 20, 2015
in
Algorithms

2.9k
views
gate2006it
algorithms
greedyalgorithm
normal
5
answers
17
GATE2006IT12
In the workingset strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there are enough extra frames. It selects a process to suspend if the sum of the sizes of the workingsets exceeds the total number of available frames. I only II only Neither I nor II Both I and II
answered
Jan 20, 2015
in
Operating System

2.6k
views
gate2006it
operatingsystem
processschedule
normal
2
answers
18
GATE200633
Let $L_1$ be a regular language, $L_2$ be a deterministic contextfree language and $L_3$ a recursively enumerable, but not recursive, language. Which one of the following statements is false? $L_1 \cap L_2$ is a deterministic CFL $L_3 \cap L_1$ is recursive $L_1 \cup L_2$ is context free $L_1 \cap L_2 \cap L_3$ is recursively enumerable
answered
Jan 19, 2015
in
Theory of Computation

3.7k
views
gate2006
theoryofcomputation
normal
identifyclasslanguage
3
answers
19
GATE201148
Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r) { if (n>0) return ((n%r) + foo(n/r, r)); else return 0; } What is the return value of the function $\text{foo}$ when it is called as $\text{foo(345, 10)}$? $345$ $12$ $5$ $3$
answered
Jan 18, 2015
in
Algorithms

1.6k
views
gate2011
algorithms
recursion
identifyfunction
normal
8
answers
20
GATE201154
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid ij\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. What ... minimum spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2  5 n)$ $n^2n+1$ $6n11$ $2n+1$
answered
Jan 18, 2015
in
Algorithms

5k
views
gate2011
algorithms
graphalgorithms
spanningtree
normal
2
answers
21
GATE2004IT61
Consider the following C program: #include <stdio.h> typedef struct { char *a; char *b; } t; void f1 (t s); void f2 (t *p); main() { static t s = {"A", "B"}; printf ("%s %s\n", s.a, s.b); f1(s); printf ("%s %s\n", s.a, s.b); f2(&s); } void f1 (t s) ... $A \ B$ $V \ W$ $A \ B$ $U \ V$ $U \ V$ $V \ W$ $A \ B$ $U \ V$ $V \ W$ $U \ V$
commented
Jan 17, 2015
in
Programming

3.1k
views
gate2004it
programming
programminginc
normal
8
answers
22
GATE200680
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 $8$bytes each. Consider the following two C code segments, $P1$ and $P2$. P1: for (i=0; i<512; i++) { for (j=0; j<512 ... by $P1$ be $M_{1}$and that for $P2$ be $M_{2}$. The value of $M_{1}$ is: $0$ $2048$ $16384$ $262144$
commented
Jan 17, 2015
in
CO and Architecture

4.5k
views
gate2006
coandarchitecture
cachememory
normal
3
answers
23
GATE200216
For relation R=(L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = (M, O). Is ... Is the above decomposition dependencypreserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?
commented
Jan 16, 2015
in
Databases

2.9k
views
gate2002
databases
databasenormalization
normal
descriptive
1
answer
24
GATE200666
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$
commented
Jan 15, 2015
in
Operating System

5k
views
gate2006
operatingsystem
resourceallocation
normal
5
answers
25
GATE201048
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2 \hspace{0.1cm} nanoseconds$, ... transfer? $2 \hspace{0.1cm} nanoseconds$ $20 \hspace{0.1cm} nanoseconds$ $22 \hspace{0.1cm}nanoseconds$ $88 \hspace{0.1cm} nanoseconds$
commented
Jan 15, 2015
in
CO and Architecture

11k
views
gate2010
coandarchitecture
cachememory
normal
barc2017
3
answers
26
GATE20018
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sectorwise. Once the head has been ... transfer? What is the maximum percentage of time the CPU is held up for this disk I/O for cyclestealing DMA transfer?
answer edited
Jan 15, 2015
in
Operating System

3.3k
views
gate2001
operatingsystem
disks
normal
descriptive
1
answer
27
GATE2007IT57
In a multiuser operating system on an average, $20$ requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The probability that either one, three or five requests are made in $45$ minutes is given by : $6.9 \times 10^6 \times e^{20}$ ... $6.9 \times 10^3 \times e^{20}$ $1.02 \times 10^3 \times e^{20}$
commented
Jan 12, 2015
in
Probability

2.6k
views
gate2007it
probability
poissondistribution
normal
3
answers
28
GATE2007IT44, ISRO201534
A hard disk system has the following parameters : Number of tracks $= 500$ Number of sectors/track $= 100$ Number of bytes /sector $= 500$ Time taken by the head to move from one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is the average time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$
commented
Jan 12, 2015
in
Operating System

8.2k
views
gate2007it
operatingsystem
disks
normal
isro2015
3
answers
29
GATE2008IT64
A $1$ $\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504$ $\text{km}$ and speed of the signal is 3 108 m/s. What should be the packet size for a channel utilization of $25$ ... are no errors during communication. $120$ $\text{bytes}$ $60$ $\text{bytes}$ $240$ $\text{bytes}$ $90$ $\text{bytes}$
answered
Jan 10, 2015
in
Computer Networks

8.2k
views
gate2008it
computernetworks
slidingwindow
normal
2
answers
30
GATE2008IT59
A software engineer is required to implement two sets of algorithms for a single set of matrix operations in an object oriented programming language; the two sets of algorithms are to provide precisions of 103 and 106, respectively. She decides to implement two ... from Low Precision Matrix. S4: One class should be derived from the other; the hierarchy is immaterial. S1 S2 S3 S4
commented
Jan 10, 2015
in
IS&Software Engineering

443
views
gate2008it
is&softwareengineering
normal
2
answers
31
GATE2008IT61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a lossless join, ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
commented
Jan 10, 2015
in
Databases

10.8k
views
gate2008it
databases
databasenormalization
normal
4
answers
32
GATE2008IT34
Consider a CFG with the following productions. $S \to AA \mid B$ $A \to 0A \mid A0 \mid 1$ $B \to 0B00 \mid 1$ $S$ is the start symbol, $A$ and $B$ ... $\{0, 1\}$ containing at least two $0$'s
commented
Jan 9, 2015
in
Theory of Computation

2.2k
views
gate2008it
theoryofcomputation
contextfreelanguage
normal
1
answer
33
GATE2008IT33
Consider the following languages. $L_1 = \{a^i b^j c^k \mid i = j, k \geq 1\}$ $L_2 = \{a^i b^j \mid j = 2i, i \geq 0\}$ Which of the following is true? $L_1$ is not a CFL but $L_2$ is $L_1 \cap L_2 = \varnothing $ and $L_1$ is nonregular $L_1 \cup L_2$ is not a CFL but $L_2$ is There is a $4$state PDA that accepts $L_1$, but there is no DPDA that accepts $L_2$.
answered
Jan 9, 2015
in
Theory of Computation

1.3k
views
gate2008it
theoryofcomputation
normal
identifyclasslanguage
9
answers
34
GATE2006IT69
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no applications listening at the corresponding ports on $Y$ and $Z$. An $ICMP$ Port Unreachable error will be generated by $Y$ but not $Z$ $Z$ but not $Y$ Neither $Y$ nor $Z$ Both $Y$ and $Z$
commented
Jan 9, 2015
in
Computer Networks

4.4k
views
gate2006it
computernetworks
tcp
udp
normal
3
answers
35
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, 2015
in
Operating System

3.3k
views
gate2006it
operatingsystem
processsynchronization
normal
6
answers
36
GATE20067
Consider the following grammar $S \rightarrow S * E$ $S \rightarrow E$ $E \rightarrow F + E$ $E \rightarrow F$ $F \rightarrow id$ Consider the following LR(0) items corresponding to the grammar above $S \rightarrow S *.E$ $E \rightarrow F. + E$ ... them will appear in the same set in the canonical setsofitems for the grammar? i and ii ii and iii i and iii None of the above
answered
Jan 3, 2015
in
Compiler Design

2.7k
views
gate2006
compilerdesign
parsing
normal
8
answers
37
GATE201041
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in nondeterministic finite automation that accepts $L$? $n1$ $n$ $n+1$ $2^{n1}$
commented
Jan 2, 2015
in
Theory of Computation

4.6k
views
gate2010
theoryofcomputation
finiteautomata
normal
minimalstateautomata
5
answers
38
GATE201046
A system has $n$ resources $R_0, \dots,R_{n1}$, and $k$ processes $P_0, \dots, P_{k1}$. The implementation of the resource request logic of each process $P_i$ ... In which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
commented
Jan 1, 2015
in
Operating System

8.5k
views
gate2010
operatingsystem
resourceallocation
normal
7
answers
39
GATE201018
Consider a $B^+$tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any nonroot node? $1$ $2$ $3$ $4$
answered
Jan 1, 2015
in
Databases

6.3k
views
gate2010
databases
btree
easy
2
answers
40
GATE199713
Let $F$ be the set of onetoone functions from the set $\{1, 2, \dots, n\}$ to the set $\{1, 2,\dots, m\}$ where $m\geq n\geq1$. How many functions are members of $F$? How many functions $f$ in $F$ satisfy the property $f(i)=1$ for some $i, 1\leq i \leq n$? How many functions $f$ in $F$ satisfy the property $f(i)<f(j)$ for all $i,j \ \ 1\leq i \leq j \leq n$?
answered
Dec 26, 2014
in
Set Theory & Algebra

1.7k
views
gate1997
settheory&algebra
functions
normal
descriptive
50,666
questions
56,157
answers
193,767
comments
93,748
users