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.
Recent activity by rude
User rude
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rude
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE2016Session7GA5
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original number. $39$ $57$ $66$ $93$
answered
Apr 27
in
Numerical Ability

64
views
gate2016session7aptitude
numericalability
numericalcomputation
0
answers
2
Gate 2017
Please explain why L3 is not CFL ?
closed
Apr 21
in
Theory of Computation

33
views
1
answer
3
theory of computation
Answer is [[n(n+1)] / 2 ] + 1 right ??? empty string is also a substring right ???
answer selected
Apr 19
in
Theory of Computation

46
views
theoryofcomputation
1
answer
4
pointer
Which of the following declaration throw runtime error? A. int **c = &c; B. int **c = &*c; C. int **c = **c; D. None of the mentioned. I think C is correct but mentioned correct ans is D how?
answered
Apr 19
in
Programming

58
views
2
answers
5
Check for Regular Language
Check whether given language is Regular or not? WXWR / W,X∈(0,1)+
answered
Apr 19
in
Theory of Computation

64
views
theoryofcomputation
regularlanguages
1
answer
6
theory of computation
can a turing machine accept $\varepsilon$ ??? please explain ??? this question says it can accept ...http://gateoverflow.in/941/gate200353
commented
Apr 19
in
Theory of Computation

73
views
theoryofcomputation
1
answer
7
How to find size of integer on your system in C programming
answered
Apr 19
in
Programming

49
views
programminginc
1
answer
8
BARC2017
Time complexity of dijkstra's algorithm when array used in place of priority queue Options O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
answer selected
Apr 15
in
Algorithms

78
views
3
answers
9
Peter Linz Exercise 8.1
#20 Is the following language L = { amn : m and n are prime } context free?
answer selected
Apr 15
in
Theory of Computation

54
views
theoryofcomputation
contextfree
3
answers
10
Peter Linz Exercise 8.1
#10 Is the below language context free? L = { w1cw2 : w1,w2 ∈ {a,b}* , w1≠ w2} As per my analysis it is not. Please verify.
answer selected
Apr 15
in
Theory of Computation

55
views
theoryofcomputation
contextfree
1
answer
11
theory of computation
answer selected
Apr 15
in
Theory of Computation

37
views
theoryofcomputation
grammar
1
answer
12
how many context switches occur whenever application processes are multiplexed
answer selected
Apr 15
in
Operating System

51
views
2
answers
13
theory of computation
State TRUE or FALSE . For every regular language , there exists a unique minimal DFA . I know that for every regular language, there is a minimal DFA ...but is it unique ? i think it is ...please explain ...
answer selected
Apr 15
in
Theory of Computation

56
views
theoryofcomputation
finiteautomata
grammar
regularexpressions
1
answer
14
theory of computation
What language is accepted by the npda below if we make F = {q0, qf }, where F denotes set of final states. Answer is L = $\sum$* ...........right ???
commented
Apr 12
in
Theory of Computation

43
views
theoryofcomputation
1
answer
15
theory of computation
Is this correct ...?
answered
Apr 12
in
Theory of Computation

40
views
theoryofcomputation
regularexpressions
0
answers
16
theory of computation
commented
Apr 12
in
Theory of Computation

37
views
theoryofcomputation
1
answer
17
theory of computation
The Language is given by, L is a A) Deterministic CFL. B) Non deterministic CFL but not DCFL. Please draw the PDA for the above language ...
commented
Apr 12
in
Theory of Computation

39
views
theoryofcomputation
2
answers
18
theory of computation
Let C be a contextfree language and R be a regular language. Prove that the language C $\cap$ R is context free.
answered
Apr 12
in
Theory of Computation

43
views
theoryofcomputation
2
answers
19
Minimun time taken to find median of a list of number is A) O(log n ) B) O(n) C) O(nlogn) D) O(n^2)
answer selected
Apr 9
in
Algorithms

133
views
1
answer
20
What is exactly access time in cache memory access?
answer selected
Apr 9

57
views
1
answer
21
Digital Logic Doubt
In the min term we select (1), in the max term we select (0). But 1 is greater than 0. Selecting 1 should be called maxterm and selecting 0 should be called Minterm. Why they have the name otherwise?
commented
Apr 7
in
Digital Logic

