GATE CSE
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
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.
Answers by rahul sharma 5
User rahul sharma 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rahul sharma 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Data Structure stackmax
How it is 24? I'm not getting it.
answered
1 day
ago
in
DS

390
views
madeeasytestseries
datastructure
stack
badquestion
0
votes
2
GATE1998_6b
Consider the grammar S $\rightarrow Aa \mid b$ A $\rightarrow Ac \mid Sd \mid \epsilon$ Construct an equivalent grammar with no left recursion and with minimum number of production rules.
answered
4 days
ago
in
Compiler Design

416
views
gate1998
compilerdesign
grammar
descriptive
+1
vote
3
Theory of Computation  Find contextfree grammars for the following language
answered
5 days
ago
in
Theory of Computation

25
views
theoryofcomputation
finiteautomata
contextfreelanguage
+1
vote
4
GATE19992.5
Given the programming constructs (i) assignment (ii) for loops where the loop parameter cannot be changed within the loop (iii) ifthenelse (iv) forward go to (v) arbitrary go to (vi) nonrecursive procedure call (vii) recursive procedure/function call (viii) repeat loop, which ... ), (iii), (iv) (v), (vii), (viii) (vi), (vii), (viii) (iii), (vii), (viii)
answered
Oct 5
in
Programming

481
views
gate1999
programming
normal
programmingconstructs
0
votes
5
GATE199209
Suggest a data structure for representing a subset $S$ of integers from $1$ to $n$. Following operations on the set $S$ are to be performed in constant time (independent of cardinality of $S$). (i). MEMBER (X): ... like language. You may assume that the data structure has been suitable initialized. Clearly state your assumptions regarding initialization.
answered
Oct 4
in
DS

316
views
gate1992
datastructure
normal
descriptive
queues
0
votes
6
combinatorics
que in how many way can 7 girl are seated at a round table so that 2 particular girl are seprated ???
answered
Oct 3
in
Combinatory

62
views
permutationsandcombinations
discretemathematics
general
+1
vote
7
GATE2016241
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: [v] in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... left(n^{2}\right)$ $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$
answered
Sep 29
in
Algorithms

2.1k
views
gate20162
algorithms
graphalgorithms
normal
0
votes
8
GATE2007IT24
A depthfirst search is performed on a directed acyclic graph. Let d[u] denote the time at which vertex u is visited for the first time and f[u] the time at which the dfs call to the vertex u terminates. Which of the following statements is always true for all edges (u, v) in the graph ? d[u] < d[v] d[u] < f[v] f[u] < f[v] f[u] > f[v]
answered
Sep 29
in
Algorithms

997
views
gate2007it
algorithms
graphalgorithms
normal
0
votes
9
GATE200481
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected graph, then the graph $G_1\cup G_2=(V,E_1\cup E_2)$ cannot have a cut vertex must have a cycle must have a cutedge (bridge) Has chromatic number strictly greater than those of $G_1$ and $G_2$
answered
Sep 29
in
Algorithms

1.2k
views
gate2004
algorithms
graphalgorithms
normal
0
votes
10
GATE2014237
Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x +10y=$ ___.
answered
Sep 29
in
Algorithms

1.1k
views
gate20142
algorithms
normal
numericalanswers
dynamicprogramming
0
votes
11
GATE2016235
The following function computes $X^{Y}$ for positive integers $X$ and $Y$. int exp (int X, int Y) { int res =1, a = X, b = Y; while (b != 0) { if (b % 2 == 0) {a = a * a; b = b/2; } else {res = res * a; b = b  1; } } return res; } Which one of the following ... $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
answered
Sep 28
in
Programming

1.2k
views
gate20162
programming
loopinvariants
normal
0
votes
12
leaky bucket
Computer A has 19.5MB to be sent on a network and transmits the data in burst at 6mbps.The max transmission rate across routers in the network is 4mbps.If computer A's transmission is shaped using leaky bucket.Capacity that the queue in bucket must hold so that no data is discarded is ________________________________(in MB upto 1 decimal place)
answered
Sep 22
in
Computer Networks

47
views
+2
votes
13
Boolean Algebra Properties
answered
Sep 12
in
Digital Logic

41
views
digitallogic
+2
votes
14
Intro to Formal Languages and Automata Peter Linz Ex. #1.16
answered
Aug 31
in
Theory of Computation

49
views
theoryofcomputation
grammar
regularlanguages
peterlinz
0
votes
15
Test series
Consider the network given below : Each node in the graph represents the router. Each node maintains its routing table to send a packet to its destination with minimum cost. Initially routing table is empty. The table is filled as ... table F' after each node has twice reported the information it had in the proceeding steps in its immediate neighbours?
answered
Aug 29
in
Computer Networks

52
views
0
votes
16
regular and CFL language
Let A and B be two languages over alphabet ∑ . which of the following are true ? (more than one options may be correct) (a) if A is regular and B is CFL then A∩B is also CFL. (b) if A is regular and B is CFL then A∪B is also CFL. (c) if A ... and B is CFL then A∩B will not be a CFL. (d) if A is not CFL and B is CFL then A∪B will not be a CFL.
answered
Aug 28
in
Theory of Computation

129
views
theoryofcomputation
contextfreelanguage
regularlanguages
0
votes
17
Token Bucket
A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 4 Mbps. It is initially filled to capacity with 15 Megabits. How long can the computer transmit at the full 8 Mbps (in seconds) upto two decimal places? a. 3.75 sec b. 3.55 sec c. 4.20 sec d. 3.46 sec
answered
Aug 26
in
Computer Networks

