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 2018
User 2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User 2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
theory of computation
Eliminate all Null productions from S $\rightarrow$ AaB  aaB, A $\rightarrow$ Null B $\rightarrow$ bbA Null.
answered
Apr 5
in
Theory of Computation

60
views
theoryofcomputation
grammar
+1
vote
2
theory of computation
I guess the Language , L = { } ...please verify ...
answered
Apr 5
in
Theory of Computation

46
views
theoryofcomputation
grammar
+3
votes
3
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
answered
Apr 5
in
Mathematical Logic

71
views
engineeringmathematics
+1
vote
4
theory of computation
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
answered
Apr 5
in
Theory of Computation

53
views
theoryofcomputation
regularexpressions
contextfreelanguage
0
votes
5
#hpsc asst professor
A set of techniques that allow to execute a program which is not entirely in memory is? ademand paging bvirtual memory cauxilary memory dsecondary memory
answered
Apr 5
in
Operating System

82
views
0
votes
6
theory of computation
Let L = {anblak: n = l or l ≠ k}. The language is A) regular B) DCFL but not regular. C) NDCFL but not DCFL. D) context sensitive but not CFL. The Option is C) right ...??? Please verify ...
answered
Apr 4
in
Theory of Computation

42
views
theoryofcomputation
finiteautomata
+4
votes
7
theory of computation
L = {an: n is either prime or the product of two or more prime numbers}, This language is regular ...right ? Please verify ... The equivalent language is L = { an ; n >= 2 } ...right ?
answered
Apr 4
in
Theory of Computation

49
views
theoryofcomputation
finiteautomata
+2
votes
8
ISI 2004 MIII
answered
Apr 4
in
Combinatory

91
views
permutationsandcombinations
isi2004
+1
vote
9
ISI 2004 MIII
Q9 The equation' $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$ has A) exactly three solution in [0.1] B) exactly one solution in [0,1] C) exactly two solution in [0,1] D) no solution in [0,1]
answered
Apr 3
in
Set Theory & Algebra

27
views
isi2004
polynomials
+1
vote
10
ISI 2004 MIII
Q8 If $\alpha 1,\alpha 2,\alpha 3....\alpha n$ be the roots of $x^{n}+1=0$, then $\left ( 1\alpha 1 \right )*\left ( 1\alpha 2 \right )...\left ( 1\alpha n \right )$ is equal to A) 1 B) 0 C) n D) 2
answered
Apr 3
in
Set Theory & Algebra

25
views
isi2004
polynomials
0
votes
11
tanenbaum
An upperlayer packet is split into 10 frames, each of which has an 80% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? how is it different if we use error control ?
answered
Apr 1
in
Computer Networks

36
views
computernetworks
tanenbaum
+1
vote
12
deterministic and non deterministic push down automata
answered
Apr 1
in
Theory of Computation

447
views
0
votes
13
From a Question bank
answered
Mar 30
in
Calculus

63
views
calculus
limits
engineeringmathematics
gate
+1
vote
14
MIT Course
For each group of functions, sort the functions in increasing order of asymptotic (bigO) complexity: $\begin{align*} &(a) \;\;f1(n) = n^{0.999999} * \log n \\ &(b) \;\;f2(n) = 10000000n \\ &(c) \;\; ... exponential function, but since the power is to 1.000001, it is growing very slowly, since base is tending to 1 only. Someone please check this.
answered
Mar 22
in
Algorithms

136
views
timecomplexity
algorithms
0
votes
15
Peter Linz Exercise 4.3
answered
Mar 18
in
Theory of Computation

40
views
theoryofcomputation
regularlanguages
pumpinglemma
0
votes
16
set theory and algebra
answered
Mar 14
in
Set Theory & Algebra

33
views
settheory&algebra
engineeringmathematics
discretemathematics
sets
0
votes
17
typedef
typedef int (*test)(float*, float*); test tmp; i am unable to understand the code ,please help!
answered
Mar 14
in
Programming

133
views
+1
vote
18
geeksforgeeks Computer NEtwork IP adressing
answered
Mar 14
in
Computer Networks

92
views
computernetworks
ip
adressing
+4
votes
19
GATE20171GA1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. (A) was wishing (B) is wishing (C) wished (D) had wished
answered
Mar 10
in
Verbal Ability

