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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Lists
Previous
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
Recent activity by admin
User admin
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User admin
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
5
answers
1
TIFR2015B8
Let $\sum_{1}= \left\{a\right\}$ be a one letter alphabet and $\sum_{2}= \left\{a, b\right\}$ be a two letter alphabet. A language over an alphabet is a set of finite length words comprising letters of the alphabet. Let $L_{1}$ and $L_{2}$ be the set ... countably infinite. $L_{1}$ is countable but $L_{2}$ is not. $L_{2}$ is countable but $L_{1}$ is not. Neither of them is countable.
answered
Jan 2, 2016
in
Theory of Computation

735
views
tifr2015
identifyclasslanguage
7
answers
2
TIFR2015B5
Suppose $\begin{pmatrix} 0&1 &0&0&0&1 \\ 1&0&1&0&0&0 \\ 0&1&0&1&0&1 \\ 0&0&1&0&1&0 \\ 0&0&0&1&0&1 \\ 1&0&1&0&1&0 \end{pmatrix}$ is the adjacency matrix of an ... below has the above adjacency matrix? Only $(i)$ Only $(ii)$ Only $(iii)$ Only $(iv)$ $(i)$ and $(ii)$
answered
Jan 2, 2016
in
Graph Theory

676
views
tifr2015
graphconnectivity
graphtheory
2
answers
3
TIFR2015B2
Consider the following undirected connected graph $G$ with weights on its edges as given in the figure below. A minimum spanning tree is a spanning tree of least weight and a maximum spanning tree is one with largest weight. A second best minimum ... spanning tree here. There is unique minimum spanning tree, however there is more than one secondbest minimum spanning tree here.
commented
Jan 2, 2016
in
Algorithms

529
views
tifr2015
spanningtree
algorithms
graphalgorithms
4
answers
4
TIFR2015A8
There is a set of $2n$ people: $n$ male and $n$ female. A good party is one with equal number of males and females (including the one where none are invited). The total number of good parties is. $2^{n}$ $n^{2}$ $\left(\frac{n}{n/2}\right)^{2}$ $\left(\frac{2n}{n}\right)$ None of the above.
commented
Jan 2, 2016
in
Combinatory

631
views
tifr2015
permutationsandcombinations
discretemathematics
normal
5
answers
5
TIFR2015A1
Consider a $6$sided die with all sides not necessarily equally likely such that probability of an even number is $P (\left \{2, 4, 6 \right \}) =\dfrac{1}{2}$, probability of a multiple of $3$ is $P (\left \{3, 6 \right \}) = 1/3$ and probability of $1$ is $P(\left \{ 1 \right ... \{5 \right \}) \leq \dfrac{1}{6}$ $P(\left \{ 5 \right \}) \leq \dfrac{1}{3}$ $\text{None of the above.}$
answered
Jan 2, 2016
in
Probability

484
views
tifr2015
probability
2
answers
6
C program
as i is initialized with 5 in main then how it becomes 0 please explain ? int main() { static int i=5; if(i) { main(); printf("%d ",i); } } op = 0000
commented
Nov 29, 2015
in
Programming

103
views
2
answers
7
C program
how it is compiler error int main() { extern int i; printf("%d ", i); { int i = 10; printf("%d ", i); } } (a) 0 10 (b) Compiler Error (c) 0 0 (d) 10 10 ans b
commented
Nov 29, 2015
in
Programming

100
views
3
answers
8
Calculating disk access time
A program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms. Page size is 4MB and track size is 32MB. If the pages of the program are contiguously placed on disk, then the total time required to load the program from disk in ms is _____ Given answer: 120
answered
Nov 29, 2015
in
Operating System

5.6k
views
operatingsystem
disks
3
answers
9
Identify the class of the language
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$ Identify the class of the language.
answered
Oct 24, 2015
in
Theory of Computation

224
views
theoryofcomputation
identifyclasslanguage
1
answer
10
Why is the overhead in paging equal to average overhead caused by page size which is P/2, P is the size of Page ?
commented
Oct 23, 2015
in
Operating System

149
views
operatingsystem
2
answers
11
TIFR2011B28
Consider a basic block: x:= a[i]; a[j]:= y; z:= a[j] optimized by removing common sub expression a[i] as follows: x:= a[i]; z:= x; a[j]:= y. Which of the following is true? Both are equivalent. The values computed by both ... give exactly the same values only if $i$ is not equal to $j$. They will be equivalent in concurrent programming languages with shared memory. None of the above.
answered
Oct 23, 2015
in
Operating System

371
views
tifr2011
processsynchronization
operatingsystem
normal
1
answer
12
Probability
We are given a set $X = \left \{x_1, x_2, \ldots , x_n \right \}$ where $x_i = 2i$. A sample $S$ (which is a subset of $X$) is drawn by selecting each $x_i$ independently with probability $P_i = \frac 12$. The expected value of the smallest number in sample $S$ is: a) $1/n$ b) $2$ c) $\sqrt n$ d) $n$
asked
Oct 23, 2015
in
Numerical Ability