104
views
tokenbucket
congestioncontrol
computernetworks
+1
vote
18
Propositional function doubt
The Number of nvariable propositional function ? a. 2^2^n. b.2^n^2 c.2^n d. n^2 Can any one please explain the what should be the answer and how to get it?
answered
Aug 19
in
Mathematical Logic

29
views
+1
vote
19
Consider the following graph L and find the bridges, if any
answered
Aug 18
in
DS

181
views
graph
bridges
+2
votes
20
Recursive and Recursively Enumerable
answered
Aug 18
in
Theory of Computation

45
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+2
votes
21
TOC Question
Consider any arbitrary DFA M of your choice and Let the language accepted by some DFA M be L. Let L1 be the language accepted by the DFA M1 obtained by changing the accepting state of M to a nonaccepting state and by changing the nonaccepting states of M to accepting states. Which of the following statements is true? L1={0,1}∗−L L1={0,1}∗ L1⊆L L1=L
answered
Aug 16
in
Theory of Computation

56
views
theoryofcomputation
but
finiteautomata
+1
vote
22
Closure
Contextfree grammar is closed over intersection true/false.
answered
Aug 16
in
CO & Architecture

24
views
theoryofcomputation
closureproperty
+1
vote
23
Peter Linz toc chapter 3 ex3.3 question 13b(page no 97)
answered
Aug 16
in
Theory of Computation

63
views
theoryofcomputation
regulargrammar
dfa
+3
votes
24
GATE2004IT85
onsider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability p = 0.2 in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the ... can support, if each host has to be provided a minimum through put of 0.16 frames per time slot? 1 2 3 4
answered
Aug 14
in
Computer Networks

1.6k
views
gate2004it
computernetworks
congestioncontrol
macprotocol
normal
+1
vote
25
Relational algebra gateforum sample questions
answered
Aug 14
in
Databases

159
views
relationalalgebra
databases
0
votes
26
Is following sql query valid?
Can a sql query be like this: SELECT name AS instructor from instructor; The attributes' name can be renamed to table name or not?
answered
Aug 14
in
Databases

89
views
sql
databases
0
votes
27
ERMODEL
I think there is one to one relation and participation from professor and course side is partial.
answered
Aug 14
in
Databases

63
views
erdiagram
+1
vote
28
Probability Gate EE 2016
Candidates were asked to come to an interview with 3 pens each. Black, blue, green and red were the permitted pen colours that the candidate could bring. The probability that a candidate comes with all 3 pens having the same colour is _________.
answered
Aug 14
in
Probability

231
views
probability
engineeringmathematics
0
votes
29
introduction to engineering mathematics volume 3 by h.k. dass
answered
Aug 13
in
Probability

129
views
+2
votes
30
doubt
All ambiguous grammars can be converted to unambiguous grammar or oonly some ambiguos grammar can be converted to unambiguous
answered
Aug 13
in
Theory of Computation

15
views
+1
vote
31
Relational algebra
Gateforum sample questions http://gateoverflow.in/?qa=blob&qa_blobid=6152944108530932179
answered
Aug 13
in
Databases

30
views
+3
votes
32
Prime attribute
Primary key cannot be NULL . But is there any constraint on prime attributes also? Can they be NULL?
answered
Aug 12
in
Databases

46
views
+2
votes
33
equivalence relation: rosen exercise question
answered
Aug 11
in
Mathematical Logic

39
views
kennethrosen
0
votes
34
TOC doubt
Intersection of two Recursive enumerable language or two recursive language or two CSL is undecidable then how it can be said that it is closed under intersection?? Thank You
answered
Aug 11
in
Theory of Computation

21
views
+1
vote
35
J P TREMBLAY R MANOHAR EXCERCISE12.11
answered
Aug 7
in
Mathematical Logic

94
views
+2
votes
36
GATE2008IT78
A CFG G is given with the following productions where S is the start symbol, A is a nonterminal and a and b are terminals. $$S → aS \mid A \\ A → aAb \mid bAa \mid \epsilon$$ Which of the following strings is generated by the grammar above? aabbaba aabaaba abababb aabbaab
answered
Aug 7
in
Theory of Computation

825
views
gate2008it
theoryofcomputation
normal
contextfreelanguage
+1
vote
37
TOC Question
Please refer this Question  here How in that Question  (0+1)*(0+1)(0+1)* = (0+1)(0+1)* = (0+1)*(0+1) = (0+1)+
answered
Aug 5
in
Theory of Computation

39
views
theoryofcomputation
finiteautomata
0
votes
38
GATE Exam
Can any any one tell me where I Can find the Previous year papers of GATE Exam. Recently I reached http://recruitmentresult.com/gateexam/ this website has provided best information but I am unable to download the papers.
answered
Aug 4
in
Interview Questions

40
views
gate
exam
syllabus
admission
0
votes
39
Conditional Probability
If the occurrence of some events are dependent on the occurrence of an event A then sum of all the joint probabilities in which the occurrence of event A is considered gives the a) Subjective probability of event A b) ... ) Conditional probability of event A d) Marginal Probability of event A e) Relative frequency of occurrence of event A
answered
Aug 1
in
Probability

99
views
engineeringmathematics
probability
conditionalprobability
Page:
1
2
next »
27,324
questions
35,176
answers
84,108
comments
33,279
users