1.6k
views
gate20171
verbalability
tenses
englishgrammar
normal
0
votes
20
graph theory
can somebody explain the logic behind this theorem ?
answered
Mar 9
in
Graph Theory

89
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+2
votes
21
rosen excercise
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 + x6 = 29, where xi , i = 1, 2, 3, 4, 5, 6, is a nonnegative integer such that a) x1 ≤ 5? b) x1 < 8 and x2 > 8?
answered
Mar 9
in
Combinatory

29
views
0
votes
22
algorithm
finf the tc T(n)=nlogn +T(n1)
answered
Mar 9
in
Algorithms

71
views
+1
vote
23
ISI 2015 PCB C4 C
For the alphabet Σ = {a,b}, the enumeration of the strings of {a,b}* in the lexicographic order is following {ϵ, a, b, aa, ab, ba, bb, aaa, aab,...} List the fist 5 strings in lexicographic order, in the complement of {a, ab}*
answered
Mar 9
in
Theory of Computation

57
views
isi2015
theoryofcomputation
+1
vote
24
ISI 2015 PCB C4 B
Draw a 4state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
answered
Mar 9
in
Theory of Computation

89
views
theoryofcomputation
isi2015
finiteautomata
dfa
0
votes
25
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

64
views
theoryofcomputation
regularexpressions
0
votes
26
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

53
views
theoryofcomputation
regularexpressions
0
votes
27
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

57
views
theoryofcomputation
regularexpressions
0
votes
28
MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
answered
Mar 9
in
Databases

220
views
databases
transactions
0
votes
29
maximum records in join operation ME mock
answered
Mar 8
in
Databases

59
views
+2
votes
30
ISRO 2013  Matrices [Mech]
If A is Square Matrix of order 3, then product of A and its transpose is (a) Unit Matrix (b) Zero Matrix (c) Identity Matrix (d) Symmetric Matrix
answered
Mar 8
in
Linear Algebra

169
views
engineeringmathematics
isro
isromech
+3
votes
31
Code optimization
Consider the following source code : c = a + b d = c c = c – e a = d – e b = b * e b = d/b (A) No optimization is possible (B) d = c c = c – e a = d – e b = b * e b = d/b (C) c = a + b d = c c = c – e a = d – e b = d/b (D) c = a + b t = b * e a = d – e b = d/t c = a
answered
Mar 8
in
Compiler Design

137
views
codeoptimization
compilerdesign
0
votes
32
techtud c programming
Ans is C can anybody justify why compilation error
answered
Mar 8
in
Programming

96
views
programminginc
output
+2
votes
33
k.Rosen excercise. . How many positive integers less than 1000....
answered
Mar 8
in
Combinatory

61
views
0
votes
34
Ace Test Series_Mock Test1_Question 23
answered
Mar 8
in
Algorithms

57
views
acetestseries
algorithms
+1
vote
35
palindrome TOC
answered
Mar 8
in
Theory of Computation

55
views
+3
votes
36
ISRO 2013 Probability [Mech]
If the probability for A to fail an examination is 0.2 and that for B is 0.3, then probability that either A of B fail is (a) 0.5 (b) 0.06 (c) 0.44 (d) 0.38
answered
Mar 8
in
Probability

138
views
engineeringmathematics
isromech
probability
0
votes
37
GATE2017135
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n  2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); ... n); } The output printed when $\text{fun1}(5)$ is called is (A) $53423122233445$ (B) $53423120112233$ (C) $53423122132435$ (D) $53423120213243$
answered
Mar 7
in
Programming

1.4k
views
gate20171
programming
normal
tricky
recursion
+1
vote
38
Consider the following program segment
answered
Mar 6
in
Programming

48
views
+2
votes
39
program output
char *c[] = {"GeksQuiz", "MCQ", "TEST", "QUIZ"}; char **cp[] = {c+3, c+2, c+1, c}; char ***cpp = cp; int main() { printf("%s ", **++cpp); printf("%s ", **++cpp+3); printf("%s ", *cpp[2]+3); printf("%s ", cpp[1][1]+1); return 0; }
answered
Mar 6
in
Programming

191
views
programminginc
pointers
0
votes
40
propositional logic
answered
Mar 6
in
Mathematical Logic

37
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
Page:
1
2
3
next »
24,796
questions
31,868
answers
73,708
comments
30,011
users