103
views
probability
expectation
3
answers
13
What are the complement pairs for the following lattice?
commented
Oct 22, 2015
in
Set Theory & Algebra

1.6k
views
settheory&algebra
lattice
5
answers
14
ISRO20157
If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be 0,17 16,1 1,16 8,8
commented
Oct 21, 2015
in
Digital Logic

4.7k
views
isro2015
digitallogic
adder
halfadder
3
answers
15
Can masters theorem solve the recurrence 4T(n/2) + (n^2).logn ?
commented
Oct 20, 2015
in
Algorithms

4.3k
views
algorithms
recurrence
1
answer
16
Determine the type of functional dependency
asked
Oct 20, 2015
in
Databases

241
views
functionaldependencies
1
answer
17
evaluation of prefix expression takes O(n^2)....true?
asked
Oct 20, 2015
in
Algorithms

416
views
stack
3
answers
18
TIFR2011B29
You are given ten rings numbered from $1$ to $10$, and three pegs labeled $A$, $B$, and $C$. Initially all the rings are on peg $A$, arranged from top to bottom in ascending order of their numbers. The goal is to move all the rings to peg $B$ in ... ring be placed on top of another ring with a lower number. How many moves are required? $501$ $1023$ $2011$ $10079$ None of the above.
commented
Oct 20, 2015
in
Algorithms

469
views
tifr2011
algorithms
algorithmdesign
4
answers
19
BCNF and 3NF
1) dependency preservation 2)lossless join a)If a relation is in 3NF , which of the above points is guaranteed. b)If a relation is in BCNF , which of the above points is guaranteed [ I am confused right now, can I say , if a relation ... using a particular algorithm, then only I can say that the decomposed relations is lossless/dependency preserving same goes for 3NF]. Please help!
asked
Oct 20, 2015
in
Databases

2.5k
views
databases
databasenormalization
1
answer
20
Modulus operator in C
How C will behave with negative operands with modulus operator?
answered
Oct 20, 2015
in
Programming

373
views
programminginc
2
answers
21
How to approach this question on boundedbuffer ?
answered
Oct 20, 2015
in
Operating System

192
views
processsynchronization
semaphore
3
answers
22
if natural join is done then min and max no. of tuples if referential integrity is taken and not
answered
Oct 19, 2015
in
Databases

888
views
naturaljoin
referentialintegrity
2
answers
23
No. of MUX, NAND and NOR
answered
Oct 19, 2015
in
Digital Logic

359
views
1
answer
24
Is array implementation better or the min heap in case of Prims algorithm
asked
Oct 18, 2015
in
Algorithms

252
views
minimumspanningtrees
primsalgorithm
2
answers
25
Consider table R(A,B,C,D,E) with FDs
Consider table R(A,B,C,D,E) with FDs as A>B, BC>E and ED> A. The table is in which normal form? Justify your answer.
answered
Oct 17, 2015
in
Databases