89
views
digitallogic
kmap
3
answers
22
regular or not regular
Which of the following languages are regular and why a) L= {a n! :n>=1} b)L= {an :n is a perfect square} c)L= {an :n is not a perfect square} d)L= {an :n is not a prime number}
answer selected
Apr 7
in
Theory of Computation

71
views
2
answers
23
Gate 2017 Admission for AIR in 800(s).
commented
Apr 6
in
IISc/IITs

238
views
gate2017addmission
gettingtoiits
2
answers
24
Graph Theory
let G=(V,E) be an connected graph, let $\left  V \right = n$ Find largest value of n such that i) G is complete & ii) G is bipartite with valid proof
commented
Apr 5
in
Algorithms

79
views
graphtheory
2
answers
25
theory of computation
Give regular expression for the complement of the language given below . L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
commented
Apr 4
in
Theory of Computation

55
views
theoryofcomputation
finiteautomata
regularexpressions
2
answers
26
Peter Linz Exercise 8.1
#8 Determine whether or not the following languages are contextfree (a) L= { anwwRan : n>=0 , w ∈ {a,b}* } (b) L = { anbjanbj : n>=0, j>=0 } (c) L = { anbjajbn : n>=0, j>=0 } (d) L= { anbjakbl : n+j<=k+l } (e) L ... nb(w)=2nc(w) } My answers are : (a)CFL (b)Not CFL (c)CFL (d) CFL (e)Not CFL (f)Not CFL (g) Not CFL Please verify.
answer edited
Apr 3
in
Theory of Computation

70
views
theoryofcomputation
contextfree
3
answers
27
CIL17
answered
Apr 3
in
DS

337
views
1
answer
28
Tremblay Manohar
Write the set $\left \{ \phi ,\left \{ \phi \right \} \right \}\phi$
commented
Apr 3
in
Algorithms

58
views
discretemathematics
settheory&algebra
0
answers
29
Evaluation order of function parameters in C
closed
Apr 3
in
Programming

49
views
programminginc
2
answers
30
theory of computation
For the nfa given below, find δ*(q0, 1010) and δ* (q1,00).
commented
Apr 2
in
Theory of Computation

75
views
theoryofcomputation
finiteautomata
1
answer
31
cil2017
closed
Apr 2
in
Algorithms

54
views
cil2017
2
answers
32
permutations and combinations
A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?
answer selected
Apr 2
in
Verbal Ability

134
views
permutationsandcombinations
7
answers
33
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
commented
Apr 2
in
Theory of Computation

1.2k
views
isro2008
theoryofcomputation
contextfree
grammar
1
answer
34
gate 2018
How can i keep motivated during fulltime gate preparation?
answer edited
Apr 2
in
GATE

74
views
gate
1
answer
35
#HeapSort
What is the worst case time complexity of finding a element in max heap tree ? Explain.
answer selected
Apr 1
in
Algorithms

60
views
heapsort
1
answer
36
Regular expression
The set of all strings with at most one pair of consecutive zeros and one pair of consecutive ones.
answer selected
Apr 1
in
Theory of Computation

77
views
2
answers
37
i want to join coaching for gate 2018.
commented
Apr 1
in
Written Exam

76
views
1
answer
38
theory of computation
Let sigma = { a,b }. The minimal number of states in a DFA that accepts set of all strings with A) exactly 2 "a's" and more than 2 "b's". B) atleast one "a" and exactly 2 "b's" .
commented
Apr 1
in
Theory of Computation

29
views
theoryofcomputation
finiteautomata
1
answer
39
theory of computation
commented
Apr 1
in
Theory of Computation

41
views
theoryofcomputation
finiteautomata
1
answer
40
IISc CDS
Hello, I've just received my Call Letter for IISc CDS (M. Tech). My query is that if I attend the interview then will they consider my application for CSA (M.Tech, Direct Admission) ? While filling the form I've chosen CSA as my first preference and CDS as my second. Thank you.
answered
Apr 1
in
IISc/IITs

441
views
iiscinterview
iisc
cds
admissions
23,428
questions
30,143
answers
67,576
comments
28,472
users