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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Answers 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
+4
votes
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

960
views
tifr2010
operatingsystem
processsynchronization
+17
votes
2
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.8k
views
gate20141
datastructure
binarytree
numericalanswers
normal
+14
votes
3
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.6k
views
gate2008it
computernetworks
networkprotocols
normal
+43
votes
4
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.5k
views
gate2006it
operatingsystem
processschedule
normal
+37
votes
5
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.6k
views
gate2006
theoryofcomputation
normal
identifyclasslanguage
+12
votes
6
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
0
votes
7
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

4.9k
views
gate2011
algorithms
graphalgorithms
spanningtree
normal
+68
votes
8
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

8k
views
gate2008it
computernetworks
slidingwindow
normal
+31
votes
9
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.2k
views
gate2008it
theoryofcomputation
normal
identifyclasslanguage
+2
votes
10
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.6k
views
gate2006
compilerdesign
parsing
normal
+35
votes
11
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.2k
views
gate2010
databases
btree
easy
–6
votes
12
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.6k
views
gate1997
settheory&algebra
functions
normal
descriptive
+27
votes
13
GATE199712
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value is hashed to a particular bucket is $\frac{1}{n}$. The hash table is initially empty and ... has occurred in any of the $K$ insertions? What is the probability that the first collision occurs at the $K^{th}$ insertion?
answered
Dec 26, 2014
in
DS

2.6k
views
gate1997
datastructure
hashing
probability
normal
–2
votes
14
GATE19979
Consider a graph whose vertices are points in the plane with integer coordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an integer. Two vertices $(x_1, y_1)$ and $(x_2, y_2)$ are ... ? Write only the answer without any explanations. What is the weight of a maximum weightspanning tree in this graph? Write only the answer without any explanations.
answered
Dec 26, 2014
in
Algorithms

1.8k
views
gate1997
algorithms
spanningtree
normal
+14
votes
15
GATE199711
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ are nonterminal symbols with $S$ being the ... $i, j, k, m$? Find the smallest string that has two parse trees.
answered
Dec 26, 2014
in
Compiler Design

1.1k
views
gate1997
compilerdesign
grammar
normal
theoryofcomputation
+26
votes
16
GATE199919
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $2^{16}$ bytes each. The virtual address space is divided into $8$ nonoverlapping equal size ... available in page table entry for storing the aging information for the page? Assume that the page size is $512$ bytes.
answered
Dec 22, 2014
in
Operating System

4k
views
gate1999
operatingsystem
virtualmemory
normal
+8
votes
17
GATE199913
An instruction pipeline consists of 4 stages  Fetch (F), Decode field (D), Execute (E) and Result Write (W). The 5 instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the table below No. of cycles needed ... $1$} & \text{$2$} \\\hline \end{array} Find the number of clock cycles needed to perform the $5$ instructions.
answered
Dec 22, 2014
in
CO and Architecture

1.8k
views
gate1999
coandarchitecture
pipelining
normal
+43
votes
18
GATE200385
Consider the following functional dependencies in a database. ... Age) is in second normal form but not in third normal form in third normal form but not in BCNF in BCNF in none of the above
answered
Dec 17, 2014
in
Databases

3.4k
views
gate2003
databases
databasenormalization
normal
+36
votes
19
GATE200320
Consider the following three claims: $(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants $2^{n+1} = O(2^n)$ $2^{2n+1} = O(2^n)$ Which of the following claims are correct? I and II I and III II and III I, II, and III
answered
Dec 17, 2014
in
Algorithms

3.2k
views
gate2003
algorithms
asymptoticnotations
normal
+54
votes
20
GATE20038, ISRO200953
Let $G$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $G$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k1$ and $k+1$ $k1$ and $n1$ $k+1$ and $nk$
answered
Dec 16, 2014
in
Graph Theory

4.2k
views
gate2003
graphtheory
graphconnectivity
normal
isro2009
+28
votes
21
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?
answered
Dec 16, 2014
in
Databases

2.8k
views
gate2002
databases
databasenormalization
normal
descriptive
+1
vote
22
GATE20029
Consider the following $32bit$ floatingpoint representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ for negative values), a $24 bit$ fraction field (with the ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.
answered
Dec 16, 2014
in
Digital Logic

3.1k
views
gate2002
digitallogic
numberrepresentation
normal
descriptive
0
votes
23
GATE20002.22
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average memory access time of $1.9999$ milliseconds $1$ millisecond $9.999$ microseconds $1.9999$ microseconds
answered
Dec 14, 2014
in
Operating System

4.8k
views
gate2000
operatingsystem
easy
virtualmemory
–4
votes
24
GATE20001.8
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a nonpipelined but identical CPU, we can say that T1 ≤ T2 T1 ≥ T2 T1 < T2 T1 and T2 plus the time taken for one instruction fetch cycle
answered
Dec 14, 2014
in
CO and Architecture

3.1k
views
gate2000
pipelining
coandarchitecture
easy
+10
votes
25
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?
answered
Dec 14, 2014
in
Operating System

3.2k
views
gate2001
operatingsystem
disks
normal
descriptive
50,288
questions
55,719
answers
192,113
comments
90,124
users