3.7k
views
databases
databasenormalization
normal
2
answers
26
ISRO20154
A modulus 12 ring counter requires a minimum of 10 flipflops 12 flipflops 8 flipflops 6 flipflops
commented
Oct 17, 2015
in
Digital Logic

4.4k
views
isro2015
digitallogic
digitalcounter
10
answers
27
ISRO201530
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
answered
Oct 17, 2015
in
Operating System

7.3k
views
semaphore
isro2015
1
answer
28
disk scheduling
Consider a disk with the 100 tracks numbered from 0 to 99 rotating at 3000 rpm. The number of sectors per track is 100 and the time to move the head between two successive tracks is 0.2 millisecond. Consider a set of disk requests to read data from tracks ... Latency)= 100(.2 +10)=1020ms$ IS this the correct way of solving this problem or am I missing something? Please help
commented
Oct 17, 2015
in
Operating System

433
views
1
answer
29
System call
main( ) { if (fork( ) == 0) { /* Child */ while (1) { for (i=0; i
answered
Oct 17, 2015
in
Operating System

126
views
operatingsystem
1
answer
30
How is escape sequence tokenised in c compiler.
commented
Oct 17, 2015
in
Programming

244
views
compilertokenization
4
answers
31
GATE20011.6
Given an arbitrary nondeterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least $N^2$ $2^N$ $2N$ $N!$
answered
Oct 16, 2015
in
Theory of Computation

3.1k
views
gate2001
finiteautomata
theoryofcomputation
easy
4
answers
32
GATE20012.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
answered
Oct 16, 2015
in
Theory of Computation

4.6k
views
gate2001
theoryofcomputation
finiteautomata
4
answers
33
GATE199204c
Design a 3bit counter using Dflip flops such that not more than one flipflop changes state between any two consecutive states.
answered
Oct 16, 2015
in
Digital Logic

650
views
gate1994
digitallogic
flipflop
1
answer
34
seek time
the seek time of a disk is 30ms.it rotates at the rate of 30 rotations/second.the capacity of each track is 300 words.the access time is (approximately) guys can any one solve this plzzzz...
answered
Oct 16, 2015
in
CO & Architecture

1.9k
views
disks
2
answers
35
How many subgraphs with at least one vertex does K3 have?
commented
Oct 15, 2015
in
Graph Theory

2.7k
views
graphtheory
4
answers
36
GATE200645
Two computers $C1$ and $C2$ are configured as follows. $C1$ has IP address $203.197.2.53$ and netmask $255.255.128.0$. $C2$ has IP address $203.197.75.201$ and netmask $255.255.192.0$. Which one of the following statements is true? $C1$ and $C2$ both ... $C2$ is on same network, but $C2$ assumes $C1$ is on a different network $C1$ and $C2$ both assume they are on different networks.
commented
Oct 14, 2015
in
Computer Networks

2.6k
views
gate2006
computernetworks
subnetting
normal
7
answers
37
ISRO20087
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
answered
Oct 14, 2015
in
Theory of Computation

2.5k
views
isro2008
theoryofcomputation
contextfreelanguage
grammar
2
answers
38
How many process are created by the program?
commented
Oct 13, 2015
in
Operating System

1.6k
views
operatingsystem
fork
2
answers
39
OS Synchronization
Consider the following program: Const int n= 10 int Count= 0 Void A( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin A( ); A( ); A( ); A( ); Par end } 5 What is the minimum and maximum possible value of count after the completion of the program? (a) 1, 40 (b) 2, 40 (c) 3, 40 (d) 4, 40
answered
Oct 11, 2015
in
Operating System

1.1k
views
os
processsynchronization
operatingsystem
3
answers
40
T.C of T(n)=2T(n1)+n,n >1 ,T(1)=1 ?
T.C of T(n)=2T(n1)+n,n > 1 ,T(1)=1 ?
commented
Oct 10, 2015
in
Algorithms

2.6k
views
timecomplexity
40,965
questions
47,599
answers
146,679
comments
62,337
users